On the expressibility of stable logic programming

Theory and Practice of Logic Programming

Volumn 3, Issue 4-5, 2003, Pages 551-567

  Marek, Victor W ^a   Remmel, Jeffrey B ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Answer Set Programming; Expressibility; Turing machines

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; SET THEORY; TURING MACHINES;

ANSWER SET PROGRAMMING;

LOGIC PROGRAMMING;

EID: 0345393810     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001777     Document Type: Article

References (41)

1. ABITEBOUL, S., HULL, R. AND VIANU, V. 1995. Foundations of Databases. Addison-Wesley.
2. APT, K. R. 1990. Logic programming. In: Handbook of Theoretical Computer Science, pp. 475-574. Elsevier.
3. APT, K. R. AND BLAIR, H. A. 1990. Arithmetical classification of perfect models of stratified programs. Fundamenta Informaticae 12, 1-17.
4. APT, K. R., BLAIR, H. A. AND WALKER, A. 1988. Towards a theory of declarative knowledge. Foundations of Deductive Databases and Logic Programming, pp. 89-142. Morgan Kaufmann.
5. APT, K. R. AND PEDRESCHI D. 1994. Reasoning about termination of pure Prolog programs. Information and Computation 106, 109-157.
6. APT, K. R. AND PELLEGRINI, A. 1994. On the occur-check free pure Prolog programs. ACM Transactions on Programming Languages and Systems 16, 687-726.
7. BLAIR, H. A., MAREK, W. AND SCHLIPF, J. 1995. The expressiveness of locally stratified programs. Annals of Mathematics and Artificial Intelligence 15, 209-229.
8. BONATTI, P. A. 2001. Reasoning with infinite stable models. Proceedings of International Joint Conference on Artificial Intelligence, pp. 603-608. Morgan Kaufmann.
9. BOWEN, K. A. AND KOWALSKI, R. A. 1982. Amalgamating language and metalanguage in ILogic programming. Logic Programming, pp. 153-172. Academic Press.
10. CADOLI, M., EITER, T. AND GOTTLOB, G. 1997. Default logic as a query language. IEEE Transactions on Knowledge and Data Engineering 9, 448-463.
11. CADOLI. M. AND PALIPOLI, L. 1998. Circumscribing Datalog: expressive power and complexity. Theoretical Computer Science 193, 215-244.
12. 0 Classes in Mathematics. Handbook of Recursive Mathematics, pp. 623-821. Elsevier.
13. CHOLEWIŃSKI, P., MAREK, W., MIKITIUK, A. AND TRUSZCZYŃSKI, M. 1999. Programming with default logic. Artificial Intelligence Journal 112, 105-146.
14. CHOLEWIŃSKI, P., MAREK, W. AND TRUSZCZYŃSKI, M. 1996. Default reasoning system DeReS. Proceedings of Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96), pp. 518-528. Morgan Kaufmann.
15. COOK, S. 1971. The complexity of theorem-proving procedures. Proceedings of Third Annual ACM Symposium on Theory of Computing, pp. 151-158.
16. DANTSIN, E., EITER, T., GOTTLOB, G. AND VORONKOV, A. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys 33, 374-425.
17. DUNG, P. M. AND KANCHANASUT, K. 1989. On the generalized predicate completion of non-Horn programs. Logic programming, Proceedings of the North American Conference, pp. 587-603. MIT Press.
18. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G. AND SCARCELLO, F. 1997. A deductive system for non-monotonic reasoning. Proceedings 4th International Conference on Logic Programming and Nonmonotonic Reasoning: Lecture Notes in Computer Science 1265, pp. 363-374. Springer-Verlag.
19. EITER, T., LEONE, N., MATEIS, C., PFEIFER, G. AND SCARCELLO, F. 1998. The KR System dlv: Progress Report, Comparisons, and Benchmarks. Proceedings Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR-98), pp. 406-417. Morgan Kaufmann.
20. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman.
21. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable semantics for logic programs. Proceedings 5th International Symposium on Logic Programming, pp. 1070-1080. MIT Press.
22. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
23. JAFFAR, J. AND MAHER, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19(20), 503-581.
24. LIFSCHITZ, V. 1999. Action languages, answer sets and planning. The Logic Programming Paradigm, pp. 357-373. Springer-Verlag.
25. LIFSCHITZ, V. 1999. Answer set planning. Proceedings 5th International Conference on Logic Programming and Nonmonotonic Reasoning: Springer Lecture Notes in Computer Science 1730, pp. 373-374.
26. MAREK, W., NERODE, A. AND REMMEL, J. B. 1994. The stable models of predicate logic programs. Journal of Logic Programming 21(3), 129-154.
27. MAREK, V. W. AND REMMEL, J. B. 2001. On the foundations of answer set programming. Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pp. 124-131. AAAI Press.
28. MAREK, W. AND TRUSZCZYŃSKI, M. 1991. Autoepistemic logic. Journal of the ACM 38, 588-619.
29. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1993. Nonmonotonic Logic - Context-Dependent Reasoning. Springer-Verlag.
30. MAREK, V. W. AND TRUSZCZYŃSKI, M. 1999. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm, pp. 375-398. Springer-Verlag.
31. MARRIOTT, K. AND STUCKEY, P. J. 1998. Programming with Constraints: An Introduction. MIT Press.
32. NIEMELÄ, I. 1998. Logic programs with stable model semantics as a constraint programming paradigm. Proceedings Workshop on Computational Aspects of Nonmonotonic Reasoning, pp. 72-79.
33. NIEMELÄ, I. AND SIMONS, P. 1996. Efficient implementation of the well-founded and stable model semantics. Proceedings Joint International Conference and Symposium on Logic Programming, pp. 289-303. MIT Press.
34. NIEMELÄ, I. AND SIMONS, P. 1997. Smodels - an implementation of the stable model and well-founded semantics for normal logic programs, Proceedings 4th International Conference on Logic Programming and Nonmonotonic Reasoning: Springer Lecture Notes in Computer Science 1265, pp. 420-429.
35. PRZYMUSIŃSKI, T. 1988. On the declarative semantics of deductive databases and logic programs. Foundations of deductive databases and logic programming, pp. 193-216. Morgan Kaufmann.
36. RAO, P., RAMSKRISHNAN, I. V., SAGONAS, K., SWIFT, T., WARREN, D. S. AND FREIRE, D. S. 1997. XSB: A system for efficiently computing well-founded semantics. Proceedings 4th International Conference on Logic Programming and Nonmonotonic Reasoning: Springer Lecture Notes in Computer Science 1265, pp. 430-440.
37. SCHLIPF, J. 1995. The expressive powers of the logic programming semantics. Journal of the Computer Systems and Science 51, 64-86.
38. SYRJÄNEN, T. 2001. Manual of Lparse version 1.0, http://saturn.tcs.hut.fi/Software/smodels
39. SOININEN, T. AND NIEMELÄ, I. 1999. Developing a declarative rule language for applications in product configuration. Proceedings First International Workshop in Practical Aspects of Declarative Languages, pp. 305-319. Springer-Verlag.
40. ULLMAN, J. D. 1988. Principles of Database and Knowledge-Base Systems. Computer Science Press.
41. VAN GELDER, A., Ross, K. A. AND SCHLIPF, J. S. 1991. Unfounded sets and well-founded semantics for general logic programs. Journal of the ACM 38, 620-650.