M. Allais and . Le, critique des postulats et axiomes de l'école américaine, vol.21, pp.503-546, 1953.

. Amgoud, Comparing Arguments Using Preference Orderings for Argument-based Reasoning, Proceedings of the Eighth IEEE International Conference on Tools with Artificial Intelligence, pp.400-403, 1996.

. Audemard, La méthode d'avalanche AVAL : une méthode énumérative pour SAT, Dans Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pp.17-25, 1999.

/. Bailleux, O. Marquis-;-bailleux, P. Marquis, and . Distance-sat, Voir aussi DISTANCE-SAT : complexité et algorithmes, Dans Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pp.199-206, 1999.

R. J. Bayardo and R. C. Schrag, Using CSP Look-Back Techniques to Solve Real-World SAT Instances, Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pp.203-208, 1997.

/. Benhamou, . Saïs, B. Benhamou, and L. Saïs, Tractability Through Symmetries in Propositional Calculus, In Journal of Automated Reasoning, vol.12, pp.89-102, 1994.
URL : https://hal.archives-ouvertes.fr/hal-01479609

. Bessant, Syntax-based belief revision through local search, Proceedings of Belief Revision (BR'98), 1998.

/. Billionnet, . Sutter, A. Billionnet, and A. Sutter, An efficient algorithm for the 3 satisfiability problem, In Operation Research Letters, vol.12, pp.29-36, 1992.
URL : https://hal.archives-ouvertes.fr/hal-01124507

/. Bonet, . Geffner, B. Bonet, H. Geffner, Y. Boufkhad et al., Gestion de la dynamicité et énumération d'impliquants premiers : une approche fondée sur les Diagrammes de Décision Binaire, Proceedings of European Conference on Planning (ECP'99), vol.6, pp.27-65, 1986.

. Cadoli, An algorithm to Evaluate Quantified Boolean Formulae, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp.262-267, 1998.

T. Castell, Consistance et déduction en logique propositionnelle, 1997.

. Castell, Using the Davis and Putnam procedure for an efficient computation of preferred models, Proceedings of the Twelfth European Conference on Artificial Intelligence (ECAI'96), pp.350-354, 1996.

. Castell, Modèles P-restreints : application à l'inférence propositionnelle, Dans Actes du Onzième Congrès Reconnaissance des Formes et Intelligence Artificielle (RFIA'98), pp.205-214, 1998.

/. Castell, T. Cayrol-;-castell, and M. Cayrol, Computation of Prime Implicates and Prime Implicants by the Davis and Putnam Procedure, Proceedings of the ECAI'96 Workshop on Advances in Propositional Deduction, pp.5-10, 1996.

/. Castell, T. Fargier-;-castell, and H. Et-fargier, Entre SAT et CSP : Problèmes de Satisfaction Propositionnels et CSPs clausaux, Dans Actes du Onzième Congrès Reconnaissance des Formes et Intelligence Artificielle (RFIA'98), pp.117-126, 1998.

. Cayrol, Management of preferences in Assumption-based Reasoning, In Lecture Notes In Computer Science, vol.682, pp.13-22, 1993.

C. Chang, C. Lee, and R. , Symbolic Logic and Mechanical Theorem Proving, 1973.

P. Chatalic/simon-;-chatalic, L. Simon, and P. Davis, 40 ans après : une première expérimentation, Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pp.9-16, 1999.

L. Console/torasso-;-console, P. Torasso, and S. Cook, A spectrum of logical definitions of model-based diagnosis, Proceedings of the Third IEEE Symposium on the Foundations of Computer Science, vol.3, pp.151-158, 1971.

. Crawford, Symmetry-Breaking Predicates for Search Problems, Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), pp.148-159, 1996.

