Translation of aggregate programs to normal logic programs

CEUR Workshop Proceedings

Volumn 78, Issue , 2003, Pages 29-42

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

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMS; PARTIAL STABLE MODELS; WELL-FOUNDED MODELS;

AGGREGATES; LOGIC PROGRAMMING;

PROGRAM TRANSLATORS;

EID: 84880217336     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. K. R. Apt, H. A. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 2, pages 89-148. Morgan Kaufmann, 1988.
2. 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.
3. M. Denecker, V. Marek, and M. Truszczýnski. Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In J. Minker, editor, Logic-based Artificial Intelligence, pages 127-144. Kluwer Academic Publishers, 2000.
4. M. Denecker, V. Marek, and M. Truszczýnsky. 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. P. Ferraris and V. Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 2003. To appear.
7. M. Fitting. A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295-312, 1985.
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. 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.
11. N. Pelov, M. Denecker, and M. Bruynooghe. Partial stable semantics for logic programs with aggregates. In LPNMR, 2004. In review. Avaliable at http://www.cs.kuleuven.ac.be/~pelov/papers/lpnmr7.ps.gz.
12. T. Przymusinksi. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445-464, 1990.
13. T. Przymusinski. On the declarative semantics of deductive databases and logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 5, pages 193-216. Morgan Kaufmann, 1988.
14. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.