The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries

Journal of Computer and System Sciences

Volumn 54, Issue 3, 1997, Pages 441-464

  Saccá, Domenico ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; FORMAL LANGUAGES; LOGIC PROGRAMMING; POLYNOMIALS;

DATALOG PROGRAMMING LANGUAGE; DETERMINISTIC SEMANTICS; LEAST UNDEFINED STABLE MODELS; MAXIMAL STABLE MODELS; PARTIAL STABLE MODELS; TOTAL STABLE MODELS;

QUERY LANGUAGES;

EID: 0031165570     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1446     Document Type: Article

References (49)

1. K. Apt, H. Blair, and A. Walker, Towards a theory of declarative knowledge, in "Foundations of Deductive Databases and Logic Programming" (J. Minker, Ed.), pp. 89-142, Morgan Kauffman, Los Altos, CA, 1988.
2. S. Abiteboul, R. Hull, and V. Vianu, "Foundations of Databases," Addison-Wesley, Reading, MA, 1994.
3. S. Abiteboul, E. Simon, and V. Vianu, Non-deterministic languages to express deterministic transformations, in "Proc. ACM PODS Symposium, 1990," pp. 218-229.
4. S. Abiteboul and V. Vianu, Procedural languages for database queries and updates, J. Comput. System Sci. 41 (1990), 181-229.
5. S. Abiteboul, M. Y. Vardi, and V. Vianu, Fixpoints, relational machines, and computational complexity, in "Proc. 7th IEEE Conf. on Structure in Complexity Theory, 1992," pp. 156-168.
6. V. Baral and V. Subrahmanian, Stable and extension class theory for logic programs and default logic, J. Automated Reasoning 8 (1992), 345-366.
7. N. Bidoit, Negation in rule-based database languages: A survey, Theoret. Comput. Sci. 78, No. 3 (1991), 3-83.
8. M. Cadoli and M. Schaerf, A survey on complexity results for non-monotonic logics, J. Logic Programming 17 (1993), 127-160.
9. S. Ceri, G. Gottlob, and L. Tanca, "Logic Programming and Databases," Springer-Verlag, Berlin, 1990.
10. A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. and System Sci. 25 (1982), 99-128.
11. A. Chandra and D. Harel, Horn clause and generalizations, J. Logic Programming 2 (1985), 1-15.
12. Z-Z. Chen and S. Toda, The complexity of selecting maximal solutions, in "Proc. of 8th IEEE Conference on Structure in Complexity Theory, 1993," pp. 313-325.
13. P. Dung, Negation as hypotheses: An abductive foundation for logic programming, in "Proc. 8th Conference on Logic Programming, 1991," pp. 3-17.
14. T. Eiter, G. Gottlob, and H. Mannila, Expressive power and complexity of disjunctive DATALOG, in "Proc. ACM PODS Symposium, Minneapolis, MN, May 1994," pp. 267-278.
15. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in "Complexity of Computation" (R. Karp, Ed.), SIAM-AMS Proc., Vol. 7, pp. 43-73, 1974.
16. M. Carey and D. S. Johnson, "Computers and Intractability - A Guide to the Theory of NP-Completeness," Freeman, New York, 1979.
17. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in "Proc. 5th Conf. and Symp. on Logic Programming," pp. 1070-1080, MIT Press, Cambridge, 1988.
18. F. Giannotti, D. Pedreschi, D. Saccà, and C. Zaniolo, Non-determinism in deductive databases, in "Proc. 2nd Conference on deductive and Obgect-Oriented databases, DOOD 91" (C. Delobel, M. Kifer, Y. Masunaga, Eds.), pp. 29-146, Springer-Verlag, New York/Berlin, 1991.
19. p, in "Proc. of the Fifth Int. Conf. on Database Theory (ICDT'95), LNCS 893, Springer-Verlag, 1995," pp. 82-96.
20. Y. Gurovich, Logic and the challenge of computer science, in "Trends in Theoretical Computer Science" (E. Borger, Ed.), Computer Science Press, 1988.
21. N. Immerman, Languages which capture complexity classes, SIAM J. Computing 16, No. 4 (1987), 760-778.
22. D. S. Johnson, A catalog of complexity classes, in "Handbook of Theoretical Computer Science" (J. van Leewen, Ed.), Vol. 1, North-Holland, Amsterdam, 1990.
23. A. Kakas and P. Mancarella, Preferred extensions are partial stable models, J. Logic Programming 14 (1992), 341-348.
24. P. C. Kanellakis, Elements of relational database theory, in "Handbook of Theoretical Computer Science" (J. van Leewen, Ed.), Vol. 2, North-Holland, Amsterdam, 1991.
25. P. G. Kolaitis, The expressive power of stratified logics programs, Inform. and Comput. 90 (1991), 50-66.
26. P. G. Kolaitis and C. H. Papadimitriou, Why not negation by fixpoint?, J. Comput. System Sci. 43 (1991), 125-144.
27. N. Leone, M. Romeo, P. Rullo, and D. Saccà, Effective implementation of negation in database logic query languages, in "LOGIDATA +: Deductive Databases with Complex Objects" (P. Atzeni, Ed.), pp. 159-175, LNCS 701, Springer-Verlag, 1993.
28. J. W. Lloyd, "Foundations of Logic Programming," Springer-Verlag, Berlin, 1987.
29. W. Marek and M. Truszcynski, Autoepistemic logic, J. Assoc. Comput. Machin. 38, No. 3 (1991), 588-619.
30. A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential time, in "Proc. IEEE Symp. on Snitching and Automata Theory, 1972," pp. 125-129.
31. S. A. Naqvi, A logic for negation in database systems, in "Foundations of Deductive Databases and Logic Programming" (J. Minker, Ed.), Morgan Kaufman, Los Altos, 1987.
32. S. Naqvi and S. Tsur, "A Logical Data Language for Data and Knowledge Bases," Computer Science Press, New York, 1989.
33. C. Papadimitriou, A note on the expressive power of prolog, Bull. EATCS 26 (1985), 21-23.
34. C. Papadimitriou, "Computational Complexity," Addison-Wesley, Reading, MA, 1994.
35. C. H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. System Sci. 28, No. 2 (1982), 244-259.
36. T. C. Przymusinski, Well-founded semantics coincides with three-valued stable semantics, Foundament. Inform. 13 (1990), 445-463.
37. D. Saccà, Multiple total stable models are definitely needed to solve unique solution programs, Inform. Process. 58, No. 5 (1996), 249-254.
38. D. Saccà and C. Zaniolo, Stable models and non-determinism in logic programs with negation, in "Proc. ACM PODS Symp., 1990," pp. 205-218.
39. D. Saccà and C. Zaniolo, Partial models and three-valued models in logic programs with negation, in "Proc. 1st International Conference on Logic Programs and Non-monotonic Reasoning," pp. 87-104, MIT Press, Cambridge, 1991.
40. D. Saccà and C. Zaniolo, Deterministic and non-deterministic stable models, J. Logic Comput., to appear.
41. J. S. Schlipf, The expressive powers of the logic programming semantics, in "Proc. ACM PODS Symp., 1990," pp. 196-204.
42. J. S. Schlipf, A survey of complexity and undecidability results in logic programming," in "Proc. Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Washington, D.C., Nov. 1993," pp. 143-164.
43. J. D. Ullman, "Principles of Database and Knowledge Base Systems," Vois. 1 and 2, Computer Science Press, 1989.
44. J. Van de Bussche and D. Van Gucht, Semi-determinism, in "Proc. of ACM PODS Symp., 1992," pp. 191-201.
45. A. Van Gelder, Negation as failure using tight derivations for general logic programs, J. Logic Programming 6 (1989), 109-133.
46. A. Van Gelder, K. Ross, and J. S. Schlipf, The well-founded semantics for general logic programs, J. Assoc. Comput. Machin. 38 (1991), 620-650.
47. M. Y. Vardi, The complexity of relational query languages, in "Proc. ACM Symp. on Theory of Computing, 1982," pp. 137-146.
48. J. You and L. Y. Yuan, Three valued formalization of logic programming: Is it needed?, in "Proc. of ACM PODS Symp., 1990," pp. 172-182.
49. J. You and L. Y. Yuan, On the equivalence of semantics for normal logic programs, J. Logic Programming 22 (1995), 211-222.