Predicting and detecting symmetries in FOL finite model search

Journal of Automated Reasoning

Volumn 36, Issue 3, 2006, Pages 177-212

  Audemard, Gilles ^a   Benhamou, Belaïd ^b   Henocque, Laurent ^c  

^a UNIVERSITÉ D'ARTOIS   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

^c AIX MARSEILLE UNIV   (France)

Author keywords

Constraint programming; Finite models; Symmetry

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FUNCTION EVALUATION; HEURISTIC METHODS; MATHEMATICAL MODELS;

CONSTRAINT PROGRAMMING; EQUATIONAL THEORIES; FINITE MODELS; LEAST NUMBER HEURISTIC;

FORMAL LOGIC;

EID: 33845673774     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-006-9040-3     Document Type: Article

References (33)

1. Alloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult instances of boolean satisfiability in the presence of symmetry. IEEE Trans. Comput.-Aided Des. Integr. Circ. and Systems 22(9):1117-1137 (2003)
2. Andrews, G.: The Theory of Partitions. Cambridge Mathematical Library, Cambridge University Press (1998)
3. Audemard, G., Benhamou, B.: Reasoning by symmetry and function ordering in finite model generation. In: Voronkov, A. (ed.), Proceedings of the 18th International Conference on Automated Deduction (CADE-18), Vol. 2392 of LNCS, pp. 226-240. Springer, Berlin Heidelberg New York (2002)
4. Audemard, G., Henocque, L.: The extended least number heuristic. In: Goré, T.N.R., Leitsch, A. (eds.), Proceedings of the First International Join Conference in Automated Reasoning (IJCAR), Vol. 2083 of LNCS, pp. 427-442. Springer, Berlin Heidelberg New York (2001)
5. Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: Proceedings of PPCP (1994)
6. Benhamou, B., Henocque, L.: A hybrid method for finite model search in equational theories. Fundam. Inform. 39(1-2), 21-38 (1999)
7. Benhamou, B., Sais, L.: Theoretical study of symmetry in propositionnal calculus and applications. In: Proceedings of the 11th International Conference on Automated Deduction, CADE-11, pp. 281-294. Springer, Berlin Heidelberg New York (1992)
8. Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. J. Autom. Reasoning 12(1), 89-102 (1994)
9. Boy dela Tour, T.: Up-to-isomorphism enumeration of finite models - the monadic case. In: Bonacina, M.P., Furbach, U. (eds.), FTP97 International Workshop First-Order Theorem Proving. Schloss Hagenberg by Linz (Austria), pp. 29-33. RISC-Linz Report Series No. 97-50 (1997)
10. Boy dela Tour, T.: Some techniques of isomorph-free search. In: Revised Papers from the International Conference on Artificial Intelligence and Symbolic Computation, pp. 240-252. Springer, Berlin Heidelberg New York (2001)
11. Comtet, L.: Analyse combinatoire, Vol. 1, Chapt. 2. Presses Universitaires de France (1970)
12. Crawford, J.: A theoretical analysis of reasoning by symmetry in first order logic. In: Proceedings of Workshop on Tractable Reasonning, AAI92, pp. 17-22 (1992)
13. Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: KR'96: Principles of Knowledge Representation and Reasoning, pp. 148-159. Morgan Kaufmann, San Francisco, California (1996)
14. Dubois, O., Dequen, G., The non-existence of (3, 1, 2)-conjugate orthogonal idempotent latin square of order 10. In: 7th International Conference on Principles and Practice of Constraint Programming, Vol. 2239 of LNCS, pp. 108-121. Springer, Berlin Heidelberg New York (2001)
15. Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: International Conference on Constraint Programming, Vol. 2239 of LNCS, pp. 93-108. Springer, Berlin Heidelberg New York (2001)
16. Fermüller, C.G., Leitsch, A.: Decision procedures and model building in equational clause logic. Logic J. IGPL 6(1), 17-41 (1998)
17. Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: International Conference on Constraint Programming, Vol. 2239 of LNCS, pp. 77-82. Springer, Berlin Heidelberg New York (2001)
18. Fujita, M., Slaney, J., Bennett, F.: Automatic generation of some results in finite algebra. In: Proceedings of the International Join Conference on Artificial Intelligence, pp. 52-57. Morgan Kaufmann (1993)
19. Gent, I., Harvey, W., Kelsey, T.: Groups and constraints: Symmetry breaking during search. In: International Conference on Constraint Programming, Vol. 2470 of LNCS, pp. 415-430. Springer, Berlin Heidelberg New York (2002)
20. McCune, W.: A Davis-Putnam Program and Its Application to Finite First-Order Model Search: Quasigroup Existence Problems. Technical Memorandum ANL/MCS-TM-194, Argonne National Laboratory, Argonne, Illinois (1994)
21. McKay, B.D.: Nauty User's Guide (version 1.5). Technical Report TR-CS90 -02, Computer Science Department, Australian National University (1990)
22. Meseguer, P., Torras, C.: Solving strategies for highly symmetric CSPs. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 400-405. Morgan Kaufmann (1999)
23. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci. 7, 95-132 (1974)
24. Peltier, N.: A new method for automated finite model building exploiting failures and symmetries. J. Logic Comput. 8(4), 511-543 (1998)
25. Puget, J.: Symmetry breaking revisited. In: International Conference on Constraint Programming, Vol. 2470 of LNCS, pp. 446-461. Springer, Berlin Heidelberg New York (2001)
26. Puget, J.-F.: Automatic detection of variable and value symmetries. In: Proceedings of CP 2005, pp. 475-489 (2005)
27. Slanley, J.: FINDER: Finite Domain Enumerator. Version 3 Notes and Guides. Technical Report, Austrian National University (1993)
28. Suttner, C.B., Sutcliffe, G.: The TPTP Problem Library - v2.1.0. Technical Report JCU-CS-97/8, Department of Computer Science, James Cook University (1997)
29. Tammet, T.: Resolution Methods for Decision Problems and Finite-Model Building. Ph.D. thesis, Göteborg University (1992)
30. Zhang, J.: Problems on the generation of finite models. In: Bundy, A. (ed.), 12th International Conference on Automated Deduction, Nancy, France, pp. 753-757. Springer, Berlin Heidelberg New York (1994)
31. Zhang, J.: Constructing finite algebras with FALCON. J. Autom. Reasoning 17(1), 1-22 (1996)
32. Zhang, J.: Test problem and perl script for finite model searching. Association of Automated Reasoning, Newsletter 47 (2000)
33. Zhang, J., Zhang, H.: SEM: A system for enumerating models. In: Mellish, C.S. (ed.), Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 298-303 (1995)