Partial stable models for logic programs with aggregates

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 207-219

  Pelov, Nikolay ^a   Denecker, Marc ^a   Bruynooghe, Maurice ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; AGGREGATES; MANY VALUED LOGICS;

COMPUTATIONAL LOGIC; LOGIC PROGRAMS; STABLE SEMANTICS;

LOGIC PROGRAMMING;

LOGIC PROGRAMS; PARTIAL STABLE MODELS; STABLE MODEL; STABLE SEMANTICS; THREE-VALUED LOGIC;

EID: 9444284942     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In Proc. of the 18th Int. Joint Conference on Artificial Intelligence, 2003.
2. T. Dell'Armi, W. Faber, G. Ielpa, N. Leone, and G. Pfeifer. Aggregate functions in DLV. In Answer Set Programming: Advances in Theory and Implementation, pages 274-288, 2003. online CEUR-WS.org/Vol-78/.
3. M. Denecker, V. Marek, and M. Truszczyński. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In J. Minker, editor, Logic-based Artificial Intelligence, pages 127-144. 2000.
4. M. Denecker, V. Marek, and M. Truszczyńsky. Ultimate approximations in nonmonotonic knowledge representation systems. In Principles of Knowledge Representation and Reasoning, pages 177-188. Morgan Kaufmann, 2002.
5. M. Denecker, N. Pelov, and M. Bruynooghe. Ultimate well-founded and stable model semantics for logic programs with aggregates. In P. Codognet, editor, Int. Conf. on Logic Programming, volume 2237 of LNCS, pages 212-226. Springer, 2001.
6. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295-312, 1985.
7. M. Fitting. Fixpoint semantics for logic programming a survey. Theoretical Computer Science, 278(1-2):25-51, 2002.
8. M. Gelfond. Representing knowledge in A-Prolog. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, volume 2408 of LNCS, pages 413-451. Springer, 2002.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. A. Bowen, editors, Logic Programming, Proc. of the 5th International Conference and Symposium, pages 1070-1080. MIT Press, 1988.
10. D. B. Kemp, D. Srivastava, and P. J. Stuckey. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science, 146(1-2):145-184, 1995.
11. D. B. Kemp and P. J. Stuckey. Semantics of logic programs with aggregates. In Proc. of the Int. Logic Programming Symposium, pages 387-401. MIT Press, 1991.
12. V. Marek and J. Remmel. On logic programs with cardinality constraints. In 9th International Workshop on Non-Monotonic Reasoning, pages 219-228, 2002.
13. I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In 16th Int. Conf. on Very Large Data Bases, pages 264-277, 1990.
14. T. Przymusinksi. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-464, 1990.
15. K. A. Ross and Y. Sagiv. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences, 54(1):79-97, 1997.
16. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.
17. A. Van Gelder. The well-founded semantics of aggregation. In 11th ACM Symposium on Principles of Database Systems, pages 127-138. ACM Press, 1992.