Skip to main content
SpringerLink
Log in

Towards an Integration of Answer Set and Constraint Solving

  • Conference paper
Logic Programming (ICLP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3668))

Included in the following conference series:

Abstract

Answer set programming (ASP for short) is a declarative problem solving framework that has been recently attracting the attention of researchers for its expressiveness and for its well-engineered and optimized implementations. Still, state-of-the-art answer set solvers have huge memory requirements, because the ground instantiation of the input program must be computed before the actual reasoning starts. This prevents ASP to be effective on several classes of problems. In this paper we integrate answer set generation and constraint solving to reduce the memory requirements for a class of multi-sorted logic programs with cardinality constraints. We prove some theoretical results, introduce a provably sound and complete algorithm, and report experimental results showing that our approach can solve problem instances with significantly larger domains.

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. Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-Advisor: A case study in answer set planning. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 439–442. Springer, Heidelberg (2001)

    Google Scholar 

  2. Baselice, S.: Integrazione di tecniche di Answer Set Programming e Constraint Solving. In: Tesi di laurea, Università degli studi di Napoli Federico II, Naples, Italy (October 2004)

    Google Scholar 

  3. Cadoli, M., Donini, F.M., Schaerf, M.: Is intractability of nonmonotonic reasoning a real drawback? Artificial Intelligence 88(1-2), 215–251 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Aiello, L.C., Massacci, F.: Verifying security protocols as planning in logic programming. ACM Trans. Comput. Logic 2(4), 542–580 (2001)

    Article  Google Scholar 

  5. Cholewiński, P., Marek, V., Mikitiuk, A., Truszczyński, M.: Experimenting with nonmonotonic reasoning. In: Proceedings of the 12th International Conference on Logic Programming, ICLP 1995, pp. 267–281. MIT Press, Cambridge (1995)

    Google Scholar 

  6. Codognet, P., Diaz, D.: Compiling constraints in clp(FD). Journal of Logic Programming 27(3), 185–226 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for non-monotonic reasoning. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 364–375. Springer, Heidelberg (1997)

    Google Scholar 

  8. El-Khatib, O., Pontelli, E., Son, T.C.: Asp-prolog: A system for reasoning about answer set programs in prolog. In: Jayaraman, B. (ed.) PADL 2004. LNCS, vol. 3057, pp. 148–162. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the 5th ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3-4), 365–386 (1991)

    Article  Google Scholar 

  11. Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503–582 (May/July 1994)

    Article  MathSciNet  Google Scholar 

  12. Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proceedings of the 12th International Conference on Logic Programming, Kanagawa 1995. MIT Press Series Logic Program, pp. 581–595. MIT Press, Cambridge (1995)

    Google Scholar 

  13. Marek, V.W., Remmel, J.B.: On the expressibility of stable logic programming. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 107–120. Springer, Heidelberg (2001)

    Google Scholar 

  14. Marek, W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer, Heidelberg (1999)

    Google Scholar 

  15. McCarthy, J.: Circumscription: a form of nonmonotonic reasoning. Artificial Intelligence 13, 27–39 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  16. Moore, R.C.: Semantical considerations on nonmonotonic logics. Artificial Intelligence 25, 75–94 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  17. Niemelä, I., Simons, P.: Smodels — an implementation of the stable model and well-founded semantics for normal lp. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 421–430. Springer, Heidelberg (1997)

    Google Scholar 

  18. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog decision support system for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

  21. Teng, C., Van Hentenryck, P., Deville, Y.: A generic arc-consistency algorithm and its specializations, June 11 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Università di Napoli Federico II,  

    S. Baselice & P. A. Bonatti

  2. Texas Tech University,  

    M. Gelfond

Authors
  1. S. Baselice
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. A. Bonatti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Gelfond
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Università di Bologna, Italy

    Maurizio Gabbrielli

  2. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX

    Gopal Gupta

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baselice, S., Bonatti, P.A., Gelfond, M. (2005). Towards an Integration of Answer Set and Constraint Solving. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_7

Download citation

  • DOI: https://doi.org/10.1007/11562931_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29208-1

  • Online ISBN: 978-3-540-31947-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation