F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallak, Symmetry breaking for pseudo-boolean satisfiabilty, ASPDAC'04, pp.884-887, 2004.

R. Backofen and S. Will, Excluding Symmetries in Constraint-Based Search, Principle and Practice of Constraint Programming -CP'99, 1999.
DOI : 10.1007/978-3-540-48085-3_6

B. Benhamou, Study of symmetry in constraint satisfaction problems, Proceedings of the 2nd International workshop on Principles and Practice of Constraint Programming -PPCP'94, 1994.

B. Benhamou and L. Sais, Theoretical study of symmetries in propositional calculus and applications, Eleventh International Conference on Automated Deduction, 1992.
DOI : 10.1007/3-540-55602-8_172

B. Benhamou and L. Sais, Tractability through symmetries in propositional calculus, Journal of Automated Reasoning, vol.8, issue.1, pp.89-102, 1994.
DOI : 10.1007/BF00881844
URL : https://hal.archives-ouvertes.fr/hal-01479609

B. Benhamou, L. Sais, and P. Siegel, Two proof procedures for a cardinality based language, proceedings of STACS'94, pp.71-82, 1994.

P. Besnard and P. Siegel, The preferential-models approach in nonmonotonic logics -in non-standard logic for automated reasoning, pp.137-156, 1988.

G. Bossu and P. Siegel, Nonmonotonic Reasoning and Databases, Advances in Data Base Theory, pp.239-284, 1982.
DOI : 10.1007/978-1-4615-9385-0_9

G. Bossu and P. Siegel, Saturation, nonmonotonic reasoning and the closed-world assumption, Artificial Intelligence, vol.25, issue.1, pp.13-63, 1985.
DOI : 10.1016/0004-3702(85)90040-2

J. Crawford, M. L. Ginsberg, E. Luck, and A. Roy, Symmetry-breaking predicates for search problems, KR'96 : Principles of Knowledge Representation and Reasoning, pp.148-159

T. Fahle, S. Schamberger, and M. Sellmann, Symmetry Breaking, International conference on constraint programming, pp.93-108, 2001.
DOI : 10.1007/3-540-45578-7_7

F. Focacci and M. Milano, Global Cut Framework for Removing Symmetries, International conference on constraint programming, pp.77-82, 2001.
DOI : 10.1007/3-540-45578-7_6

E. C. Freuder, Eliminating interchangeable values in constraints satisfaction problems, Proc AAAI-91, pp.227-233, 1991.

I. P. Gent, W. Hervey, T. Kesley, and S. Linton, Generic SBDD Using Computational Group Theory, Proceedings CP'2003, 2003.
DOI : 10.1007/978-3-540-45193-8_23

I. P. Gent and B. M. Smith, Symmetry breaking during search in constraint programming, Proceedings ECAI'2000, 2000.

I. P. Gent, W. Harvey, and T. Kelsey, Groups and Constraints: Symmetry Breaking during Search, International conference on constraint programming, pp.415-430, 2002.
DOI : 10.1007/3-540-46135-3_28

S. Kraus, D. J. Lehmann, and M. Magidor, Nonmonotonic reasoning, preferential models and cumulative logics, Artificial Intelligence, vol.44, issue.1-2, pp.167-207, 1990.
DOI : 10.1016/0004-3702(90)90101-5

B. Krishnamurty, Short proofs for tricky formulas Circumscription-a form of nonmonotonic reasoning, Acta informatica Artificial Intelligence, vol.13, issue.22, pp.253-275, 1985.

J. F. Puget, On the satisfiability of symmetrical constrained satisfaction problems, Proceedings of IS- MIS'93, LNAI 689, 1993.
DOI : 10.1007/3-540-56804-2_33

J. F. Puget, Symmetry breaking revisited, International conference on constraint programming, pp.446-461, 2002.

R. Reiter, A logic for default reasoning, Artificial Intelligence, vol.13, issue.1-2, pp.81-132, 1980.
DOI : 10.1016/0004-3702(80)90014-4

C. M. Roney-dougal, I. P. Gent, T. Kelsey, and S. A. Linton, Tractable symmetry breaking using restricted search trees, proceedings of ECAI'04, pp.211-215, 2004.

Y. Shoam, A semantical approach to nonmonotonic logic, IJCAI, pp.388-392, 1987.

P. Siegel, L. Forget, and V. Risch, Preferential logics are x-logics, Journal of Logic and Computation, vol.11, issue.1, pp.71-83, 2001.
URL : https://hal.archives-ouvertes.fr/hal-01479598

T. Walsh, General symmetry breaking constraints. In, proceedings of CP'06, pp.650-664, 2006.