J. M. Crawford/auton-;-crawford and L. D. Auton, Experimental results on the crossover point in satisfiability problems, Proceedings of the Eleventh National Conference on Artificial Intelligence (AAAI'93), pp.21-27, 1993.

. Davis, A machine program for theorem proving, In Communications of the ACM, issue.5, pp.394-397, 1962.

/. Davis, M. Putnam-;-davis, and H. Putnam, A computing procedure for quantification theory, In Journal of the ACM, issue.7, pp.201-215, 1960.

R. Dechter/rish-;-dechter and I. Rish, Directional Resolution: the Davis-Putnam Procedure, Revisited, Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Revision (KR'94), pp.134-145, 1994.

J. -kleer-;-de-kleer, J. De-kleer, J. De-kleer, J. De-kleer, J. De-kleer et al., A general Labeling Algorithm for Assumption-based Truth Maintenance, Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI'88), vol.28, pp.197-222, 1986.

/. Kleer, J. Williams-;-de-kleer, and B. C. Williams, Diagnosing multiple faults, In Artificial intelligence, vol.32, pp.97-130, 1987.

A. P. Dempster, Upper and lower probabilities induced by a multivalued mapping, Annals of Mathematical Statistics, vol.38, pp.325-339, 1967.

. Dubois, Handling Uncertain Knowledge in an ATMS using Possibilistic Logic, In Methodologies for Intelligent Systems, vol.5, pp.252-259, 1990.

. Dubois, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp.415-436, 1996.

. Dubois, Logical representation and computation of optimal decisions in a qualitative setting, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp.588-593, 1998.

. Dubois, Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms, Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence (UAI'93), vol.37, pp.114-121, 1961.

. [even, On the complexity of timetable and multicommodity flow problems, In SIAM J. on Computing, issue.5, pp.691-703, 1976.

K. D. Forbus/de-kleer-;-forbus and J. De-kleer, Focusing the ATMS, Proceedings of the Sixth National Conference on Artificial Intelligence (AAAI'88), pp.193-198, 1988.

J. Franco, Elimination of infrequent variables improves average case performance of satisfiability algorithms, In SIAM J. on Computing, vol.20, pp.1119-1127, 1991.

L. Fratta/montanari-;-fratta and U. Montanari, Boolean Algebra Methods to Probabilistic Communications Networks, In IEEE Trans. Circuit Theory, vol.20, pp.203-211, 1973.

J. W. Freeman, Improvements to Propositional Satisfiability Search Algorithms, Knowledge in Flux : Modeling the Dynamics of Epistemics States, 1988.

G. Garey, M. R. Johnson, and D. S. , Computers and intractability : A guide to the Theory of NP-Completeness, 1979.

. Gelfond, On the relationship between circumscription and negation as failure, In Artificial Intelligence, vol.38, pp.273-287, 1986.

/. Génisson, R. Siegel-;-génisson, and P. Siegel, A polynomial method for sub-clauses production, Proceedings of the Sixth International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'94), pp.25-34, 1994.

/. Gent, I. P. Walsh-;-gent, and T. Walsh, Beyond NP: the QSAT phase transition, Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), pp.648-653, 1999.

F. Glover/laguna-;-glover, M. Laguna, and T. Search, Modern Heuristic Techniques for Combinatorial Problems, pp.70-141, 1993.

. Gomes, Boosting Combinatorial Search Through Randomization, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp.431-437, 1998.

E. Grégoire, Gestion efficace de l'inconsistance dans les bases de connaissances stratifiées, Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pp.121-127, 1999.

. Grégoire, Logically-complete local search for propositional nonmonotonic knowledge bases, Proceedings of the KR'98 Workshop on Computational Aspects of Nonmonotonic Reasoning, pp.37-45, 1998.

. Greiner, A Correction to the Algorithm in Reiter's Theory of Diagnosis, In Artificial Intelligence, vol.41, issue.1, pp.79-88, 1989.

J. F. Groote/warners-;-groote and J. P. Warners, The propositional formula checker HeerHugo, Centrum voor Wiskunde en Informatica (CWI), 1999.

J. Gu, How to solve Very Large-Scale Satisfiability problem, 1988.

. Gu, Algorithms for the satisfiability (SAT) Problem: A survey, Satisfiability Problem: Theory and applications, pp.19-152, 1997.

Y. Hamadi/merceron-;-hamadi and D. Merceron, Reconfigurable Architectures: A new Vision for Optimization Problems, Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP'97), pp.209-221, 1997.

J. Harrison, Stålmarck's Method as a HOL Derived Rule, Proceedings of the 9th international Conference on Theorem Proving in Higher Order Logics (TPHOLs'96), vol.1125, pp.221-234, 1996.

/. Harvey, . Ginsberg, W. D. Harvey, and M. L. Ginsberg, Limited Discrepancy Search, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pp.607-613, 1995.

/. Hooker, . Vinay, J. N. Hooker, and V. Vinay, Branching Rules for Satisfiability, Journal of Automated Reasoning, vol.15, pp.359-383, 1995.

. Jeannicot, Evaluation sémantique en calcul propositionnel : une propriété de coupure pour rendre plus efficace la procédure de Davis et Putnam, Dans La Revue d'Intelligence Artificielle, pp.41-60, 1988.

/. Jeroslow, R. J. Wang-;-jeroslow, and J. Wang, Solving propositional satisfiability problems, In Annals of Mathematics and Artificial Intelligence, issue.1, pp.167-188, 1990.

/. Johnson and . Trick, Second DIMACS Implementation Challenge : Cliques, coloring and Satisfiability, vol.26, 1996.

H. Kautz/selman-;-kautz and B. Selman, Pushing the Envelope : Planning, Propositional Logic, and Stochastic Search, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'96), pp.1194-1201, 1996.

H. Kautz/selman-;-kautz and B. Selman, Unifying SAT-based and Graph-based Planning, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), pp.318-325, 1999.

/. Kean, A. Tsiknis-;-kean, and G. Tsiknis, Assumption based Reasoning and Clause Management Systems, 1990.

/. Kean, A. Tsiknis-;-kean, and G. Tsiknis, Assumption-based reasoning and clause management systems, In Computational Intelligence, vol.1, issue.8, pp.1-24, 1992.

/. Kim, S. Zhang-;-kim, and H. Zhang, ModGen: Theorem proving by model generation, Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI'94), pp.162-167, 1994.

R. E. Korf, Improved Limited Discrepancy Search, Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI'96), pp.286-291, 1996.

/. Kowalsky, R. A. Kuehner-;-kowalsky, and D. Kuehner, Linear Resolution with Selection Function, In Artificial Intelligence, issue.2, pp.227-260, 1971.

/. Lawler, E. L. Wood-;-lawler, and D. E. Wood, Branch and Bound method : A survey, Operations Research, vol.14, pp.699-719, 1966.

L. Le-berre and D. , Le calcul de modèles possibles basé sur la procédure de Davis et Putnam, et ses applications, Rapport IRIT / 96-32-R, 1996.

C. M. Li, Equivalency Reasoning to Solve a Class of Hard Sat Problems, 1999.

C. M. Li/anbulagan-;-li and . Anbulagan, Heuristics Based on Unit Propagation for Satisfiability Problems, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pp.121-127, 1985.

/. Lin, F. Reiter-;-lin, R. Et-reiter, M. L. Littman, L. Lobjois et al., Branch and Bound Algorithm Selection by Performance Prediction, Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI'99), vol.36, pp.445-453, 1987.

J. P. Silva/-sakallah-;-marques-silva, K. A. Sakallah, and P. Marquis, Algorithms for Uncertain and Defeasible Reasoning, Proceedings of the International Conference on Computer-Aided Design, vol.5, pp.220-227, 1996.

F. Massacci, De la Satisfiabilité à la Compilation de Bases de Connaissances Propositionnelles, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), pp.290-295, 1999.

. Mazure, Detecting logical inconsistencies, Proceedings of Mathematics and Artificial Intelligence Symposium (AI-MATH'96), pp.116-121, 1996.

. Mazure, Tabu search for SAT, Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), pp.281-285, 1997.

. Mazure, Boosting Complete Techniques thanks to local search methods, In Annals of Mathematics and Artificial Intelligence, vol.22, pp.319-331, 1998.

/. Mazure, B. Marquis-;-mazure, and P. Marquis, Theory Reasoning within Implicant Cover Compilation, Proceedings of ECAI'96 Workshop on Advances in Propositionnal Deduction, pp.65-69, 1996.

. Mcallester, Applications of circumscription to formalizing common-sense knowledge, Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), vol.28, pp.89-116, 1986.

