A counter-based approach to translating normal logic programs into sets of clauses

CEUR Workshop Proceedings

Volumn 78, Issue , 2003, Pages 166-180

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSICAL MODEL; LITERALS; LOGIC PROGRAMS; STABLE MODEL; TRANSLATION FUNCTIONS;

ATOMS; LOGIC PROGRAMMING;

PROGRAM TRANSLATORS;

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

References (17)

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, pages 89-148. Morgan Kaufmann Publishers, Los Altos, 1988.
2. Y. Babovich, E. Erdem, and V. Lifschitz. Fages' theorem and answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA, April 2000. cs.AI/0003042.
3. R. Ben-Eliyahu and R. Dechter. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12(l-2):53-87, 1994.
4. K.L. Clark. Negation as failure. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
5. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the Fourth European Conference on Planning, pages 169-181, Toulouse, France, September 1997. Springer-Verlag.
6. E. Erdem and V. Lifschitz. Transitive closure, answer sets and predicate completion. In AAAI Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning. AAAI, 2001.
7. E. Erdem and V. Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3(4-5):499-518, 2003.
8. F. Fages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
9. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming, pages 1070-1080, Seattle, USA, August 1988. The MIT Press.
10. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
11. T. Janhunen. Comparing the expressive powers of some syntactically restricted classes of logic programs. In Computational Logic, First International Conference, pages 852-866, London, UK, July 2000. Springer-Verlag. LNAI 1861.
12. T. Janhunen. Translatability and intranslatability results for certain classes of logic programs. Series A: Research reports, Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2003. To appear.
13. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence, Portland, Oregon, July 1996.
14. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.
15. V.W. Marek and V.S. Subrahmanian. The relationship between stable, supported, default and autoepistemic semantics for general logic programs. Theoretical Computer Science, 103:365-386, 1992.
16. W. Marek and M. Truszczynski. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25- Year Perspective, pages 375-398. Springer-Verlag, 1999.
17. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.