Skip to main content
SpringerLink
Log in

Dynamic and Static Symmetry Breaking in Answer Set Programming

  • Conference paper
Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8312))

  • 1127 Accesses

Abstract

Many research works had been done in order to define a semantics for logic programs. The well know is the stable model semantics which selects for each program one of its canonical models. The stable models of a logic program are in a certain sens the minimal Herbrand models of its reduct programs. On the other hand, the notion of symmetry elimination had been widely studied in constraint programming and shown to be useful to increase the efficiency of the associated solvers. However symmetry in non monotonic reasoning still not well studied in general. For instance Answer Set Programming (ASP) is a very known framework but only few recent works on symmetry breaking are known in this domain. Ignoring symmetry breaking in the answer set systems could make them doing redundant work and lose on their efficiency. Here we study the notion of local and global symmetry in the framework of answer set programming. We show how local symmetries of a logic program can be detected dynamically by means of the automorphisms of its graph representation. We also give some properties that allow to eliminate theses symmetries in SAT-based answer set solvers and show how to integrate this symmetry elimination in these methods in order to enhance their efficiency.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Solving difficult sat instances in the presence of symmetry. In: DAC, pp. 1117–1137 (2003)

    Google Scholar 

  2. Aloul, F.A., Ramani, A., Markov, I.L., Sakallak, K.A.: Symmetry breaking for pseudo-boolean satisfiability. In: ASPDAC 2004, pp. 884–887 (2004)

    Google Scholar 

  3. Aloul, F.A., Ramani, A., Markov, I.L., Sakallah, K.A.: Solving difficult SAT instances in the presence of symmetry. In: The Proceedings of the 39th Design Automation Conference (DAC 2002), pp. 731–736. ACM Press (2002)

    Google Scholar 

  4. Benhamou, B.: Study of symmetry in constraint satisfaction problems. In: Borning, A. (ed.) PPCP 1994. LNCS, vol. 874, pp. 246–254. Springer, Heidelberg (1994)

    Google Scholar 

  5. Benhamou, B., Sais, L.: Theoretical study of symmetries in propositional calculus and application. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 281–294. Springer, Heidelberg (1992)

    Google Scholar 

  6. Benhamou, B., Sais, L.: Tractability through symmetries in propositional calculus. The Journal of Automated Reasoning 12, 89–102 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Benhamou, B., Nabhani, T., Ostrowski, R., Saïdi, M.R.: Dynamic symmetry detection and elimination in the satisfiability problem. In: Proceedings of the 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16, Dakar, Senegal, April 25-May 1 (2010)

    Google Scholar 

  8. Benhamou, B., Nabhani, T., Siegel, P.: Reasoning by symmetry in non-monotonic inference. In: The Proceedings of the International Conference on Machine and Web Intelligence (ICMWI 2010), Algiers, Algeria, pp. 264–269 (October 3, 2010)

    Google Scholar 

  9. Benhamou, B., Nabhani, T., Siegel, P.: Reasoning by symmetry in non-monotonic logics. In: 13th International Workshop on Non-Monotonic Reasoning (NMR 2010) (May 14, 2010)

    Google Scholar 

  10. Benhamou, B., Saïdi, M.R.: Local symmetry breaking during search in cSPs. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 195–209. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Benhamou, B., Siegel, P.: Symmetry and non-monotonic inference. In: The Proceedings of Symcon 2008, Sydney, Australia (September 2008)

    Google Scholar 

  12. Besnard, P., Siegel, P.: The preferential-models approach in nonmonotonic logics - in non-standard logic for automated reasoning. In: Smets, P. (ed.) Academic Press, pp. 137–156 (1988)

    Google Scholar 

  13. Bossu, G., Siegel, P.: Nonmonotonic reasoning and databases. In: Advances in Database Theory, pp. 239–284 (1982)

    Google Scholar 

  14. Bossu, G., Siegel, P.: Saturation, nonmonotonic reasoning and the closed-world assumption. Artif. Intell. 25(1), 13–63 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  15. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and data bases, pp. 293–322 (1978)

    Google Scholar 

  16. Crawford, J., Ginsberg, M.L., Luck, E., Roy, A.: Symmetry-breaking predicates for search problems. In: KR 1996, pp. 148–159 (1996)

    Google Scholar 

  17. Davis, M., Logemann, G.W., Loveland, D.W.: A machine program for theorem proving. Journal of Communications of The ACM - CACM 5(7), 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  18. Drescher, C., Tifrea, O., Walsh, T.: Symmetry-breaking answer set solving. AI Commun. 24(2), 177–194 (2011)

    MathSciNet  MATH  Google Scholar 

  19. Drescher, C., Tifrea, O., Walsh, T.: Symmetry-breaking in answer set solving. In: ICLP 2010 Workshop ASPOCP 2010 (2010)

    Google Scholar 

  20. Erdem, E., Lifschitz, V.: Tight logic programs. Thoery and Practice of Logic Programming 3, 499–518 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic Programming in Computer Sciences 1, 51–60 (1994)

    Google Scholar 

  22. Freuder, E.: Eliminating interchangeable values in constraints satisfaction problems. In: AAAI 1991, pp. 227–233 (1991)

    Google Scholar 

  23. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Advanced pre-processing for answer set solving. In: Proceedings of the 18th European Conference on Artificial Intelligence, pp. 15–19. IOS Press, Amsterdam (2008)

    Google Scholar 

  24. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: A conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260–265. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  25. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kawalski, R., Bowen, K. (eds.) Logic Programming: Fifth Int’l Conf. and Symp., pp. 1070–1080 (1988)

    Google Scholar 

  26. Giunchiglia, E., Lierler, Y., Maratea, M.: Sat-based answer set programming. In: 19th National Conference on Artificial Intelligence, July 25-29. AAAI, San Jose (2004)

    Google Scholar 

  27. Haselbck, A.: Exploiting interchangeabilities in constraint satisfaction problems. IJCAI 93, 282–289 (1993)

    Google Scholar 

  28. Kraus, S., Lehmann, D.J., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1-2), 167–207 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  29. Krishnamurty, B.: Short proofs for tricky formulas. Acta Inf. (22), 253–275 (1985)

    Google Scholar 

  30. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  31. Lin, F., Zhao, Y.: Assat: Computing answer sets of a logic program by sat solver. In: Proceedings of AAAI 2002 (2002)

    Google Scholar 

  32. McKay, B.: Practical graph isomorphism. Congr. Numer. 30, 45–87 (1981)

    MathSciNet  Google Scholar 

  33. Mears, C., de la Banda, M.G., Wallace, M.: On implementing symmetry detection. In: Proceedings of SymCon 2006, pp. 1–8 (2006)

    Google Scholar 

  34. Montanari, U.: Networks of constraints: Fundamental properties and applications to picture processing. Information Science 7, 95–132 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  35. Puget, J.-F.: Automatic detection of variable and value symmetries. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 475–489. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  36. Puget, J.F.: On the satisfiability of symmetrical constrained satisfaction problems. In: Komorowski, J., Raś, Z.W. (eds.) ISMIS 1993. LNCS (LNAI), vol. 689, Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  37. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13, 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  38. Siegel, P., Forget, L., Risch, V.: Preferential logics are x-logics. Journal of Logic and Computation 11(1), 71–83 (2001)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire des Sciences de l’Information et des Systèmes (LSIS), Domaine universitaire de Saint Jérôme, Aix-Marseille Université, Avenue Escadrille Normandie Niemen, 13397, Marseille Cedex 20, France

    Belaïd Benhamou

  2. Centre de Recherche en Informatique de Lens (CRIL), Université d’Artois, Rue Jean Souvraz, SP 18, F 62307, Lens Cedex, France

    Belaïd Benhamou

Authors
  1. Belaïd Benhamou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, Redmond, WA, USA

    Ken McMillan

  2. University of Innsbruck, Austria

    Aart Middeldorp

  3. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benhamou, B. (2013). Dynamic and Static Symmetry Breaking in Answer Set Programming. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2013. Lecture Notes in Computer Science, vol 8312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45221-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-45221-5_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-45220-8

  • Online ISBN: 978-3-642-45221-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation