On the complexity of perfect models of logic programs

Fundamenta Informaticae

Volumn 39, Issue 3, 1999, Pages 249-258

  Dudakov, Sergey M ^a  

^a TVER STATE UNIVERSITY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040964944     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-39302     Document Type: Article

References (8)

1. K. Apt Logic programming, chapter 10 in van Leeuwen ed. Handbook of Theoretical Computer Science, Elsevier Science, 1990.
2. K. Apt, H. Blair, A. Walker Towards a theory of declarative knowledge in: Foundations of Deductive Databases and Logic Programming (1988) 99-148.
3. T. Eiter, G, Gottlob, On the computational cost of disjunctive logic programming: Propositional case, AMAI, 15 (1995) 289-323.
4. M. Gelfond, V. Lifschitz The stable model semantics for logic programming, in: Proc. 5th International Conf. and Symp. on Logic Programming, The MIT Press, 1988, 1070-1080.
5. W. Marek, M. Truszczynski Autoepistemic logic, Journal of ACM, 38 (3), 1991, 588-619.
6. W. Marek, M. Truszczynski Nonmonotonic logics; context-dependent reasoning, Springer-Verlag, 1993.
7. T. Przymusinski, On semantics of stratified deductive databases, in: Foundations of Deductive Databases and Logic Programming (1988) 433-443.
8. T. Przymusinski, Perfect model semantics, in: Proc. Intern. Conf. on Logic Programming (1988) 1081-1096.