Advertisement

Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP

  • Islam Elkabani
  • Enrico Pontelli
  • Tran Cao Son
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3132)

Abstract

In this work we propose a semantically well-founded extension of Answer Set Programming (ASP) with aggregates, which relies on the integration between answer set solvers and constraint logic programming systems. The resulting system is efficient, flexible, and supports form of aggregation more general than those previously proposed in the literature. The system is developed as an instance of a general framework for the embedding of arbitrary constraint theories within ASP.

Keywords

Logic Programming Stable Model Choice Point Constraint Solver Aggregate Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baral, C.: Knowledge Representation, reasoning, and problem solving, Cambridge (2003)Google Scholar
  2. 2.
    Baral, C., Gelfond, M.: Logic Programming and Knowledge Representation. JLP 19/20 (1994)Google Scholar
  3. 3.
    Dell’Armi, T., et al.: Aggregate Functions in DLV. In: Intl. ASP Workshop, vol. 2 (2003)Google Scholar
  4. 4.
    Denecker, M., et al.: Ultimate well-founded and stable semantics for logic programs with aggregates. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, p. 212. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Dovier, A., et al.: Intensional Sets in CLP. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 284–299. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  6. 6.
    Eiter, T., et al.: The KR System dlv: Progress Report, Comparisons, and Benchmarks. KRR (1998)Google Scholar
  7. 7.
    Gelfond, M.: Representing Knowledge in A-Prolog. In: Logic Programming&Beyond, Springer, Heidelberg (2002)Google Scholar
  8. 8.
    Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: ILPS, MIT, Cambridge (1988)Google Scholar
  9. 9.
    Greco, S.: Dynamic Programming in Datalog with Aggregates. TKDE 11(2) (1999)Google Scholar
  10. 10.
    Kemp, D., et al.: Efficient Recursive Aggregation and Negation in Deductive Databases. TKDE 10(5) (1998)Google Scholar
  11. 11.
    Kemp, D., Stuckey, P.: Semantics of Logic Programs with Aggregates. In: ILPS, MIT Press, Cambridge (1991)Google Scholar
  12. 12.
    Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)Google Scholar
  13. 13.
    Ross, K.A., Sagiv, Y.: Monotonic Aggregation in Deductive Databases. JCSS 54, 79–97 (1997)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Ross, K., et al.: Foundations of Aggregation Constraints. TCS 193(1-2) (1998)Google Scholar
  15. 15.
    Simons, P., et al.: Extending and Implementing the Stable Model Semantics. AIJ 138(1-2) (2002)Google Scholar
  16. 16.
    Van Gelder, A.: The Well-Founded Semantics of Aggregation. ACM PODS (1992)Google Scholar
  17. 17.
    Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: a Platform for Constraint Logic Programming. IC-Parc, Imperial College (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Islam Elkabani
    • 1
  • Enrico Pontelli
    • 1
  • Tran Cao Son
    • 1
  1. 1.Department of Computer ScienceNew Mexico State University 

Personalised recommendations