Skip to main content
SpringerLink
Log in

Answer Set Programming Modulo Acyclicity

  • Conference paper
  • First Online:
Logic Programming and Nonmonotonic Reasoning (LPNMR 2015)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9345))

Abstract

Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. The implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation.

This work was funded by AoF (251170), DFG (SCHA 550/8 and 550/9), as well as DAAD and AoF (57071677/279121). An extended draft with additional elaborations and experiments is available at http://www.cs.uni-potsdam.de/wv/publications/.

T. Schaub—Affiliated with Simon Fraser University, Canada, and IIIS Griffith University, Australia.

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 EPUB and 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

References

  1. Cussens, J.: Bayesian network learning with cutting planes. In: Proceeding UAI 2011, pp. 153–160. AUAI Press (2011)

    Google Scholar 

  2. Corander, J., Janhunen, T., Rintanen, J., Nyman, H., Pensar, J.: Learning chordal Markov networks by constraint satisfaction. In: Proceeding NIPS 2013, NIPS Foundation, pp. 1349–1357 (2013)

    Google Scholar 

  3. Erdem, E., Lifschitz, V., Wong, M.D.F.: Wire routing and satisfiability planning. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 822–836. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  4. Barrett, C., Sebastiani, R., Seshia, S., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Satisfiability, pp. 825–885. IOS Press (2009)

    Google Scholar 

  5. Gebser, M., Janhunen, T., Rintanen, J.: SAT modulo graphs: Acyclicity. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 137–151. Springer, Heidelberg (2014)

    Google Scholar 

  6. Bayless, S., Bayless, N., Hoos, H., Hu, A.: SAT modulo monotonic theories. In: Proceeding AAAI 2015, pp. 3702–3709. AAAI Press (2015)

    Google Scholar 

  7. Gebser, M., Janhunen, T., Rintanen, J.: Answer set programming as SAT modulo Acyclicity. In: Proceeding ECAI 2014, pp. 351–356. IOS Press (2014)

    Google Scholar 

  8. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  9. Gebser, M., Kaufmann, B., Schaub, T.: Conflict-driven answer set solving: from theory to practice. Artif. Intell. 187–188, 52–89 (2012)

    Article  MathSciNet  Google Scholar 

  10. Van Gelder, A., Ross, K., Schlipf, J.: The well-founded semantics for general logic programs. J. ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  11. Gebser, M., Janhunen, T., Rintanen, J.: ASP encodings of Acyclicity properties. In: Proceeding KR 2014. AAAI Press (2014)

    Google Scholar 

  12. Fages, F.: Consistency of Clark’s completion and the existence of stable models. J. Methods Logic Comput. Sci. 1, 51–60 (1994)

    Google Scholar 

  13. Erdem, E., Lifschitz, V.: Tight logic programs. Theor. Pract. Logic Program. 3(4–5), 499–518 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235–249. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Liu, G., Janhunen, T., Niemelä, I.: Answer set programming via mixed integer programming. In: Proceeding KR 2012, pp. 32–42. AAAI Press (2012)

    Google Scholar 

  16. Lee, J., Meng, Y.: Answer set programming modulo theories and reasoning about continuous changes. In: Proceeding IJCAI 2013, pp. 990–996. IJCAI/AAAI Press (2013)

    Google Scholar 

  17. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell. 138(1–2), 181–234 (2002)

    Article  MATH  Google Scholar 

  18. Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected Boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 71–86. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalto University, HIIT, Espoo, Finland

    Jori Bomanson, Martin Gebser & Tomi Janhunen

  2. University of Potsdam, Potsdam, Germany

    Martin Gebser, Benjamin Kaufmann & Torsten Schaub

  3. INRIA Rennes, Rennes, France

    Torsten Schaub

Authors
  1. Jori Bomanson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tomi Janhunen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Benjamin Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Torsten Schaub .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Bomanson, J., Gebser, M., Janhunen, T., Kaufmann, B., Schaub, T. (2015). Answer Set Programming Modulo Acyclicity. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation