Comparing the expressive powers of some syntactically restricted classes of logic programs

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

Volumn 1861, Issue , 2000, Pages 852-866

  Janhunen, Tomi ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY LOGIC; IMPLEMENTATION TECHNIQUES; LITERALS; LOGIC PROGRAMS; NEGATIVE LITERALS; STABLE MODEL SEMANTICS; TRANSLATION FUNCTIONS;

ATOMS; POLYNOMIALS; PROGRAM TRANSLATORS; SEMANTICS;

LOGIC PROGRAMMING;

EID: 84867750055     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_57     Document Type: Conference Paper

References (21)

1. S. Brass and J. Dix. Semantics of (disjunctive) logic prog rams based on partial evaluation. Journal of Logic Programming, 38(3):167-213, 1999.
2. K.L. Clark Negation as failure In H. Gallaire and J. Minker, editors, Logic and Data Bases 293-322. Plenum Press, New York 1978.
3. S. A. Cook. The complexity of theorem proving procedures. In Proceedings of the third Annual ACM Symposium on Theory of Computing, pages 151-158, 1971.
4. 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 M IT Press.
5. M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Proceed-ings of the 7th International Conference on Logic Programming, pages 579-597, Jerusalem, Israel, June 1990. T he MIT Press.
6. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
7. G. Gottlob. Translating default logic into standard autoepistemic logic. Journal of the Association for Computing Machinery, 42(2):711-740, 1995.
8. T. Imielinski. Results on translating defaults to circumscription. Artificial Intelli-gence, 32:131-146, 1987.
9. T. Janhunen. Classifying semi-normal default logic on the basis of its expressive power. In M. Gelfond, N. Leone, and G. Pfeifer, editors, Proceedings of the 5th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR'99, pages 19-33, El Paso, Texas, December 1999. Springer. LNAI 1730.
10. T. Janhunen. On the intertranslatability of non-monotonic logics. Annals of Math-ematics in Artificial Intelligence, 27(1-4):79-128, 1999.
11. T. Janhunen, I. Niemelä , P. Simons, and J.-H. You. U nfolding partiality and disjunctions in stable model semantics. In A.G. Cohn, F. Giunchiglia, and Selman B., editors, Principles of Knowledge Representation and Reasoning: Proceedings of KR'2000, pages 411-422, Breckenridge, Colorado, Apr il 2000.
12. J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, Berlin, 1987.
13. W. Marek and M. Truszczyski. Autoepistemic logic. Journal of the ACM, 38:588-619, 1991.
14. W. Marek and M. Truszczyski. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective, pages 375-398. Springer-Verlag, 1999.
15. I. Niemelä . Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25(3,4):241-273, 1999.
16. . I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In M. Maher, editor, Proceedings of the Joint International Con-ference and Symposium on Logic Programming, pages 289-303, Bonn, Germany, September 1996. The MIT Press.
17. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55-76. Plenum Press, New York, 1978.
18. L. Sterling and E. Shapiro. The Art of Prolog. MIT Series in logic programming. The MIT Press, London, 1986.
19. V.S. Subr ahmanian, D. Nau, and C. Vago. WFS + branch and bound = stable models. IEEE Transactions on Knowledge and Data Engineering, 7(3):362-377, 1995.
20. M.H. Van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23:733-742, 1976.
21. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semant ics for general logic programs. Journal of the ACM, 38(3):620-650, July 1991.