Well-founded and stable semantics of logic programs with aggregates

Theory and Practice of Logic Programming

Volumn 7, Issue 3, 2007, Pages 301-353

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

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Aggregates; Logic programming

Indexed keywords

COMPUTATION THEORY; COMPUTER SOFTWARE; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; SEMANTICS;

AGGREGATE PROGRAMS; OPERATOR APPROXIMATION; PRECISION HIERARCHY;

LOGIC PROGRAMMING;

EID: 33947245895     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068406002973     Document Type: Article

References (33)

1. APT, K. R., BLAIR, H. A. AND WALKER, A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, J. Minker, Ed. Morgan Kaufmann, Chapter 2, 89-148.
2. DAVEY, B. A. AND PRISTLEY, H. A. 1990. Introduction to Lattices and Order. Cambridge University Press.
3. DELL'ARMI, T., FABER, W., IELPA, G., LEONE, N. AND PFEIFER, G. 2003. Aggregate functions in disjunctive logic programming: Semantics, complexity, and implementation in DLV. In 18th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, 847-852.
4. DENECKER, M. 2000. Extending classical logic with inductive definitions. In 1st International Conference on Computational Logic. Lecture Notes in Artificial Intelligence, vol. 1861. Springer, 703-717.
5. DENECKER, M., MAREK, V. AND TRUSZCZYŃSKI, M. 2000. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In Logic-based Artificial Intelligence, J. Minker, Ed. Kluwer Academic Publishers, 127-144.
6. DENECKER, M., MAREK, V. AND TRUSZCZYŃSKI, M. 2003. Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence 143, 1, 79-122.
7. DENECKER, M., MAREK, V. AND TRUSZCZYŃSKI, M. 2004. Ultimate approximations and its application in nonmonotonic knowledge representation. Information and Computation 192, 1, 84-121.
8. DENECKER, M., PELOV, N. AND BRUYNOOGHE, M. 2001. Ultimate well-founded and stable model semantics for logic programs with aggregates. In 17th International Conference on Logic Programming. LNCS, vol. 2237. Springer, 212-226.
9. ELKABANI, I., PONTELLI, E. AND SON, T. C. 2004. Smodels with CLP and its applications: A simple and effective approach to aggregates in ASP. In International Conference on Logic Programming. 73-89.
10. FABER, W., LEONE, N. AND PFEIFER, G. 2004. Recursive aggregates in disjunctive logic programs: Semantics and complexity. In 9th European Conference on Artificial Intelligence (JELIA). LNCS, vol. 3229. Springer, 200-212.
11. FERRARIS, P. 2005. Answer sets for propositional theories. In 8th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 3662. Springer, 119-131.
12. FITTING, M. 1985. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming 2, 4, 295-312.
13. GELFOND, M. 2002. Representing knowledge in A-Prolog. In Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II, A. C. Kakas and F. Sadri, Eds. LNCS, vol. 2408. Springer, 413-451.
14. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Logic Programming, Proc. of the 5th International Conference and Symposium. MIT Press, 1070-1080.
15. KEMP, D. B. AND STUCKEY, P. J. 1991. Semantics of logic programs with aggregates. In International Logic Programming Symposium. MIT Press, 387-401.
16. LIFSCHITZ, V., PEARCE, D. AND VALVERDE, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 4, 526-541.
17. LINDSTRÖM, P. 1966. First order predicate logic with generalized quantifiers. Theoria 32, 186-195.
18. MAREK, V., NIEMELÄ, I. AND TRUSZCZYŃSKI, M. 2004. Logic programs with monotone cardinality atoms. In 7th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 2923. Springer, 155-166.
19. MAREK, V. AND REMMEL, J. 2004. Set constraints in logic programming. In 7th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 2923. Springer, 167-179.
20. MAREK, V. W. AND TRUSZCZYŃSKI, M. 2004. Logic programs with abstract constraint atoms. In National Conference on Artificial Intelligence. AAAI Press / The MIT Press, 86-91.
21. MITCHELL, D. AND TERNOVSKA, E. 2005. A framework for representing and solving NP-search problems. In Proc. of the National Conference on Artificial Intelligence. 430-435.
22. MUMICK, I. S., PIRAHESH, H. AND RAMAKRISHNAN, R. 1990. The magic of duplicates and aggregates. In 16th International Conference on Very Large Data Bases. Morgan Kaufmann, 264-277.
23. PELOV, N. 2004. Semantics of logic programs with aggregates. Ph.D. thesis, K.U.Leuven.
24. PELOV, N., DENECKER, M. AND BRUYNOOGHE, M. 2004. Partial stable semantics for logic programs with aggregates. In 7th International Conference on Logic Programming and Nonmonotonic Reasoning. LNCS, vol. 2923. Springer, 207-219.
25. ROSS, K. A. AND SAGIV, Y. 1997. Monotonic aggregation in deductive databases. Journal of Computer and System Sciences 54, 1, 79-97.
26. SIMONS, P., NIEMELÄ, I. AND SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1-2, 181-234.
27. SON, T. C. AND PONTELLI, E. 2007. A constructive semantic characterization of aggregates in answer set programming. Theory and Practice of Logic Programming. Accepted as a Technical Note.
28. VAN EIJCK, J. 1996. Quantifiers and partiallity. In Quantifiers, Logic, and Language, J. van der Does and J. van Eijck, Eds. CSLI, 105-144.
29. VAN EMDEN, M. H. AND KOWALSKI, R. A. 1976. The semantics of predicate logic as a programming language. Journal of the ACM 23, 4, 733-742.
30. VAN GELDER, A. 1992. The well-founded semantics of aggregation. In 11th ACM Symposium on Principles of Database Systems. ACM Press, 127-138.
31. VAN GELDER, A., ROSS, K. A. AND SCHLIPF, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620-650.
32. VAN NUFFELEN, B. AND DENECKER, M. 2000. Problem solving in ID-logic with aggregates: some experiments. In 8th International Workshop on Nonmonotonic Reasoning, special track on Abductive Reasoning.
33. VENNEKENS, J., GILIS, D. AND DENECKER, M. 2006. Splitting an operator: Algrebraic modularity results for logics with fixpoint semantics. ACM Transactions on Computational Logic. Accepted.