Skip to main content

\(\mathbb{ASP-PROLOG}\): A System for Reasoning about Answer Set Programs in Prolog

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3057))

Abstract

We present a system (\(\mathbb{ASP-PROLOG}\)) which provides a tight and well-defined integration of Prolog and Answer Set Programming (ASP). The combined system enhances the expressive power of ASP, allowing us to write programs that reason about dynamic ASP modules and about collections of stable models. These features are vital in a number of application domains (e.g., planning, scheduling, diagnosis). We describe the design of \(\mathbb{ASP-PROLOG}\) along with its implementation, realized using CIAO Prolog and Smodels.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. The DLV Wrapper Project. 160.97.47.246:8080/wrapper (2003)

    Google Scholar 

  2. Castro, L., Swift, T., Warren, D.S.: XASP: Answer Set Programming with XSB and Smodels. SUNY Stony Brook (2002), xsb.sourceforge.net/packages/xasp.pdf

  3. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: The KR System dlv: Progress Report, Comparisons, and Benchmarks. In: KR 1998, pp. 406–417 (1998)

    Google Scholar 

  4. Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: ICLPS 1988, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  5. Heljanko, K., Niemela, I.: Answer Set Programming and Bounded Model Checking. TPLP 3(4), 519–550 (2003)

    MATH  MathSciNet  Google Scholar 

  6. Hermenegildo, M., Bueno, F., Cabeza, D., Carro, M., García de la Banda, M.J., López-García, P., Puebla, G.: The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems. In: Parallelism and Implementation of Logic and Constraint Logic Programming, Nova Science, Commack, NY, USA, April 1999, pp. 65–85 (1999)

    Google Scholar 

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

  8. Lifschitz, V.: Action Languages, Answer Sets, and Planning. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)

    Google Scholar 

  9. Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of A Logic Program By SAT Solvers. In: AAAI, pp. 112–117 (2002)

    Google Scholar 

  10. Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)

    MATH  Google Scholar 

  11. Marek, V.W., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K.R., Marek, V.W., Truszcziński, M., Warren, D.S. (eds.) The Logic Programming Paradigm, Springer, Heidelberg (1999)

    Google Scholar 

  12. Niemela, I.: Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and AI 25(3/4), 241–273 (1999)

    MathSciNet  Google Scholar 

  13. Niemela, 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 

  14. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Descision 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 

  15. Pineda, M., Bueno, F.: The O’Ciao Approach to Object Oriented Logic Programming. In: Colloquium on Implementation of Constraint Logic Programming Systems (2002)

    Google Scholar 

  16. Son, T.C., Pontelli, E.: Planning with preferences using logic programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 247–260. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Syrjänen, T.: Lparse User’s Manual, http://www.tcs.hut.fi/Software/smodels/

  18. Syrjänen, T.: Implementation of Local Grounding for Logic Programs with Stable Model Semantics. Technical Report B-18, Helsinki University of Technology (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elkhatib, O., Pontelli, E., Son, T.C. (2004). \(\mathbb{ASP-PROLOG}\): A System for Reasoning about Answer Set Programs in Prolog. In: Jayaraman, B. (eds) Practical Aspects of Declarative Languages. PADL 2004. Lecture Notes in Computer Science, vol 3057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24836-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24836-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22253-8

  • Online ISBN: 978-3-540-24836-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics