On the complexity of data disjunctions

Theoretical Computer Science

Volumn 288, Issue 1, 2002, Pages 101-128

  Eiter, Thomas ^a   Veith, Helmut ^a  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complexity upgrading; Computational complexity; Conversion lemma; Data disjunction; Deductive databases

Indexed keywords

DATA REDUCTION; DATABASE SYSTEMS; DECISION THEORY; THEOREM PROVING;

DISJUNCTIVE DEDUCTIVE DATABASES (DDDB);

COMPUTATIONAL COMPLEXITY;

EID: 0037048576     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00147-5     Document Type: Conference Paper

References (46)

1. Abiteboul S., Hull R., Vianu V. Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. V. Arvind, J. Torán, Sparse sets, approximable sets, and parallel queries to NP, in: C. Meinel, S. Tison (Eds.), Proc. 16th Symp. on Theoretical Aspects of Computing (STACS '99), Lecture Notes in Computer Science, Vol, 1563, Trier, March 1999, Springer, Berlin, pp. 281-290.
3. J. Balcázar, A. Lozano, J. Torán, The complexity of algorithmic problems on succinct instances, in: R. Baeta-Yates, U. Manber, Computer Science. Plenum Press, New York, 1992;351-377.
4. R. Beigel, NP-hard sets are P-superterse unless R=NP, Tech. Report TR4, CS Dept., Johns Hopkins University, 1988.
5. Bonatti P. Autoepistemic logics as a unifying framework for the semantics of logic programs. J. Logic Program. 22 (1995) 91-149.
6. P.A. Bonatti, T. Eiter, Querying disjunctive databases through nonmonotonic logics. Theoret. Comput. Sci. 160 (1996) 321-363.
7. B. Borchert, A. Lozano, Succinct circuit representations and leaf languages are basically the same concept. Inform. Process. Lett. 58 (1996) 211-215.
8. H. Buhrmann, L. Fortnow, L. Torenvliet, Six hypotheses in search of a theorem, in: Proc. 12th IEEE Internat. Conf. on Computational Complexity (CCC '97), 1997, pp. 2-12.
9. S. Buss, L. Hay, On truth-table reducibility to SAT. Inform. Comput. 91 (1991) 86-102.
10. M. Cadoli, M. Lenzerini, The complexity of propositional closed world reasoning and circumscription. J. Comput. System Sci. 43 (1994) 165-211.
11. J. Dix, Semantics of logic programs: their intuitions and formal properties. An overview. Fuhrmann, Rott H. Logic, Action and Information. Proc. Konstanz Coll. in Logic and Information (LogIn'92). DeGruyter, Berlin, 1995, pp. 241-329.
12. P-complete, Theoret. Comput. Sci. 114(2) (1993) 231-245, Addendum 118, 315.
13. P: recent results and applications in AI and modal logic, in: B. Chlebus, L. Czaja (Eds.), Proc. 11th Internat. Symp. on Fundamentals of Computation Theory (FCT '97). Lecture Notes in Computer Science. Vol. 1279 Springer, Berlin, (1997) pp. 1-18.
14. T. Eiter, G. Gottlob, Y. Gurevich, Normal forms for second-order logic over finite structures, and classification of NP optimization problems. Ann. Pure Appl. Logic. 78 (1996) 111-125.
15. T. Eiter, G. Gottlob, H. Mannila, Disjunctive datalog. ACM Trans. Database Systems. 22 (3) (1997) (364-417).
16. Z.K.J. Fernández, J. Minker, A tractable class of disjunctive deductive databases, in: Proc. Workshop on Deductive Databases, JICSLP-92, Washington, DC, 1992. Tech. Report CITRI/TR-92-65, CS Dept, Univ. Melbourne, pp. 11-20.
17. M. Genesereth, N. Nilsson, Logical Foundations of Artificial Intelligence, Morgan Kaufmann, Los Altos, CA, 1987.
18. G. Gottlob, Relativized logspace and generalized quantifiers over ordered finite structures. J. Symbolic Logic. 62 (2) (1997) 545-574.
19. Gottlob G., Leone N., Veith H. Succinctness as a source of complexity in logical formalisms. Ann. Pure Appl. Logic. 97 (1999) 231-260.
20. H. Hwang, A. Fu, H.-F. Leung, Data-disjunctive deductive databases, manuscript, 1997.
21. Complexity of query processing in databases with OR-objects, in: Proc. 8th ACmSIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989, pp. 51-65.
22. Jenner B., Toran J. Computing functions with parallel queries to NP. Theoret. Comput. Sci. 141 (1995) 175-193.
23. M. Karpinski, K. Wagner, The computational complexity of graph problems with succinct multigraph representation, Z. Oper. Res. (ZOR). 32 (1998) 201-211.
24. P. Kolaitis, C.H. Papadimitriou, Why not negation by fixpoint? J. Comput. System Sci. 43 (1991) 125-144.
25. M. Kowaluk, K. Wagner, Vector language: simple descriptions of hard instances, in: Mathematical Foundations of Computer Science (MFCS), Lecture Notes in Computer Science, Vol. 452, Springer, Berlin, 1992, pp. 378-384.
26. M. Krentel, The complexity of optimization problems, J. Computer System Sci. 36 (1988) 490-509.
27. R. Ladner, N. Lynch, Relativization questions about logspace computability, Math. Systems Theory. 10 (1976) 19-32.
28. R. Ladner, N. Lynch, A. Selman, Comparison of polynomial-time reducibilities, Theoret. Computer Sci. 1 (1975) 103-123.
29. V. Lifschitz, Computing circumscription, in: Proc. Internat. Joint Conf. on Artificial Intelligence (IJCAI-85) 1985, pp. 121-127.
30. J. Lloyd, Foundations of Logic Programming, Springer, Berlin, 1984, 1987.
31. J. Lobo, J. Minker, A. Rajasekar, Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
32. A. Lozano, J. Balcázar, The complexity of graph problems for succinctly represented graphs, in: Proc. 15th Internat. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Vol. 411 Castle Rolduc, The Netherlands, 1989, pp. 277-286.
33. J. Minker, On indefinite data bases and the closed world assumption, in: D. Loveland (Ed.), Proc. 6th Conf. on Automated Deduction (CADE '82), Lecture Notes in Computer Science, Vol. 138, New York, Springer, Berlin, 1982, pp. 292-308.
34. J. Minker, Logic and databases: a 20 year retrospective, in: Proc. Internat. Workshop on Logic in Databases (LID '96), Lecture Notes in Computer Science, Vol. 1154 Springer, Berlin, 1996, pp. 3-57.
35. J. Minker, D. Perlis, Computing protected circumscription, J. Logic Program. 2 (4) (1985) 235-249.
36. C. Papadimitriou, M. Yannakakis, A note on succinct representations of graphs, Inform. Comput. 71 (1985) 181-185.
37. R. Reiter, On closed-world databases, H., Gallaire, J. Minker (Eds.), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55-76
38. A. Selman, A taxonomy of complexity classes of functions, J. Comput. System Sci. 48 (1994) 357-381.
39. I. Stewart, Logical characterizations of bounded query classes I: logspace oracle machines, Fund. Inform. 18 (1993) 65-92.
40. I. Stewart, Logical characterizations of bounded query classes II: polynomial-time oracle machines, Fund. Inform. 18 (1993) 93-105.
41. S. Toda, On polynomial-time truth-reducibilities of intractable sets to P-selective sets, Math. Systems Theory. 24 (1991) 69-82.
42. M. Vardi, Complexity of relational query languages, in: Proc. 14th STOC, San Francisco, 1982, pp. 137-146.
43. H. Veith, Languages represented by Boolean formulas, Inform. Process. Lett. 63 (1997) 251-256.
44. H. Veith, How to encode a logical structure by an OBDD, in: 13th Ann. IEEE Conf. on Computational Complexity (CCC), 1998, pp. 122-131.
45. H. Veith, Succinct representation, leaf languages, and projection reductions, Inform. Comput. 142 (2) (1998) 207-236.
46. K. Wagner, Bounded query classes, SIAM J. Comput. 19 (5) (1990) 833-846.