Multiple total stable models are definitely needed to solve unique solution problems

Information Processing Letters

Volumn 58, Issue 5, 1996, Pages 249-254

  Saccà, Domenico ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Complexity class; DATALOGE; Expressive power; Logic programming; Relational database; Stable model; Unique and critical SAT

Indexed keywords

EID: 0007030639     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00067-1     Document Type: Article

References (22)

1. S. Abitebou, E. Simon and V. Vianu, Non-deterministic languages to express deterministic transformations, in: Proc. ACM PODS Symp. (1990) 218-229.
2. S. Abiteboul, R. Hull and V. Vianu, Foundations of Databases (Addison-Wesley, Reading, MA, 1994).
3. A. Blass and Y. Gurevich, On the Unique Satisfiability Problem, Inform. and Control 55 (1982) 80-88.
4. S. Ceri, G. Gottlob and L. Tanca, Logic Programming and Databases (Springer, Berlin, 1990).
5. A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
6. T. Eiter, G. Gottlob and H. Manila, Expressive power and complexity of disjunctive DATALOG, in: Proc. ACM PODS Symp., Minneapolis, MN (1994) 267-278.
7. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R. Karp, ed., Complexity of Computation, SIAM-AMS Proc. 7 (1974) 43-73.
8. M. Garey and D.S. Johnson, Computers and intractability -A Guide to the Theory of NP-Completeness (W.H. Freeman, New York, 1979).
9. M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, in: Proc. 5th Internat. Conf. Symp. on Logic Programming (MIT Press, Cambridge, MA, 1988) 1070-1080.
10. N. Immerman, Languages which capture complexity classes, SIAM J. Comput. 16 (1987) 760-778.
11. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. 1 (Elsevier, Amsterdam, 1990).
12. P.C. Kanellakis, Elements of relational database theory, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. 2 (Elsevier, Amsterdam, 1991).
13. P.G. Kolaitis and C.H. Papadimitriou, Why not negation by fixpoint?, J. Comput. System Sci. 43 (1991) 125-144.
14. J.W. Lloyd, Foundations of Logic Programming (Springer, Berlin, 1987).
15. W. Marek and M. Truszcynski, Autoepistemic logic, J. ACM 38 (1991) 588-619.
16. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
17. C.H. Papadimitriou and M. Yannakakis, The complexity of facets (and some facets of complexity), J. Comput. System Sci. 28 (1982) 244-259.
18. D. Saccà, The expressive powers of stable models for bound and unbound DATALOG queries, submitted for publication, 1994; extended abstract in: Proc. Internat. Conf. on Database Theory, Lecture Notes on Computer Science 893 (Springer, Berlin, 1995) 353-367.
19. [ 19] J.S. Schlipf, The expressive powers of the logic programming semantics, in: Proc. ACM PODS Symp. (1990) 196-204.
20. 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, DC (1993) 143-164.
21. J.D. Ullman, Principles of Database and Knowledge Base Systems, Vols. 1 and 2 (Computer Science Press, Rockville, MD, 1989).
22. M.Y. Vardi, The complexity of relational query languages, in: Proc. ACM Symp. on Theory of Computing (1982) 137-146.