, Debian policy manual

, Eclipse rich client platform, 2010.

, First international constraint satisfaction solver competition

, Open services gateway initiative

. Openome, , 2010.

, Design, Automation and Test in Europe Conference and Exposition, pp.3-7, 2003.

, Mancoosi : managing software complexity, 2008.

F. Aloul, A. Ramani, I. Markov, and K. Sakallah, Generic ILP versus Specialized 0-1 ILP : an update, Proceedings of ICCAD'02, pp.450-457, 2002.

C. Ansótegui, M. L. Bonet, and J. Levy, On solving maxsat through sat, Frontiers in Artificial Intelligence and Applications, vol.202, pp.284-292, 2009.

C. Ansótegui, M. L. Bonet, and J. Levy, A new algorithm for weighted partial maxsat, 2010.

J. Argelich, D. L. Berre, I. Lynce, P. M. João, P. Silva et al., Solving Linux Upgradeability Problems Using Boolean Optimization, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00870877

J. Argelich, C. M. Li, F. Manya, and J. Planes, Fourth max-sat evaluation, 2009.

J. Argelich, C. M. Li, F. Manya, and J. Planes, Fifth max-sat evaluation, 2010.

K. J. Arrow, Social choice and individual values, 1951.

R. Asín, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez-carbonell, Efficient generation of unsatisfiability proofs and cores in sat, Lecture Notes in Computer Science, vol.5330, pp.16-30, 2008.

G. Audemard, L. Bordeaux, Y. Hamadi, S. Jabbour, and L. Saïs, A generalized framework for conflict analysis, Lecture Notes in Computer Science, vol.4996, pp.21-27, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00800738

