Skip to main content
SpringerLink
Log in

ASP Solving for Expanding Universes

  • 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

Over the last years, Answer Set Programming has significantly extended its range of applicability, and moved beyond solving static problems to dynamic ones, even in online environments. However, its nonmonotonic nature as well as its upstream instantiation process impede a seamless integration of new objects into its reasoning process, which is crucial in dynamic domains such as logistics or robotics. We address this problem and introduce a simple approach to successively incorporating new information into ASP systems. Our approach rests upon a translation of logic programs and thus refrains from any dedicated algorithms. We prove its modularity as regards the addition of new information and show its soundness and completeness. We apply our methodology to two domains of the Fifth ASP Competition and evaluate traditional one-shot and incremental multi-shot solving approaches.

This work was funded by DFG (SCHA 550/9), the Finnish Centre of Excellence in Computational Inference Research (COIN) supported by the Academy of Finland (AoF) under grant 251170, as well as DAAD and AoF under joint project 57071677/279121. A draft version with proofs 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

Notes

  1. 1.

    Letting \(\max \emptyset \!=\!0\), since \(\mathcal {C}_0\!=\!\emptyset \), we get \(\varSigma (\emptyset ,\mathcal {C}_0,0)\!=\!\varSigma (\emptyset ,\emptyset )\!=\!\{\emptyset \}\), and \({ atom}(\mathcal {P},\emptyset ,0)=\{p \mid p/0\in \mathcal {P}\}\) consists of atomic propositions.

  2. 2.

    The condition \(Y\ne Z\) filters admissible ground substitutions.

  3. 3.

    http://svn.code.sf.net/p/potassco/code/trunk/gringo/examples/.

References

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

    Book  MATH  Google Scholar 

  2. Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7, 201–215 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  3. Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model finding. In: Proceedings of the Workshop on Model Computation (MODEL 2003) (2003)

    Google Scholar 

  4. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electron. Notes Theoret. Comput. Sci. 89(4), 543–560 (2003)

    Article  Google Scholar 

  5. Rintanen, J., Heljanko, K., Niemelä, I.: Planning as satisfiability: parallel plans and algorithms for plan search. Artif. Intell. 170(12–13), 1031–1080 (2006)

    Article  MATH  Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Clingo = ASP + control: Preliminary report [25]. http://arxiv.org/abs/1405.3694v1

  7. Apt, K., Blair, H., Walker, A.: Towards a theory of declarative knowledge. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, San Mateo (1987)

    Google Scholar 

  8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of ICLP 1988, pp. 1070–1080. MIT Press (1988)

    Google Scholar 

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

    Google Scholar 

  10. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum, New York (1978)

    Chapter  Google Scholar 

  11. Lee, J.: A model-theoretic counterpart of loop formulas. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 503–508 (2005)

    Google Scholar 

  12. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1–2), 115–137 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville (1988)

    Google Scholar 

  14. Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, pp. 131–153. IOS (2009)

    Google Scholar 

  15. Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the European Conference on Artificial Intelligence (ECAI 2006), pp. 412–416. IOS (2006)

    Google Scholar 

  16. Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. 35, 813–857 (2009)

    MATH  MathSciNet  Google Scholar 

  17. Calimeri, F., Gebser, M., Maratea, M., Ricca, F.: The design of the fifth answer set programming competition [25]. http://arxiv.org/abs/1405.3710v4

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

  19. Gebser, M., Sabuncu, O., Schaub, T.: An incremental answer set programming based system for finite model computation. AI Commun. 24(2), 195–212 (2011)

    MATH  MathSciNet  Google Scholar 

  20. Eiter, T., Fink, M., Krennwallner, T., Redl, C.: Grounding HEX-programs with expanding domains. In: Proceedings of GTTV 2013, pp. 3–15 (2013)

    Google Scholar 

  21. Lefèvre, C., Nicolas, P.: The first version of a new ASP solver: ASPeRiX. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 522–527. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  22. Dal Palù, A., Dovier, A., Pontelli, E., Rossi, G.: Answer set programming with constraints using lazy grounding. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 115–129. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  23. Dao-Tran, M., Eiter, T., Fink, M., Weidinger, G., Weinzierl, A.: OMiGA: an open minded grounding on-the-fly answer set solver. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 480–483. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  24. De Cat, B., Denecker, M., Stuckey, P.: Lazy model expansion by incremental grounding. In: Technical Communications of ICLP 2012, pp. 201–211. LIPIcs (2012)

    Google Scholar 

  25. Leuschel, M., Schrijvers, T. (eds.): Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP 2014). Theory and Practice of Logic Programming, Online Supplement (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aalto University, HIIT, Espoo, Finland

    Martin Gebser & Tomi Janhunen

  2. INRIA Rennes, Rennes, France

    Torsten Schaub

  3. University of Potsdam, Potsdam, Germany

    Martin Gebser, Holger Jost, Roland Kaminski & Torsten Schaub

Authors
  1. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomi Janhunen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Holger Jost
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roland Kaminski
    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

Gebser, M., Janhunen, T., Jost, H., Kaminski, R., Schaub, T. (2015). ASP Solving for Expanding Universes. 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_30

Download citation

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

  • 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