More on tractable disjunctive Datalog

Journal of Logic Programming

Volumn 46, Issue 1, 2000, Pages 61-101

  Ben Eliyahu Zohary, Rachel ^a   Palopoli, Luigi ^b   Zemlyanker, Victoria ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF CALABRIA   (Italy)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; FORMAL LOGIC; POLYNOMIALS; QUERY LANGUAGES; RELATIONAL DATABASE SYSTEMS; SET THEORY;

HEAD CYCLE FREE PROGRAMS; NONDETERMINISTIC SEMANTICS; POLYNOMIAL TIME QUERIES; STRATIFIED DISJUNCTIVE DATALOG; TRACTABLE DISJUNCTIVE DATALOG;

LOGIC PROGRAMMING;

EID: 0034325673     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00066-7     Document Type: Article

References (40)

1. S. Abiteboul, R. Hull, V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1994.
2. S. Abiteboul, E. Simon, V. Vianu, Non-deterministic languages to express deterministic transformations, Proc. ACM PODS (1990) 218-229.
3. S. Abiteboul, V. Vianu, Non-determinism in logic-based languages, Annals on Mathematics and AI 3 (II-IV) (1991).
4. M. Baudinet, J. Chomicki, P. Wolper, Temporal deductive databases, in: Tansel et al. (Eds.), Temporal Databases: Theory, Design and Implementation, Benjamin/Cummings, Menlo Park, CA, 1993.
5. R. Ben-Eliyahu, R. Dechter, Prepositional semantics for disjunctive logic programs, Annals of Mathematics and Artificial Intelligence 12 (I-II) (1994) 53-87.
6. R. Ben-Eliyahu, L. Palopoli, Reasoning with minimal models: efficient algorithms and applications, Artificial Intelligence 96 (2) (1997) 421-449.
7. M. Cadoli, On the complexity of model finding for non-monotonic prepositional logics, in: Proceedings of the Fourth Italian Conference on Theoretical Computer Science, World Scientific, Singapore, 1992, pp. 125-139.
8. M. Cadoli, M. Lenzerini, The complexity of closed world reasoning, Journal of Computer and System Science 48 (1994) 255-310.
9. A. Chandra, D. Harel, Computable queries for relational databases, Journal of Computer and System Science 21 (1980) 156-178.
10. A. Chandra, D. Harel, Structure and complexity of relational queries, Journal of Computer and System Science 25 (1982) 99-128.
11. A. Chandra, D. Harel, Horn clause queries and generalizations, Journal of Logic Programming 2 (1) (1985) 1-15.
12. J. Chomicki, Polynomial time query processing in temporal deductive databases, Proc. ACM PODS (1990) 379-391.
13. E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of Logic Programming, in: Proceedings of the 12th IEEE Conference on Computational Complexity, Ulm, 1997.
14. J. Dix, Semantics of logic programs: their intuitions and formal properties. An overview, in: Logic Action and Information, Proceedings of the Konstanz Colloquium in Logic and Information, DeGruyter, Berlin, 1992, pp. 241-329.
15. T. Eiter, G. Gottlob, On the computational cost of disjunctive logic programming: prepositional case, Annals of Mathematics and Artificial Intelligence 15 (1995) 289-323.
16. T. Eiter, G. Gottlob, H. Mannila, Disjunctive datalog, ACM Transactions on Database Systems 22 (3) (1997) 315-363.
17. T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, The KR system dlv: Progress Report, Comparisons and Benchmarks, in: KR-98: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 1998, pp. 406-417.
18. T. Eiter, N. Leone, D. Saccá, The expressive power of partial stable model semantics, Theoretical Computer Science 206 (1-2) (1998) 181-218.
19. R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, AMS, 1974, pp. 43-74.
20. M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases, New Generation Computing 9 (1991) 365-385.
21. F. Giannotti, D. Pedreschi, D. Saccá, C. Zaniolo, Non-determinism in deductive databases, in: Proceedings of the Second International Conference on Deductive and Object Oriented Databases, 1991, pp. 129-146.
22. G. Gottlob, Complexity and expressive power of disjunctive logic programming, Invited paper, Proc. ICLP, 1994.
23. N. Immerman, Relational queries computable in polynomial time, Information and Control 68 (1986) 86-104.
24. N. Immerman, Languages that capture complexity classes, SIAM Journal on Computing 16 (1987) 760-778.
25. D.S. Johnson, A catalog of complexity classes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pp. 67-162.
26. P. Kolaitis, On the expressive power of stratified logic programs, Information and Computation 90 (1991) 50-66.
27. C. Koch, N. Leone, Stable model checking made easy, proc. IJCAI, 1999, pp. 70-75.
28. J. Lobo, J. Minker, A. Rajasekar, Foundations of disjunctive logic programming, MIT Press, Cambridge, MA, 1992.
29. J. Minker, On indefinite databases and the closed world assumption, Proceedings of the 6th CADE, LNCS 138, Springer Verlag, Berlin, 1982, pp. 292-308.
30. C. Papadimitriou, A note on the expressive power of Prolog, Bulletin of the EATCS 26 (1985) 21-23.
31. T. Przymusinski, On the declarative semantics of deductive databases and logic programs, in: Jack Minker (Ed.), Foundations of Deductive Databases and Logic Programs, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
32. T. Przymusinski, Stable model semantics for disjunctive programs, New generation computing 9 (1991) 401-424.
33. J.S. Schlipf, The expressive powers of logic programming semantics, Journal of Computer and System Science 51 (1) (1995) 64-86.
34. O. Shmueli, Decidability adn expressiveness aspects of logic queries, Proc. ACM PODS (1987) 237-249.
35. Robert Tarjan, Depth-first search and linear graph algorithms, SIAM Journal on Computing 1 (1972) 146-160.
36. J. Ullman, Database and Knowledge base systems, Computer Science Press, Rockville, MD, 1988.
37. A. Van Gelder, The alternating fixpoint of logic programs with negation, Journal of Computer and System Science 47 (1993) 185-221.
38. A. Van Gelder, K.A. Ross, J.S. Schlipf, The well-founded semantics for general logic programs, Journal of the ACM 38 (3) (1991) 620-650.
39. M. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM STOC, 1982pp. 137-146.
40. C. Zaniolo, N. Ami, K. Ong, Negation and aggregates in recursive rules: the LDL++ approach, in: Proceedings of the Third International Conference on Deductive and Object Oriented Databases, 1993, pp. 204-221.