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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baral, C.: Knowledge Representation, reasoning, and problem solving, Cambridge (2003)
Baral, C., Gelfond, M.: Logic Programming and Knowledge Representation. JLP 19/20 (1994)
Dell’Armi, T., et al.: Aggregate Functions in DLV. In: Intl. ASP Workshop, vol. 2 (2003)
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)
Dovier, A., et al.: Intensional Sets in CLP. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 284–299. Springer, Heidelberg (2003)
Eiter, T., et al.: The KR System dlv: Progress Report, Comparisons, and Benchmarks. KRR (1998)
Gelfond, M.: Representing Knowledge in A-Prolog. In: Logic Programming&Beyond, Springer, Heidelberg (2002)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programs. In: ILPS, MIT, Cambridge (1988)
Greco, S.: Dynamic Programming in Datalog with Aggregates. TKDE 11(2) (1999)
Kemp, D., et al.: Efficient Recursive Aggregation and Negation in Deductive Databases. TKDE 10(5) (1998)
Kemp, D., Stuckey, P.: Semantics of Logic Programs with Aggregates. In: ILPS, MIT Press, Cambridge (1991)
Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, Springer, Heidelberg (1999)
Ross, K.A., Sagiv, Y.: Monotonic Aggregation in Deductive Databases. JCSS 54, 79–97 (1997)
Ross, K., et al.: Foundations of Aggregation Constraints. TCS 193(1-2) (1998)
Simons, P., et al.: Extending and Implementing the Stable Model Semantics. AIJ 138(1-2) (2002)
Van Gelder, A.: The Well-Founded Semantics of Aggregation. ACM PODS (1992)
Wallace, M., Novello, S., Schimpf, J.: ECLiPSe: a Platform for Constraint Logic Programming. IC-Parc, Imperial College (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkabani, I., Pontelli, E., Son, T.C. (2004). Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive