Affordable classes of normal logic programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1265, Issue , 1997, Pages 92-111

  Seitzer, Jennifer ^a   Schlipf, John ^b  

^a Mathematics and Computer Science ^*  (United States)

^b UNIVERSITY OF CINCINNATI   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; TEMPORAL LOGIC;

LINEAR COMPLEXITY; LINEAR TIME; LOGIC PROGRAMS; NP COMPLETE; PROPOSITIONAL LOGIC; STABLE MODEL; WELL-FOUNDED MODELS;

COMPUTER CIRCUITS;

EID: 0345075211     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_7     Document Type: Conference Paper

References (20)

1. Rachel Ben-Eliyahu. A hierarchy of tractable subsets for computing stable models. Journal of Artificial Intelligence Research, 5:27-52, 1996.
2. Corman, Leiserson, and Rivest. Introduction to Algorithms. McGraw-Hill, 1991.
3. Yannis Dimopoulos. On computing logic programs. In Proceedings of Applications and Implementations of Nonmonotonic Reasoning Systems, 1996.
4. Yannis Dimopoulos and Alberto Torres. Graph theoretical structures in logic programs and default theories. Technical report, Max-Planck-Institut Fur Informatik, Im Stadtwalk, 66123 Saarbrucken, Germany, 1993.
5. C. Elkan. A rational reconstruction of nonmonotonic truth maintenance systems. Artificial Intelligence, 43:219-234, 1990.
6. Melvin Fitting. A kripke-kleene semantics for logic programs. Journal of Logic Programming, 2(4):295-312, 1985.
7. Michael R. Garey and David S. Jonson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.Freeman and company, 1979.
8. A. Van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3), July 1991.
9. Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proceedings of the Fifth Logic Programming Symposium, 1990.
10. H. Blair K. R. Apt and A. Walker. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, pages 89-148, 1988.
11. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.
12. A. Marek and M. Truszczynski. Autoepistemic logic. Technical report, University of Kentucky, University of Kentucky, Lexington, KY, 1988.
13. A. Wiktor Marek and Miroslaw Truszczynski. Autoepistemic logic. Journal of the ACM, 38(3), July 1991.
14. T. C. Przymusinski. Every logic progrean has a natural stratification and and iterated fixed point model. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 11-21, 1989.
15. John Schlipf. The expressive powers of the logic programming semantics. In Ninth ACM Symposium on Principles of Database Systems, 1990.
16. John Schlipf. Logic Programming Semantics, chapter A Comparison of Notions of Negation as Failure. Oxford University Press, 1994.
17. Jennifer Seitzer. Doctoral proposal: A study of the well-founded and stable logic programming semantics. 1996.
18. V.S.Subrahmanian. Personal communication.
19. R. Tarjan. Depth first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
20. Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Vol I Computer Science Press, Inc., 1988.