On the expressibility of stable logic programming

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

Volumn 2173 LNAI, Issue , 2001, Pages 107-120

  Marek, V W ^a   Remmel, J B ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATALOG PROGRAMS; DECISION PROBLEMS; DEFAULT LOGIC; EXPRESSIBILITY; FINAL STATE; LINEAR TIME; NONNEGATIVE INTEGERS; POLYNOMIAL-TIME; SEARCH PROBLEM; STABLE MODEL;

INTEGER PROGRAMMING; POLYNOMIAL APPROXIMATION; TURING MACHINES;

LOGIC PROGRAMMING;

EID: 67349203798     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45402-0_8     Document Type: Conference Paper

References (34)

1. K. R. Apt. Logic Programming. in Handbook of Theoretical Computer Science, pp. 475-574. Elsevier, 1990.
2. K. R. Apt and H. A. Blair. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae, 12:1-17, 1990.
3. K. 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-142, Los Altos, CA, 1988. Morgan Kaufmann.
4. K. R. Apt and D. Pedreschi. Reasoning about termination of pure Prolog programs. Information and Computation 106:109-157, 1994.
5. K. R. Apt and A. Pellegrini. On the occur-check free pure Prolog programs. ACM Toplas 16:687-726, 1994.
6. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley Publishing Company, 1995.
7. H. A. Blair, W. Marek, and J. Schlipf. The expressiveness of locally stratified programs. Annals of Mathematics and Artificial Intelligence, 15:209-229, 1995.
8. K. A. Bowen and R. A. Kowalski. Amalgamating language and metalanguage in Logic Programming. In: Logic Programming, pp. 153-172, Academic Press, 1982.
9. M. Cadoli and L. Palipoli. Circumscribing datalog: expressive power and complexity. Theoretical Computer Science, 193:215-244, 1998.
10. M. Cadoli, T. Eiter and G. Gottlob. Default logic as a query language. IEEE Transactions on Knowledge and Data Engineering, 9:448-463, 1997.
11. 0 Classes in Mathematics. Handbook of Recursive Mathematics pp. 623-821, Elsevier 1999.
12. P. Cholewiński, W. Marek, and M. Truszczyński. Default reasoning system DeReS. In Proceedings of KR-96, pages 518-528. Morgan Kaufmann, 1996.
13. S. Cook. The complexity of theorem-proving procedures. Proceedings of Third Annual ACM Symposium on Theory of Computing pp. 151-158. 1971.
14. E. Dantsin, T. Eiter, G. Gottloband A. Voronkov. Complexity and Expressive Power of Logic Programming, Technical Report of Institut für Informationssysteme, Technische Universität Wien", INFSYS RR-1843-99-05, 1999, To appear in: ACM Computing Surveys.
15. P. M. Dung and K. Kanchanasut. On the generalized predicate completion of non-Horn programs, In: Logic programming, Proceedings of the North American Conference, pp. 587-603, MIT Press, 1989.
16. T. Eiter, W. Faber, N. Leone and G. Pfeifer, Computing Preferred and Weakly Preferred Answer Sets by Meta-Interpretation in Answer Set Programming, In: Proceedings AAAI 2001 Spring Symposium on Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, Stanford, CA (Workshop Technical Report SS-01-01), AAAI Press, 2001.
17. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello. A deductive system for non-monotonic reasoning. In Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 363-374, 1997. Springer LN in Computer Science 1265.
18. M. R. Garey and D. S. Johnson. Computers and intractability; a guide to the theory of NP-completeness. W. H. Freeman, 1979.
19. M. Gelfond and V. Lifschitz. The stable semantics for logic programs. In Proceedings of the 5th International Symposium on Logic Programming, pages 1070-1080, Cambridge, MA, 1988. MIT Press.
20. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing 9:365-385, 1991.
21. J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19(20):503-581, 1994.
22. V. Lifschitz. Action languages, answer sets and planning. The Logic Programming Paradigm, pp. 357-373. Series Artificial Intelligence, Springer-Verlag, 1999.
23. W. Marek, A. Nerode, and J. B. Remmel. The stable models of predicate logic programs. Journal of Logic Program ming, 21(3):129-154, 1994.
24. W. Marek and M. Truszczyński. Autoepistemic logic. Journal of the ACM, 38:588-619, 1991.
25. V. W. Marek and M. Truszczyński. Nonmonotonic Logic - Context-Dependent Reasoning. Series Artificial Intelligence, Springer-Verlag, 1993.
26. V. W. Marek and M. Truszczyński. Stable Models and an Alternative Logic Programming Paradigm. The Logic Programming Paradigm, pp. 375-398. Series Artificial Intelligence, Springer-Verlag, 1999.
27. K. Marriott and P. J. Stuckey. Programming with Constraints: An Introduction. MIT Press, Cambridge, MA, 1998.
28. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. In Proceedings of the Workshop on Computational Aspects of Nonmonotonic Reasoning, pages 72-79, 1998.
29. I. Niemelä and P. Simons. Efficient implementation of the well-founded and stable model semantics. In Proceedings of JIC SLP-96. MIT Press, 1996.
30. T. Przymusiński. On the declarative semantics of deductive databases and logic programs. In Foundations of deductive databases and logic programming, pages 193-216, Los Altos, CA, 1988. Morgan Kaufmann.
31. P. Rao, I. V. Ramskrishnan, K. Sagonas, T. Swift, D. S. Warren, and J. Freire. XSB: A system for efficiently computing well-founded semantics. In Proceedings of LPNMR'97, pages 430-440, Lecture Notes in Computer Science, 1265, Springer-Verlag, 1997.
32. J. Schlipf. The expressive powers of the logic programming semantics. Journal of the Computer Systems and Science, 51:64-86, 1995.
33. J. D. Ullman. Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville, MD, 1988.
34. A. Van Gelder, K. A. Ross, and J. S. Schlipf. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM, 38:620-650, 1991.