W. Mccune, A Davis-Putnam Program and its Application to Finite First-Order Model Search: Quasigroup Existence Problem, 1994.

J. Minker, On indefinite databases and the closed world assumption, Proceedings of the Sixth Conference on Automated DEduction, pp.292-308, 1982.

/. Monien, B. Speckenmeyer-;-monien, and E. Speckenmeyer, Solving Satisfiability in less than 2n steps, In Discrete Applied Mathematics, issue.10, pp.287-295, 1985.

T. H. Ngair/provan-;-ngair and G. Provan, A lattice-theoretic analysis of ATMS problem solving, Proceedings of ECSQARU'93, pp.284-289, 1993.

I. Niemelä, I. Niemelä, L. Oxusoff, A. Et-rauzy, and . Palopoli, Etude et implémentation de nouveaux mécanismes d'inférence en logique propositionnelle. Application aux ATMS, Proceedings of the Fifth Workshop on Theorem Proving with Analytic Tableaux and Related Methods, vol.2, pp.41-72, 1989.

/. Parkes, A. J. Walser-;-parkes, J. P. Walser, J. Pearl, D. Prawitz et al., An analysis of ATMS-based techniques for computing Dempster-Shafer belief functions, Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (IJCAI'89), pp.1115-1120, 1965.

G. M. Provan, A formal analysis of cost-functions for ATMS focusing, Proceedings of the Mathematics and Artificial Intelligence Symposium (AI-MATH'96), pp.130-133, 1996.

O. Raiman/de-kleer-;-raiman and J. De-kleer, A Minimality Maintenance System, Proceedings of the Third International Conference on Principles on Knowledge Representation and Reasoning (KR'92), pp.532-538, 1992.

. Rauzy, Calcul propositionnel : vers une extension du formalisme, Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-complets (JNPC'99), pp.189-198, 1999.

R. Reiter, R. Reiter, and R. Reiter, A logic for default reasoning, Logic and Data Bases, Gallaire H. et Minker J., Plenum, vol.13, pp.57-95, 1978.

;. Reiter/de-kleer, R. Reiter, and J. De-kleer, Foundations of Assumption-based truth maintenance systems : preliminary report, Proceedings of the Fifth National Conference on Artificial Intelligence (AAAI'87), pp.183-188, 1987.

J. Rintanen and J. A. Robinson, Improvement to the Evaluation of Quantified Boolean Formulae, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), vol.12, pp.23-41, 1965.

J. A. Robinson, R. Rymon, R. Sabbadin, L. J. Savage, and R. Schrag, Une approche ordinale de la décision dans l'incertain : axiomatisation, représentation logique et application à la décision séquentielle, Proceedings of the Third International Conference on Principles on Knowledge Representation and Reasoning (KR'92), vol.1, pp.510-515, 1954.

/. Schrag, R. C. Crawford-;-schrag, and J. M. Crawford, Implicates and Prime Implicates in Random 3SAT, In Artificial Intelligence, vol.81, pp.199-222, 1996.

. Selman, A new method for solving hard satisfiability problems, Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI'97), pp.50-54, 1992.

B. Selman/kautz-;-selman and H. Kautz, Domain-independant Extensions to GSAT : Solving Large Structured Variables, Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (JCAI'93), pp.290-295, 1993.

G. Shafer, M. Sheeran, and G. Stålmark, A tutorial on Stålmark's proof procedure for propositional logic, Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI'87), vol.152, pp.388-393, 1976.

P. Siegel, Représentation et utilisation de la connaissance en calcul propositionnel, 1987.

P. Smets, R. M. Smullyan, and G. Stålmarck, A system for determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are generated from a formula, Probability of deductibility and Belief Functions, In ECSQARU (LNCS 747), vol.0403, p.76, 1968.

M. M. Tatar and P. Tayrac, Combining the Lazy Label Evaluation with Focusing Techniques in an ATMS, Proceedings of the Eleventh European Conference on Artificial Intelligence (ECAI'94), pp.160-164, 1990.

G. Verfaillie/lobjois-;-verfaillie and L. Et-lobjois, Problèmes incohérents : expliquer l'incohérence, restaurer la cohérence, Actes des Cinquièmes Journées Nationales sur la Résolution Pratique de Problèmes NP-Complets (JNPC'99), pp.111-120, 1999.

W. J. Du, D. Gu, J. Et-pardalos, P. Warners, J. P. Van-maaren et al., A two phase algorithm for solving a class of hard satisfiability problems, Satisfiability Problem: Theory and applications, pp.81-88, 1997.

S. A. Wolfman/weld-;-wolfman and D. S. Weld, The LPSAT Engine and its Application to Resource Planning, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI'99), pp.310-316, 1999.

R. Yacoub, Stratégies de résolution pour focaliser un système de maintien de la cohérence, 1997.

A. Yahya/henschen-;-yahya and L. J. Henschen, Deduction in non-horn databases, In Journal of Automated Reasoning, issue.1, pp.141-160, 1985.

. Yokoo, Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results, Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP'96), pp.495-509, 1996.

/. Zhang, H. Stickel-;-zhang, and M. Stickel, Implementing the Davis-Putnam algorithm by Tries, 1994.

/. Zhang, H. Stickel-;-zhang, and M. E. Stickel, An efficient Algorithm for Unit Propagation, Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics (AI-MATH'96), 1996.

*. Connaissances,

, _CARD"|"_1CARD"] (%CLAUSE%|%CUBE%) // pour calculer le label d'une formule // CARD : tous les environnements du label minimaux pour la cardinalité // 1CARD : 1 seul des environnements du label minimal pour la cardinalité

. De-cwr-("_cwa"-|-"_gcwa"-|-"_egcwa"-|-"_ccwa"-|-"_ecwa"-|-suivant, Utilité pessimiste, Traitement du fichier : Robots.scp Utilité optimiste : BB Solutions

, Les fichiers de tests utilisés par notre prototype permettent de tester un algorithme sur des bases 3-SAT générées aléatoirement selon différents critères. Ils utilisent la syntaxe suivante

, Nom de l'algorithme à tester et ses paramètres

, // Par défaut, ce sont les littéraux négatifs qui sont sélectionnés

/. Le-nombre-de-variables, _VAR" %ENTIER%

|. //-soit-en-donnant-directement-le-nombre-de-clauses and . %entier%,

, Lorsque le script commence, les caractéristiques de la machine sont affichées, ainsi que les principaux paramètres

, Chaque algorithme affiche ses propres données : on retrouve le plus souvent CU (nombre de propagation de clauses unitaires), LP (propagation de littéraux purs), NODES (noeuds de branchement ou nombre d'appels récursifs à l'algorithme)

&. ,