G. Audemard, D. L. Berre, O. Roussel, I. Lynce, and J. Marques-silva, Opensat : an open source sat software project, Sixth International Conference on Theory and Applications of Satisfiability Testing(SAT'03), 2003.

G. Audemard and L. Simon, Predicting learnt clauses quality in modern sat solvers, pp.399-404

, Theory and Applications of Satisfiability Testing, 8th International Conference, SAT 2005, vol.3569, 2005.

P. Barth, A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization, 1995.

D. Batory, Algebraic hierarchical equations for application design tool suite, 2010.

D. S. Batory, Feature models, grammars, and propositional formulas, Lecture Notes in Computer Science, vol.3714, pp.7-20, 2005.

J. Roberto, R. C. Bayardo, and . 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.

P. Beame, H. A. Kautz, and A. Sabharwal, Towards understanding and harnessing the potential of clause learning, J. Artif. Intell. Res. (JAIR), vol.22, pp.319-351, 2004.

D. Benavides, S. Segura, P. Trinidad, and A. Cortés, Fama : Tooling a framework for the automated analysis of feature models, 01 of Lero Technical Report, pp.129-134, 2007.

S. Benferhat, S. Kaci, D. L. Berre, and M. Williams, Weakening conflicting information for iterated revision and knowledge integration, IJCAI, pp.109-118, 2001.

S. Benferhat, S. Kaci, D. L. Berre, and M. Williams, Weakening conflicting information for iterated revision and knowledge integration, Artif. Intell, vol.153, issue.1-2, pp.339-371, 2004.

B. Benhamou, L. Saïs, and P. Siegel, Two proof procedures for a cardinality based language in propositional calculus, 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume, vol.775, pp.71-82, 1994.

, Armin Biere. Lingeling, plingeling, picosat and precosat at sat race 2010. SAT 2010 solver description

, Armin Biere. Picosat essentials. JSAT, vol.4, issue.2-4, pp.75-97, 2008.

A. Biere, Bounded model checking, vol.36, pp.457-481

A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, Symbolic model checking using SAT procedures instead of bdds, Proceedings of Design Automation Conference (DAC'99), 1999.

A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, Symbolic model checking without bdds, Lecture Notes in Computer Science, vol.1579, pp.193-207, 1999.

A. Biere and C. P. Gomes, Theory and Applications of Satisfiability Testing -SAT 2006, 9th International Conference, vol.4121, 2006.

A. Biere, M. Heule, T. Hans-van-maaren, and . Walsh, Handbook of Satisfiability, vol.185, 2009.

G. Blin, F. Sikora, and S. Vialette, GraMoFoNe : a Cytoscape plugin for querying motifs without topology in Protein-Protein Interactions networks, 2nd International Conference on Bioinformatics and Computational Biology (BICoB'10), pp.38-43, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00425661

A. Bockmayr and F. Eisenbrand, Combining logic and optimization in cutting plane theory, Lecture Notes in Computer Science, vol.1794, pp.1-17, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00099172

M. L. Bonet, J. Luis-esteban, N. Galesi, and J. Johannsen, On the relative complexity of resolution refinements and cutting planes proof systems, SIAM J. Comput, vol.30, issue.5, pp.1462-1484, 2000.

M. L. Bonet, K. St, and . John, Efficiently calculating evolutionary tree measures using sat, pp.4-17

, Proceedings of the 21st International Joint Conference on Artificial Intelligence, 2009.

G. Brewka, S. Benferhat, and D. L. Berre, Qualitative choice logic, KR, pp.158-169, 2002.

G. Brewka, S. Benferhat, and D. L. Berre, Qualitative choice logic, Artif. Intell, vol.157, issue.1-2, pp.203-237, 2004.

M. Buro and H. K. Büning, Bulletin of the European Association for Theoretical Computer Science, vol.49, pp.143-151, 1993.

T. Castell, C. Cayrol, M. Cayrol, and D. L. Berre, Using the davis and putnam procedure for an efficient computation of preferred models, pp.350-354, 1996.

D. Chai and A. Kuehlmann, A fast pseudo-boolean constraint solver, ACM/IEEE Design Automation Conference (DAC'03), pp.830-835, 2003.

P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the really hard problems are, IJCAI, pp.331-340, 1991.

J. Giesl, R. Thiemann, P. Schneider-kamp, and S. Falke, Automated termination proofs with aprove, Proceedings of the 15th International Conference on Rewriting Techniques and Applications (RTA-04), vol.3091, pp.210-220, 2004.

E. Giunchiglia, M. Narizzano, A. Tacchella, and M. Y. Vardi, Towards an efficient library for sat : a manifesto, Electronic Notes in Discrete Mathematics, vol.9, pp.290-310, 2001.

E. Giunchiglia and A. Tacchella, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003, vol.2919, 2003.

F. Giunchiglia, P. Shvaiko, and M. Yatskevich, S-match : an algorithm and an implementation of semantic matching, Lecture Notes in Computer Science, vol.3053, pp.61-75, 2004.

I. Evguenii, Y. Goldberg, and . Novikov, Berkmin : A fast and robust sat-solver, DATE, pp.142-149, 2002.

I. Evguenii, Y. Goldberg, and . Novikov, Verification of proofs of unsatisfiability for cnf formulas, pp.10886-10891

C. P. Gomes, B. Selman, and H. A. Kautz, Boosting combinatorial search through randomization, AAAI/IAAI, pp.431-437, 1998.

R. Gomory, Outline of an algorithm for integer solutions to linar programs, vol.64, pp.275-278, 1958.

A. Graça, J. Marques-silva, I. Lynce, and A. L. Oliveira, Efficient haplotype inference with pseudo-boolean optimization, Lecture Notes in Computer Science, vol.4545, pp.125-139, 2007.

A. Haken, The intractability of resolution, Theor. Comput. Sci, vol.39, pp.297-308, 1985.

Y. Hamadi, S. Jabbour, and L. Saïs, Control-based clause sharing in parallel sat solving, pp.499-504
URL : https://hal.archives-ouvertes.fr/hal-00865315

M. Heule, M. Dufour, J. Van-zwieten, and H. Van-maaren, March eq : Implementing additional reasoning into an efficient look-ahead sat solver, Hoos and Mitchell, vol.95, pp.345-359

M. Heule and . Hans-van-maaren, March dl : Adding adaptive heuristics and a new branching strategy, JSAT [117, pp.47-59

J. N. Hooker, Generalized resolution and cutting planes, Ann. Oper. Res, vol.12, issue.1-4, pp.217-239, 1988.

H. Holger, D. G. Hoos, and . Mitchell, Theory and Applications of Satisfiability Testing, 7th International Conference, 2004.

F. Hutter, H. Holger, T. Hoos, and . Stützle, Automatic algorithm configuration based on local search, AAAI, pp.1152-1157, 2007.

D. Jackson, Alloy : A new technology for software modelling, TACAS, vol.2280, 2002.

D. S. Johnson and M. A. Trick, Second DIMACS implementation challenge : cliques, coloring and satisfiability, vol.26, 1996.

U. Junker, Quickxplain : Preferred explanations and relaxations for overconstrained problems, AAAI, pp.167-172, 2004.

R. M. Karp, Complexity of Computer Computations (Symposium Proceedings), chapter Reducibility Among Combinatorial Problems, 1972.

A. Henry, B. Kautz, and . Selman, Unifying sat-based and graph-based planning, IJCAI, pp.318-325, 1999.

J. G. Kemeny, Mathematics without numbers, Daedalus, vol.88, pp.575-591, 1959.

T. Kirkland and M. R. Mercer, A topological search algorithm for atpg, DAC '87 : Proceedings of the 24th ACM/IEEE Design Automation Conference, pp.502-508, 1987.

O. Kullmann, The sat 2005 solver competition on random instances, pp.61-102

, Theory and Applications of Satisfiability Testing -SAT 2009, 12th International Conference, vol.5584, 2009.

C. Kästner, T. Thüm, G. Saake, J. Feigenspan, T. Leich et al., Featureide : A tool framework for feature-oriented software development, ICSE, pp.611-614, 2009.

. Daniel-le-berre, Ads : a unified computational framework for some consistency and abductive based propsositional reasoning, 2nd Australasian Workshop on Computational Logic(AWCL'01), 2001.

. Daniel-le-berre, Exploiting the real power of unit propagation lookahead, Electronic Notes in Discrete Mathematics, vol.9, pp.59-80, 2001.

P. Daniel-le-berre and M. Marquis, Aggregating interval orders by propositional optimization, Rossi and Tsoukiàs, vol.149, pp.249-260

M. Daniel-le-berre, L. Narizzano, A. Simon, and . Tacchella, The second qbf solvers comparative evaluation, vol.95, pp.376-392

L. Daniel, A. Berre, and . Parrain, On extending sat solvers for pb problems, 14th RCRA workshop Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion(RCRA07), 2007.

L. Daniel, A. Berre, and . Parrain, The sat4j library 2.2, system description, Boolean Modeling and Computation, vol.7, pp.59-64, 2010.

L. Daniel, P. Berre, and . Rapicault, Dependency management for the eclipse ecosystem, Proceedings of IWOCE2009 -Open Component Ecosystems International Workshop, pp.21-30, 2009.

L. Daniel, L. Berre, and . Simon, The essentials of the sat 2003 competition, Giunchiglia and Tacchella, vol.83, pp.452-467

L. Daniel, L. Berre, and . Simon, Fifty-Five Solvers in Vancouver : The SAT 2004 Competition, vol.95, pp.321-344

, Journal on Satisfiability, Boolean Modeling and Computation, Special Volume on the SAT 2005 competitions, evaluations, vol.2, 2006.

L. Daniel-le-berre, O. Simon, and . Roussel, International sat competition, 2009.

L. Daniel-le-berre, A. Simon, and . Tacchella, Challenges in the qbf arena : the sat'03 evaluation of qbf solvers, Giunchiglia and Tacchella, vol.83, pp.468-485

D. Lesaint, D. Mehta, O. Barry, L. Sullivan, N. Quesada et al., Solving a telecommunications feature subscription configuration problem

. Stuckey, Lecture Notes in Computer Science, vol.5202, pp.67-81

. Springer, , 2008.

D. Lesaint, D. Mehta, O. Barry, L. Sullivan, N. Quesada et al., Developing approaches for solving a telecommunications feature subscription problem, Journal of Artificial Intelligence Research, vol.38, pp.271-305, 2010.

M. Chu and A. Li, Heuristics based on unit propagation for satisfiability problems, IJCAI (1), pp.366-371, 1997.

M. Chu, F. Li, and . Manyà, Maxsat, hard and soft constraints, vol.36, pp.613-631

M. Luby, A. Sinclair, and D. Zuckerman, Optimal Speedup of Las Vegas Algorithms, Inf. Process. Lett, vol.47, issue.4, pp.173-180, 1993.

M. Lukasiewycz, M. Glaß, F. Reimann, and S. Helwig,

Y. S. Mahajan, Z. Fu, and S. Malik, Zchaff2004 : An efficient sat solver, vol.95, pp.360-375

F. Mancinelli, J. Boender, R. Di-cosmo, J. Vouillon, B. Durak et al., Managing the complexity of large free and open source package-based software distributions, Proceedings of the 21st IEEE/ACM International Conference on Automated Software Engineering (ASE06), pp.199-208, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00149566

V. Manquinho and O. Roussel, Pseudo-boolean competition, 2010.

M. Vasco, O. Manquinho, and . Roussel, The first evaluation of pseudo-boolean solvers (pb'05), JSAT [117, pp.103-143

M. Vasco, . Manquinho, P. João, and . Silva, On solving boolean optimization with satisfiability-based algorithms, AMAI, 2000.

M. Vasco, . Manquinho, P. João, and . Silva, On using satisfiability-based pruning techniques in covering algorithms, DATE, pp.356-363, 2000.

J. P. Marques-silva and K. A. Sakallah, GRASP -A New Search Algorithm for Satisfiability, Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp.220-227, 1996.

J. Marques, -. Silva, and J. Planes, Algorithms for maximum satisfiability using unsatisfiable cores, DATE, pp.408-413, 2008.

B. Mazure, L. Saïs, and E. Grégoire, Tabu search for sat, Proceedings of the 14th American National Conference on Artificial Intelligence (AAAI'97), pp.281-285, 1997.

M. Mendonça, M. Branco, and D. D. Cowan, S.p.l.o.t. : software product lines online tools, OOPSLA Companion, pp.761-762, 2009.

I. Mironov and L. Zhang, Applications of sat solvers to cryptanalysis of hash functions, Biere and Gomes, vol.35, pp.102-115

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff : Engineering an Efficient SAT Solver, Proceedings of the 38th Design Automation Conference (DAC'01), pp.530-535, 2001.

M. Narizzano, C. Peschiera, L. Pulina, and A. Tacchella, Evaluating and certifying qbfs : A comparison of state-of-the-art tools, AI Commun, vol.22, issue.4, pp.191-210, 2009.

M. Narizzano, L. Pulina, A. Tacchella, and ;. Ai*ia, Ranking and reputation systems in the qbf competition, Lecture Notes in Computer Science, vol.4733, pp.97-108, 2007.

J. Neigenfind, G. Gyetvai, R. Basekow, S. Diehl, U. Achenbach et al., Haplotype inference from unphased snp data in heterozygous polyploids based on sat, BMC Genomics, vol.9, issue.1, p.356, 2008.

M. Nikolic, Statistical methodology for comparison of sat solvers, Strichman and Szeider, vol.164, pp.209-222

R. Ostrowski, É. Grégoire, B. Mazure, and L. Saïs, Recovering and exploiting structural knowledge from cnf formulas, Lecture Notes in Computer Science, vol.2470, pp.185-199, 2002.

M. Ouimet and K. Lundqvist, The tasm toolset : Specification, simulation, and formal verification of real-time systems, Lecture Notes in Computer Science, vol.4590, pp.126-130, 2007.

C. Peschiera, L. Pulina, A. Tacchella, U. Bubeck, O. Kullmann et al., The seventh qbf solvers evaluation (qbfeval'10), Strichman and Szeider, vol.164, pp.237-250

K. Pipatsrisawat and A. Darwiche, A lightweight component caching scheme for satisfiability solvers, Lecture Notes in Computer Science, vol.4501, pp.294-299, 2007.

K. Pipatsrisawat and A. Darwiche, On the power of clause-learning sat solvers with restarts, Lecture Notes in Computer Science, vol.5732, pp.654-668, 2009.

P. W. Purdom, D. L. Berre, and L. Simon, A parsimony tree for the sat2002 competition, Ann. Math. Artif. Intell, vol.43, issue.1, pp.343-365, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00018851

R. John-alan, A machine-oriented logic based on the resolution principle, Communications of the ACM, vol.5, pp.23-41, 1965.

, Algorithmic Decision Theory, First International Conference, vol.5783, 2009.

O. Roussel, M. Vasco, and . Manquinho, Pseudo-boolean and cardinality constraints, vol.36, pp.695-733
URL : https://hal.archives-ouvertes.fr/hal-00870005

L. Ryan, Efficient algorithms for clause learning sat solvers, 2004.

S. Safarpour, H. Mangassarian, A. G. Veneris, M. H. Liffiton, and K. A. Sakallah, Improved design debugging using maximum satisfiability, FMCAD, pp.13-19, 2007.

B. Selman, H. A. Kautz, and B. Cohen, Noise strategies for improving local search, AAAI, pp.337-343, 1994.

B. Selman, H. J. Levesque, and D. G. Mitchell, A new method for solving hard satisfiability problems, AAAI, pp.440-446, 1992.

M. Hossein, K. A. Sheini, and . Sakallah, Pueblo : A Hybrid Pseudo-Boolean SAT Solver, JSAT [117, pp.165-182

P. M. João, K. A. Silva, and . Sakallah, GRASP : A Search Algorithm for Propositional Satisfiability, IEEE Trans. Computers, vol.48, issue.5, pp.506-521, 1999.

L. Simon and P. Chatalic, SatEx : A Web-based Framework for SAT Experimentation, Electronic Notes in Discrete Mathematics, vol.9, pp.129-149, 2001.

L. Simon, D. L. Berre, and E. A. Hirsch, The sat2002 competition, Ann. Math. Artif. Intell, vol.43, issue.1, pp.307-342, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00022662

C. Sinz, Sat race, 2006.

N. Niklas-eén and . Sörensson, Translating pseudo-boolean constraints into sat, JSAT [117], pp.1-26

E. Speckenmeyer, C. M. Li, V. Manquinho, A. Tacchella, and . Editors, Boolean Modeling and Computation, Special Volume on the SAT 2007 competitions, vol.4, 2008.

I. Spence, tts : A sat-solver for small, difficult instances, JSAT, vol.4, issue.2-4, pp.173-190, 2008.

I. Spence, sgen1 : A generator of small but difficult satisfiability benchmarks, ACM Journal of Experimental Algorithmics, vol.15, 2010.

O. Strichman and S. Szeider, Theory and Applications of Satisfiability Testing -SAT 2010, 13th International Conference, SAT 2010, vol.6175, 2010.

. Springer, , 2010.

G. Sutcliff and C. Suttner, Evaluating general purpose automated theorem proving systems, Artificial Intelligence, vol.131, pp.39-54, 2001.

T. Syrjänen, A rule-based formal model for software configuration, 1999.

G. Réalisation-d'une-bibliothèque-de-bdd-en-java and . Duquesnoy,

, Mise à jour du site web SAT Live!, Marwan Youssef

, Distribution de prouveurs SAT sur une grille via Proactive

M. Développement-de-la-bibliothèque-sat4j, J. Baron, and . Bourgeois,

, Evolution de la bibliothèque SAT4J, Nizar Sahaji et Laurent Stemmer

, Réalisation d'un plugin Eclipse pour Alloy

, Evolution du projet Alloy4Eclipse

, Utilisation d'Xtext pour le projet Alloy4Eclipse, Mohamed Bouragba et Mohamed Said

, Etude de la compilation de formule propositionnelle

, Etude de faisabilité CNRS, Mécanismes d'Explication pour Eclipse, Genuitec

, Responsable scientifique de l'étude 2006-2007 Partenariats Hubert Curien (ex-PAI) PESSOA no11062SC, MUSICA, INESC-ID, Portugal. Co-porteur du projet avec Ines Lynce

, Action Spécifique STIC CNRS, vol.83

, Comité de programme, éditorial, etc

, First International SAT/SMT Summer School, pp.12-17, 2011.

C. Membre-du, RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, 2007.

, Membre du comité de programme 2010 Pragmatics of SAT (PoS), FLoC Workshop, Edinburgh, 10 juillet 2010. Co-organisateur avec Allen Van Gelder 2002-2010 International Conference on Theory and Applications of Satisfiability Testing (SAT)

, Membre du comité de programme 2010 Logics for Component Configuration (Lococo), FLoC Workshop, 2010.

, Logic and Search (LaSh), 2008.

, FLoC Workshop, 2010.

, FLoC Workshop, 2010.

A. Asm and . Conference, , pp.22-25, 2010.

, Membre du comité de programme 2009 IWOCE2009 -Open Component Ecosystems, ESEC/FSE 2009 Workshop, Amsterdam, Pays Bas, 2009.

, Membre du comité de programme 2007 EPIA Workshop on Search Techniques for Constraint Satisfaction, Portuguese Conference on Artificial Intelligence, 2007.

, European Conference on Artificial Intelligence (ECAI), 2006.

, 6ème Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJ-CIA'03)

, NonMonotonic Reasoning NMR'2002 Workshop, special session Changing and Integrating Information: From Theory to Practice

, Membre du comité de programme, Journal on Satisfiability, 2004.

, Membre du comité éditorial de cette revue électronique depuis sa création

, Autres responsabilités scientifiques

, Expert scientifique, Netherlands Organisation for Scientific Research (NWO), NWO Computer Science Open Competition, Pays-Bas, Mathematics of Information Technology and Complex Systems Network of Centres of Excellence (MITACS-NCE), 2002.

. Co-organisateur, Compétition internationale de prouveurs SAT, 2003.

, Membre du COS (section 27) pour la chaire CNRS

, Membre du COS (section 27)

L. Daniel, P. Berre, and . Rapicault, Dependency management for the eclipse ecosystem, Proceedings of IWOCE2009 -Open Component Ecosystems International Workshop, pp.21-30, 2009.

S. Coste-marquis, D. L. Berre, F. Letombe, and P. Marquis, Complexity results for quantified boolean formulae based on complete propositional languages, Journal on Satisfiability, Boolean Modeling and Computation, vol.1, pp.61-88, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00109570

G. Brewka, S. Benferhat, and D. L. Berre, Qualitative choice logic, Artif. Intell, vol.157, issue.1-2, pp.203-237, 2004.

S. Benferhat, S. Kaci, D. L. Berre, and M. Williams, Weakening conflicting information for iterated revision and knowledge integration, Artif. Intell, vol.153, issue.1-2, pp.339-371, 2004.

. Daniel-le-berre, Exploiting the real power of unit propagation lookahead, Electronic Notes in Discrete Mathematics, vol.9, pp.59-80, 2001.

L. Simon, D. L. Berre, and E. A. Hirsch, The sat2002 competition, Ann. Math. Artif. Intell, vol.43, issue.1, pp.307-342, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00022662

P. Daniel-le-berre and M. Marquis, Aggregating interval orders by propositional optimization, Algorithmic Decision Theory, First International Conference, vol.5783, pp.249-260, 2009.

B. Selman and H. Kautz, Knowledge compilation and theory approximation, Journal of the ACM, vol.43, pp.193-224, 1996.

A. Val, Tractable databases: how to make propositional unit resolution complete through compilation, KR'94, pp.551-561, 1994.

R. Schrag, Compilation for critically constrained knowledge bases, AAAI'96, pp.510-515, 1996.

Y. Boufkhad, E. Grégoire, P. Marquis, B. Mazure, and L. Saïs, Tractable cover compilations, IJCAI'97, pp.122-127, 1997.

S. Coste-marquis and P. Marquis, Knowledge compilation for circumscription and closed world reasoning, Journal of Logic and Computation, vol.11, issue.4, pp.579-607, 2001.

S. Coste-marquis and P. Marquis, On stratified belief base compilation, Annals of Mathematics and Artificial Intelligence, vol.42, issue.4, pp.399-442, 2004.

A. Darwiche and P. Marquis, Compiling propositional weighted bases, Artificial Intelligence, vol.157, issue.1-2, p.85, 2004.

S. Coste-marquis and P. Marquis, Characterizing consistency-based diagnoses, AI & Math'98, 1998.

A. Darwiche, Compiling devices into decomposable negation normal form, IJCAI'99, pp.284-289, 1999.

A. Cimmati, E. Giunchiglia, F. Giunchiglia, and P. Traverso, Planning via model checking: a decision procedure for AR, ECP'97, pp.130-142, 1997.

H. Geffner, Planning graphs and knowledge compilation, KR'04, pp.662-672, 2004.

H. Palacios, B. Bonet, A. Darwiche, and H. Geffner, Pruning conformant plans by counting models on compiled d-DNNF representations, ICAPS'05, pp.141-150, 2005.

A. Darwiche and P. Marquis, A knowledge compilation map, Journal of Artificial Intelligence Research, vol.17, pp.229-264, 2002.

U. Egly, T. Eiter, H. Tompits, and S. Woltran, Solving advanced reasoning tasks using Quantified Boolean Formulas, AAAI'00, pp.417-422, 2000.

H. Fargier, J. Lang, and P. Marquis, Propositional logic and one-stage decision making, KR'00, pp.445-456, 2000.

J. Rintanen, Constructing conditional plans by a theorem-prover, Journal of Artificial Intelligence Research, vol.10, pp.323-352, 1999.

G. Pan, U. Sattler, and M. Y. Vardi, BDD-based decision procedures for K, CADE'02, pp.16-30, 2002.

. Ph, T. Besnard, H. Schaub, S. Tompits, and . Woltran, Inconsistency tolerance, volume 3300 of LNCS State-of-the-Art Survey, chapter Representing paraconsistent reasoning via quantified propositional logic, pp.84-118, 2005.

M. Cadoli, A. Giovanardi, and M. Schaerf, An algorithm to evaluate Quantified Boolean Formulae, AAAI'98, pp.262-267, 1998.

J. Rintanen, Improvements to the Evaluation of Quantified Boolean Formulae, IJCAI'99, pp.1192-1197, 1999.

R. Feldmann, B. Monien, and S. Schamberger, A distributed algorithm to evaluate quantified boolean formulas, AAAI'00, pp.285-290, 2004.

E. Giunchiglia, M. Narizzano, and A. Tacchella, Backjumping for Quantified Boolean Logic satisfiability, IJCAI'01, pp.275-281, 2001.

R. Letz, Lemma and model caching in decision procedures for Quantified Boolean Formulas, Tableaux'02, pp.160-175, 2002.

L. Zhang and S. Malik, Towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation, CP'02, pp.200-215, 2002.

G. Pan and M. Y. Vardi, Symbolic decision procedures for QBF, CP'04, pp.453-467, 2004.

G. Audemard and L. Saïs, SAT based BDD solver for Quantified Boolean Formulas, ICTAI'04, pp.82-89, 2004.

D. L. Berre, L. Simon, and A. Tacchella, Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers, SAT'03, vol.2919, pp.468-485, 2003.

D. L. Berre, M. Narizzano, L. Simon, and A. Tacchella, The second QBF solvers evaluation, SAT'04, vol.3542, pp.376-392, 2004.

M. Narizzano, L. Pulina, and A. Tacchella, The third QBF solvers comparative evaluation, Journal on Satisfiability, Boolean Modeling and Computation, vol.2, pp.145-164, 2006.

.. J. Th and . Schaefer, The complexity of satisfiability problems, STOC'78, pp.216-226, 1978.

N. Creignou, S. Khanna, and M. Sudan, Complexity classification of boolean constraint satisfaction problems, SIAM Monographs on Discrete Mathematics and Applications, vol.7, 2001.

B. Aspvall, M. Plass, and R. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.4, p.195, 1979.

H. Büning, M. Karpinski, and A. Flögel, Resolution for quantified boolean formulas. Information and Computation, vol.117, pp.12-18, 1995.

I. P. Gent and A. G. Rowley, Solving 2-CNF Quantified Boolean Formulae using variable assignment and propagation, QBF workshop at SAT'02, pp.17-25, 2002.

F. Börner, A. Bulatov, A. Krokhin, and P. Jeavons, Quantified constraints: algorithms and complexity, CSL'03, volume 2803 of LNCS, pp.58-70, 2003.

H. Chen, Collapsibility and consistency in quantified constraint satisfaction, AAAI'04, pp.155-160, 2004.

H. Chen, Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms, STACS'05, pp.315-326, 2005.

.. H. Ch and . Papadimitriou, Computational complexity, 1994.

R. E. Bryant, Graph-based algorithms for boolean function manipulation, IEEE Trans. on Computers, C, vol.35, issue.8, pp.677-692, 1986.

U. Egly, M. Seidl, H. Tompits, S. Woltran, and M. Zolda, Comparing different prenexing strategies for Quantified Boolean Formulas, SAT'03, vol.2919, pp.214-228, 2003.

A. Darwiche, Decomposable negation normal form, Journal of the ACM, vol.48, issue.4, pp.608-647, 2001.

J. Gergov and C. Meinel, Efficient analysis and manipulation of OBDDs can be extended to FBDDs, IEEE Trans. on Computers, vol.43, issue.10, pp.1197-1209, 1994.

X. Zhao and H. K. Büning, Model-equivalent reductions, SAT'05, vol.3569, pp.355-370, 2005.

D. Sieling and I. Wegener, Reduction of OBDDs in linear time, Information Processing Letters, vol.48, issue.3, pp.139-144, 1993.

J. Lang, P. Liberatore, and P. Marquis, Propositional independence -formula-variable independence and forgetting, Journal of Artificial Intelligence Research, vol.18, pp.391-443, 2003.

P. Marquis, Consequence finding algorithms, volume 5 of Handbook on Defeasible Reasoning and Uncertainty Management Systems, pp.41-145, 2000.

P. Tison, Generalization of consensus theory and application to the minimization of boolean functions, IEEE Trans. on Electronic Computers, EC, vol.16, pp.446-456, 1967.

S. Coste-marquis, D. L. Berre, and F. Letombe, A branching heuristics for quantified renamable Horn formulas, SAT'05, vol.3569, pp.393-399, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00014611

P. Liberatore, Monotonic reductions, representative equivalence, and compilation of intractable problems, Journal of the ACM, vol.48, issue.6, pp.1091-1125, 2001.

M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf, Preprocessing of intractable problems, Information and Computation, vol.176, issue.2, pp.89-120, 2002.

R. M. Karp and R. J. Lipton, Some connections between non-uniform and uniform complexity classes, STOC'80, pp.302-309, 1980.

H. Büning, K. Subramani, and X. Zhao, On boolean models for quantified boolean Horn formulas, SAT'03, vol.2919, pp.93-104, 2003.

C. Alchourrón, P. Gärdenfors, and D. Makinson, On the logic of theory change: Partial meet functions for contraction and revision, J. Symbolic Logic, vol.50, pp.510-530, 1985.

C. Baral, S. Kraus, J. Minker, and V. S. Subrahmanian, Combining knowledge bases consisting in first order theories, Comput. Intelligence, vol.8, issue.1, pp.45-71, 1992.

S. Benferhat, D. Dubois, C. Cayrol, J. Lang, and H. Prade, Inconsistency management and prioritized syntaxbased entailment, Proceedings of IJCAI-93, pp.640-645, 1993.

S. Benferhat, D. Dubois, and H. Prade, Some syntactic approaches to the handling of inconsistent knowledge bases: A comparative study part 2: The prioritized case, Logic at Work, vol.24, pp.473-511, 1998.

S. Benferhat, S. Kaci, D. L. Berre, and M. Williams, Weakening conflicting information for iterated revision and knowledge integration, Proceedings of IJCAI-01, pp.109-115, 2001.

B. Bessant, E. Grégoire, P. Marquis, and L. Sais, Iterated syntax-based revision in a nonmonotonic setting, Frontiers in Belief Revision, pp.369-391, 2001.

R. Bourne, Default reasoning using maximum entropy and variable strength defaults, 1999.

R. Bourne and S. D. Parsons, Connecting lexicographical and maximum entropy entailment, Proceedings of the fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, (ECSQARU'99), vol.1638, pp.80-91, 1999.

G. Brewka, Preferred subtheories: An extended logical framework for default reasoning, Proceedings of IJCAI-89, pp.1043-1048, 1989.

P. D. Bruza, R. Lau, A. H. Ter-hofstede, and K. F. Wong, Belief revision and possibilistic logic for adaptive information filtering agents, Proceedings ICTAI-2000, pp.19-26, 2000.

L. Cholvy, Reasoning about merging information, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol.3, pp.233-263, 1998.

S. Coste-marquis and P. Marquis, Proceedings of Fourteenth European Conference on Artificial Intelligence (ECAI'00), pp.23-27, 2000.

S. Coste-marquis and P. Marquis, On stratified belief bases compilations, 2002.

A. Darwiche and J. Pearl, On stratified belief bases compilations, Artificial Intelligence, vol.89, pp.1-29, 1997.

D. Dubois, J. Lang, and H. Prade, Possibilistic logic, Handbook of Logic in Artificial Intelligence and Logic Programming, vol.3, pp.439-513, 1994.
URL : https://hal.archives-ouvertes.fr/hal-01123493

T. Eiter and G. Gottlob, On the complexity of propositional knowledge base revision, updates, and counterfactuals, Artificial Intelligence, vol.57, pp.227-270, 1992.

P. Gärdenfors, Knowledge in Flux: Modeling the Dynamics of Epistemic States, 1988.

D. S. Johnson and M. A. Trick, Second DIMACS Implementation Challenge: Cliques, Coloring and Satisfiability, vol.26, 1996.

J. Lang, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol.5, pp.179-200, 2000.

D. Lehmann, Another perspective on default reasoning, Ann. Math. Artificial Intelligence, vol.15, pp.61-82, 1995.

. Nayak, Iterated belief change based on epistemic entrenchment, Erkenntnis, vol.41, pp.353-390, 1994.

B. Nebel, Belief revision and default reasoning: Syntax-based approaches, Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR'91), pp.417-428, 1991.

B. Nebel, How hard is it to revise a belief base, Belief Change, Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol.3, pp.77-145, 1998.

Y. Shoham, Reasoning About Change, 1988.

W. Spohn, Ordinal conditional functions: A dynamic theory of epistemic states, Causation in Decision, Belief Change, and Statistics, vol.2, pp.105-134, 1988.

M. A. Williams, A practical approach to belief revision: reason-based change, Proceedings of Fifth International Conference of Principles of Knowledge Representation and Reasoning (KR'96), pp.412-421, 1996.

M. A. Williams, Transactions and Change in Logic Databases, vol.1472, 1998.

M. A. Williams and A. Sims, Saten: An object-oriented web-based revision and extraction engine, International Workshop on Nonmonotonic Reasoning (NMR'2000), 2000.

M. A. Williams, Transmutations of knowledge systems, Proceedings of Fourth International Conference on principles of Knowledge Representation and reasoning (KR'94), pp.619-629, 1994.

M. A. Williams, Iterated theory base change: A computational model, Proceedings of IJCAI-95, pp.1541-1547, 1995.

O. Wong and R. Lau, Possibilistic reasoning for intelligent payment agents, Proceedings of the Second Workshop on Artificial Intelligence in Electronic Commerce (AIEC'2000, pp.1-13, 2000.

S. Benferhat, C. Cayrol, D. Dubois, J. Lang, and H. Prade, Inconsistency management and prioritized syntaxbased entailment, Proc. IJCAI-93, pp.640-645, 1993.

S. Benferhat, D. Dubois, S. Kaci, and H. Prade, Bridging logical, comparative and graphical possibilistic representation frameworks, Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU'01), pp.422-431, 2001.

G. Brewka, Artificial Intelligence, vol.157, pp.203-237, 2004.

S. Benferhat and S. Kaci, A logical representation and fusion of prioritized information based on guaranteed possibility measures: application to the encoding of distance-based merging for classical bases, Artificial Intelligence, vol.148, issue.1-2, pp.291-333, 2003.

S. Benferhat, D. Dubois, and H. Prade, Some syntactic approaches to the handling of inconsistent knowledge bases: a comparative study. Part II: The prioritized case, Logic at Work, vol.24, pp.473-511, 1998.

S. Benferhat, S. Kaci, D. L. Berre, and M. Williams, Weakening conflicting information for iterated revision and knowledge integration, Proc. IJCAI-01, pp.109-115, 2001.

S. Bistarelli, U. Montanari, and F. Rossi, Semiring-based constraint solving and optimization, J. ACM, vol.44, issue.2, pp.201-236, 1997.

C. Boutilier, Towards a logic for qualitative decision theory, Proc. Principles of Knowledge Representation and Reasoning (KR-94), pp.75-86, 1994.

R. I. Boutilier, C. Brafman, H. H. Hoos, and D. Poole, Reasoning with conditional ceteris paribus preference statements, Proc. UAI-99, pp.71-80, 1999.

G. Brewka, Well-founded semantics for extended logic programs with dynamic preferences, J. Artificial Intelligence Res, vol.4, pp.19-36, 1996.

G. Brewka, Representing meta-knowledge in Poole-systems, Studia Logica, vol.67, pp.153-165, 2001.

G. Brewka, Logic programming with ordered disjunction, Proc. 17th National Conference on Artificial Intelligence (AAAI-02), pp.100-105, 2002.

G. Brewka and T. Eiter, Preferred answer sets for extended logic programs, Artificial Intelligence, vol.109, pp.297-356, 1999.

G. Brewka, I. Niemelä, and T. Syrjänen, Implementing ordered disjunction using answer set solvers for normal programs, Proc. JELIA, pp.444-455, 2002.

S. Coste-marquis and P. Marquis, On stratified belief base compilations, Ann. Math. Artificial Intelligence

J. Delgrande, T. Schaub, and H. Tompits, Logic programs with compiled preferences, Proc. European Conference on Artificial Intelligence, pp.392-398, 2000.

D. Dubois, P. Hajek, and H. Prade, Knowledge-driven versus data-driven logics, J. Logic Language Inform, vol.9, pp.65-89, 2000.

J. Doyle and R. H. Thomason, Background to qualitative decision theory, AI Magazine, vol.20, issue.2, pp.55-68, 1999.

E. C. Freuder and R. J. Wallace, Partial constraint satisfaction, Artificial Intelligence, vol.58, issue.1, pp.21-70, 1992.

H. Fargier, J. Lang, and T. Schiex, Selecting preferred solutions in fuzzy constraint satisfaction problems, Proc. First European Congress on Fuzzy and Intelligent Technologies, 1993.

B. Grosof, Diplomat: compiling prioritized rules into ordinary logic programs for e-commerce applications, Proc. National Conference on Artificial Intelligence (AAAI-99), pp.912-913, 1999.

S. Kraus, D. Lehmann, and M. Magidor, Nonmonotonic reasoning, preferential models and cumulative logics, Artificial Intelligence, vol.44, pp.167-207, 1990.

J. Lang, Conditional desires and utilities-an alternative logical approach to qualitative decision theory, Proc. 12th European Conference on Artificial Intelligence (ECAI-96), pp.318-322, 1996.

J. Lang, L. Van-der-torre, and E. Weydert, Utilitarian desires, Autonomous Agents and Multi-Agent Systems, vol.5, issue.3, pp.329-363, 2002.

D. Lehmann, Another perspective on default reasoning, Ann. Math. Artificial Intelligence, vol.15, issue.1, pp.61-82, 1995.

D. Lehmann and M. Magidor, What does a conditional knowledge base entail?, Artificial Intelligence, vol.55, pp.1-60, 1992.

V. Lifschitz and C. , Handbook of Logic in AI and Logic Programming, vol.3, pp.298-352, 1994.

J. Mccarthy, Circumscription-A form of nonmonotonic reasoning, Artificial Intelligence, vol.13, pp.27-39, 1980.

J. Mccarthy, Applications of circumscription to formalizing common sense knowledge, Artificial Intelligence, vol.28, pp.89-116, 1986.

Y. Moinard, Note about cardinality-based circumscription, Artificial Intelligence, vol.119, issue.1-2, pp.259-273, 2000.

R. C. Moore, Semantical considerations on nonmonotonic logic, Artificial Intelligence, vol.25, pp.75-94, 1985.

D. Poole, The independent choice logic for modelling multiple agents under uncertainty, Artificial Intelligence, vol.94, issue.1-2, pp.7-56, 1997.

R. Reiter, A logic for default reasoning, Artificial Intelligence, vol.13, pp.81-132, 1980.

T. Schaub and K. Wang, A comparative study of logic programs with preference, Proc. IJCAI-01, pp.631-637, 2001.

T. Schiex, H. Fargier, and G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, Proc. IJCAI-95, pp.631-637, 1995.
URL : https://hal.archives-ouvertes.fr/hal-02778456

T. Soininen, I. Niemelä, J. Tiihonen, and R. Sulonen, Representing configuration knowledge with weight constraint rules, Proc. of the AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge, 2001.

R. Thomason, Desires and defaults: a framework for planning with inferred goals, Proc. 7th Conference on Principles of Knowledge Representation and Reasoning (KR-2000), pp.702-713, 2000.

L. Van-der-torre and E. Weydert, Parameters for utilitarian desires in a qualitative decision theory, Appl. Intelligence, vol.14, pp.285-301, 2001.

. Simon, An instance generated by this generator (3-CNF, 500 variables, 1750 clauses, 5250 literals, seed 1 216 665 065) was the smallest satisfiable benchmark that remained unsolved during the competition. Description: First a satisfying assignment is chosen; then clauses (3.5n of them for n variables) are generated one by one

, The corresponding variable already appears in the current clause

, A variable dependent on it (i.e., occurred together in another clause) already appears in the current clause

E. A. Hirsch, The opposite literal is not satisfying and occurs not more frequently (except for the case that choosing a satisfying literal is our last chance to satisfy this clause)

M. Motoki, Benchmarks were discarded because of a bug in the generator. plainoldcnf from Dan Pehoushek. Selection of regular random 5-CNF. twentyvars from Dan Pehoushek. Small instances (in terms of their number of variables) of k-CNF

. Limmat-armin-biere, This is a zchaff-like SAT solver (implemented in C) with an early detection of conflicts in the BCP queue; a constant time lookup of the 'other' watched literal; an optimized ordering of decision OKsolver 1.2 source code is

B. Wah and A. Z. Wu, Incomplete randomized solvers, vol.53

, Complete deterministic solver. Binaries avail

P. A. Abdulla, P. Bjesse, and N. Eén, Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'2000, 2000.

F. Bacchus, Enhancing Davis Putnam with extended binary clause reasoning, Proceedings of National Conference on Artificial Intelligence (AAAI-2002, 2002.

F. Bacchus, Exploring the computational tradeoff of more reasoning and less searching, vol.49, pp.7-16, 2002.

L. Baptista and J. P. Marques-silva, Using randomization and learning to solve hard real-world instances of satisfiability, Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, 2000.

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.

A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, Symbolic model checking using SAT procedures instead of BDDs, 1999.

M. Buro and H. K. Büning, Report on a SAT competition, vol.49, pp.143-151, 1993.

C. Li, B. Jurkowiak, and P. W. Purdom, Integrating symmetry breaking into a DLL procedure, vol.49, pp.149-155, 2002.

A. E. Caldwell, A. B. Kahng, I. L. Markov, C. Toward, and . Reuse, The MARCO GSRC bookshelf of fundamental CAD algorithms, pp.72-81, 2002.

P. Chatalic and L. Simon, Multi-resolution on compressed sets of clauses, Twelth International Conference on Tools with Artificial Intelligence (ICTAI'00, pp.2-10, 2000.

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the Third IEEE Symposium on the Foundations of Computer Science, pp.151-158, 1971.

. Simon, The SAT2002 Competition
URL : https://hal.archives-ouvertes.fr/hal-00022662

F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella et al., Benefits of bounded model checking at an industrial setting, Proc. of CAV, 2001.

E. Dantsin, A. Goerdt, E. A. Hirsch, R. Kannan, J. Kleinberg et al., Deterministic (2 ? 2/(k + 1)) n algorithm for k-SAT based on local search, Theoretical Computer Science, vol.189, issue.1, pp.69-83, 2002.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving, Communications of the ACM, vol.5, issue.7, pp.394-397, 1962.

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

O. Dubois, P. André, Y. Boufkhad, and J. Carlier, SAT versus UNSAT, vol.29, pp.415-436, 1996.

O. Dubois and G. Dequen, A backbone-search heuristic for efficient solving of hard 3-SAT formulae, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI'01), 2001.
URL : https://hal.archives-ouvertes.fr/hal-01570843

M. D. Ernst, T. D. Millstein, and D. S. Weld, Automatic SAT-compilation of planning problems, vol.28, pp.1169-1176, 1997.

F. Aloul, A. Ramani, I. Markov, and K. Sakallah, Solving difficult SAT instances in the presence of symmetry, Design Automation Conference (DAC), pp.731-736, 2002.

J. W. Freeman, Improvements to propositional satisfiability search algorithms, 1995.

E. Goldberg and Y. Novikov, BerkMin: A fast and robust SAT-solver, in: Design, Automation, and Test in Europe (DATE '02, pp.142-149, 2002.

C. P. Gomes, B. Selman, and H. Kautz, Boosting combinatorial search through randomization, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp.431-437, 1998.

E. A. Hirsch, Also reprinted in Highlights of Satisfiability Research in the Year, Frontiers in Artificial Intelligence and Applications, vol.24, issue.2, pp.127-143, 2000.

E. A. Hirsch, Also reprinted in Highlights of Satisfiability Research in the Year, Frontiers in Artificial Intelligence and Applications, vol.24, issue.4, pp.397-420, 2000.

E. A. Hirsch and A. Kojevnikov, UnitWalk: A new SAT solver that uses local search guided by unit clause elimination, Annals of Mathematics and Artificial Intelligence, vol.43, pp.91-111, 2005.

J. N. Hooker, Needed: An empirical science of algorithms, Operations Research, vol.42, issue.2, pp.201-212, 1994.

J. N. Hooker, Testing heuristics: We have it all wrong, Journal of Heuristics, pp.32-42, 1996.

, IJCAI97, Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI'97), 1997.

, Second DIMACS Implementation Challenge: Cliques, Coloring and Satisfiability, vol.26, 1996.

, Proceedings of the Workshop on Theory and Applications of Satisfiability Testing (SAT2001), LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, 2001.

H. A. Kautz and B. Selman, Planning as satisfiability, Proceedings of the 10th European Conference on Artificial Intelligence (ECAI'92, pp.359-363, 1992.

H. A. Kautz and B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, Proceedings of the 12th National Conference on Artificial Intelligence (AAAI'96, pp.1194-1201, 1996.

E. Koutsoupias and C. H. Papadimitriou, On the greedy algorithm for satisfiability, Information Processing Letters, vol.43, issue.1, pp.53-55, 1992.

O. Kullmann, First report on an adaptive density based branching rule for DLL-like SAT solvers, using a database for mixed random conjunctive normal forms created using the Advanced Encryption Standard (AES), 2002.

O. Kullmann, Investigating the behaviour of a SAT solver on random formulas, Annals of Mathematics and Artificial Intelligence, 2002.

O. Kullmann, Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES), 2002.

C. Li, A constrained based approach to narrow search trees for satisfiability, Information Processing Letters, vol.71, pp.75-80, 1999.

C. Li, Integrating equivalency reasoning into Davis-Putnam procedure, Proceedings of the 17th National Conference in Artificial Intelligence (AAAI'00), pp.291-296, 2000.

C. Li and A. , Heuristics based on unit propagation for satisfiability problems, vol.28, pp.366-371, 1997.

I. Lynce and J. P. Silva, Efficient data structures for backtrack search SAT solvers, 2002.

I. Lynce, L. Baptista, and J. P. Silva, Stochastic systematic search algorithms for satisfiability, 2001.

J. P. Marques-silva and K. A. Sakallah, GRASP -A new search algorithm for satisfiability, Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp.220-227, 1996.

M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, Chaff: Engineering an efficient SAT solver, Proceedings of the 38th Design Automation Conference (DAC'01, pp.530-535, 2001.

F. Okushi and A. Van-gelder, Persistent and quasi-persistent lemmas in propositional model elimination, (Electronic) Proc. 6th Int'l Symposium on Artificial Intelligence and Mathematics, vol.40, pp.373-402, 2000.

R. Ostrowski, E. Grégoire, B. Mazure, and L. Sais, Recovering and exploiting structural knowledge from CNF formulas, Proc. of the Eighth International Conference on Principles and Practice of Constraint Programming, 2002.

R. Paturi, P. Pudlák, and F. Zane, Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, FOCS'97, pp.566-574, 1997.

S. Prestwich, A SAT approach to query optimization in mediator systems, vol.49, pp.252-259, 2002.

S. D. Prestwich, Randomised backtracking for linear pseudo-Boolean constraint problems, in: Proceedings of Fourth International Workshop on Integration of AI and OR techniques in Constraint Programming for Combinatorial Optimisation Problems, 2002.

, SAT2002, Fifth International Symposium on the Theory and Applications of Satisfiability Testing, 2002.

R. Schuler, U. Schöning, O. Watanabe, and T. Hofmeister, A probabilistic 3-SAT algorithm further improved, Proceedings of 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002, 2002.

B. Selman, H. A. Kautz, and B. Cohen, Noise strategies for improving local search, Proceedings of the 12th National Conference on Artificial Intelligence (AAAI'94), pp.337-343, 1994.

B. Selman, H. Levesque, and D. Mitchell, A new method for solving hard satisfiability problems, Proceedings of the 10th National Conference on Artificial Intelligence (AAAI'92, pp.440-446, 1992.

Y. Shang and B. W. Wah, A discrete Lagrangian-based global-search method for solving satisfiability problems, Journal of Global Optimization, vol.12, issue.1, pp.61-99, 1998.

L. Simon and P. Chatalic, SATEx: a Web-based framework for SAT experimentation, in: [30, 2001.

. Simon, The SAT2002 Competition
URL : https://hal.archives-ouvertes.fr/hal-00022662

G. Sutcliff and C. Suttner, Evaluating general purpose automated theorem proving systems, Artificial Intelligence, vol.131, pp.39-54, 2001.

G. S. Tseitin, On the complexity of derivation in the propositional calculus, Structures in Constructive Mathematics and Mathematical Logic, Part II, pp.115-125, 1970.

A. Urquhart, Hard examples for resolution, Journal of the Association for Computing Machinery, vol.34, issue.1, pp.209-219, 1987.

A. Van-gelder, Autarky pruning in propositional model elimination reduces failure redundancy, Journal of Automated Reasoning, vol.23, issue.2, pp.137-193, 1999.

A. Van-gelder, Extracting (easily) checkable proofs from a satisfiability solver that employs both preorder and postorder resolution, Seventh Int'l Symposium on AI and Mathematics, 2002.

A. Van-gelder, Generalizations of watched literals for backtracking search, Seventh Int'l Symposium on AI and Mathematics, 2002.

A. Van-gelder and F. Okushi, Lemma and Cut strategies for propositional model elimination, Annals of Mathematics and Artificial Intelligence, vol.26, issue.1-4, pp.113-132, 1999.

A. Van-gelder and Y. K. Tsuji, Satisfiability testing with more reasoning and less guessing, vol.29, pp.559-586, 1996.

M. Velev and R. Bryant, Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors, Proceedings of the 38th Design Automation Conference (DAC '01, pp.226-231, 2001.

J. Warners and H. Van-maaren, Solving satisfiability problems using elliptic approximations: Effective branching rules, Discrete Applied Mathematics, vol.107, pp.241-259, 2000.

H. Zhang, SATO: An efficient propositional prover, Proceedings of the International Conference on Automated Deduction (CADE'97), vol.1249, pp.272-275, 1997.

H. 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.

L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik, Efficient conflict driven learning in a Boolean satisfiability solver, International Conference on Computer-Aided Design (ICCAD'01, pp.279-285, 2001.

L. Zheng and P. J. Stuckey, not our approach satisfies some of them. We begin by the properties at work in Arrow's theorem: References 1, Proceedings of the Twenty-Fifth Australasian Computer Science Conference (ACSC2002), vol.4, pp.251-278, 2002.

K. J. Arrow, Social choice and individual values, 1951.

C. Marquis-de, Essai sur l'application de l'analyseà la probabilité des décisions renduesà la pluralité des voix, Imprimerie Royale, p.1785

O. Coudert, On solving covering problems, Design Automation Conference, pp.197-202, 1996.

P. C. Fishburn, Interval Orders and Interval Graphs, 1985.

A. Gibbard, Social choice and the arrow conditions. unpublished, 1969.

O. Hudry, Np-hardness results for the aggregation of linear orders into median orders, Annals of Operations Research, vol.163, pp.63-88, 2008.

J. G. Kemeny, Mathematics without numbers, Daedalus, vol.88, pp.575-591, 1959.

L. Daniel, A. Berre, and . Parrain, , vol.4

R. D. Luce, Semi-orders and a theory of utility discrimination, Econometrica, p.24, 1956.

V. Manquinho and O. Roussel, The first evaluation of pseudo-boolean solvers (pb'05), Journal on Satisfiability, Boolean Modeling and Computation (JSAT), vol.2, pp.103-143, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00110082

C. H. Papadimitriou and I. Steiglitz, Combinatorial Optimization: algorithms and complexity, 1982.

M. Pirlot and P. , Vincke. Semi Orders. Kluwer Academic, 1997.

A. K. Sen, Collective Choice and Social Welfare, 1970.

R. Stanley, Hyperplanes arrangements, interval orders and trees, Proc. Nat. Acad. Sci, vol.93, pp.2620-2625, 1996.

N. Wiener, A contribution to the theory of relative position, Proc. of Cambridge Philosophical Society, vol.17, pp.441-449, 1914.