Querying disjunctive databases through nonmonotonic logics

Theoretical Computer Science

Volumn 160, Issue 1-2, 1996, Pages 321-363

  Bonatti, Piero A ^a   Eiter, Thomas ^b  

^a UNIVERSITY OF TURIN   (Italy)

^b INSTITUTE FOR MICROELECTRONICS   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; DATA STRUCTURES; DATABASE SYSTEMS; INFORMATION RETRIEVAL; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; QUERY LANGUAGES;

AUTOEPISTEMIC LOGIC; BOOLEAN QUERIES; DEFAULT LOGIC; DISJUNCTIVE DATABASES; NONMONOTONIC LOGICS; SEMANTICS;

FORMAL LOGIC;

EID: 0030164857     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00192-1     Document Type: Article

References (40)

1. S. Abiteboul, P. Kanellakis and G. Grahne, On the representation and querying of sets of possible worlds, Theoret. Comput. Sci. 78 (1991) 159-187.
2. S. Abiteboul and V. Vianu, Expressive power of query languages, in: J. Ullman, ed., Theoretical Studies in Computer Science (Academic Press, New York, 1992). Festschrift in Honour of Seymour Ginsburg's 64th Birthday.
3. P. Bonatti, Autoepistemic logic programming, J. Automat. Reasoning 13 (1994) 35-67.
4. P. Bonatti, Autoepistemic logics as a unifying framework for the semantics of logic programs. J. Logic Programming 22 (1995) 91-149.
5. M. Cadoli, T. Eiter and G. Gottlob, Using default logic as a query language, in: Proc. 4th Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-94) (1994) 99-108.
6. A.K. Chandra, Theory of database queries, in: Proc. PODS-88 (1988).
7. A. Chandra and D. Harel, Horn clause queries and generalizations, Journal of Logic Programming 2 (1985) 1-15.
8. T. Eiter, G. Gottlob and H. Mannila, Adding disjunction to datalog, in: Proc. 13th ACM SIGACT SIGMOD-SIGART Symp. on Principles of Database Systems (PODS-94) (1994) 267-278.
9. D.W. Etherington, Reasoning with Incomplete Information (Morgan Kaufmann, Los Altos, 1988).
10. R. Fagin and J.D. Ullman, On the semantics of updates in databases, in: Proc. of PODS-83 (1983) 352-365.
11. [11[ J- Fernández and J. Minker, Semantics of disjunctive deductive databases, in: Proc. ICDT-92, Berlin (1992) 21-50.
12. M. Gelfond and V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Generation Comput. 9 (1991) 365-385.
13. G. Gottlob, Complexity results for nonmonotonic logics. J. Logic Comput., 2 (1992) 397-425.
14. G. Grahne, The Problem of Incomplete Information in Relational Databases, Lecture Notes in Computer Science, Vol. 554 (Springer, Berlin, 1991).
15. G. Grahne, Updates and counterfactuals, in: Proc. 2nd Internat. Conf. on Principles of Knowledge Representation and Reasoning (KR-91), (1991) 269-276.
16. S. Greco, D. Saccà and C. Zaniolo, DATALOG queries with stratified negation and choice, in: Proc. 5th Internat. Conf. on Database Theory (ICDT'95), Lecture Notes in Computer Science, Vol. 893 (Springer, Berlin, 1995) 82-96.
17. Y. Gurevich, Logic and the challenge of computer science, in: E. Börger, ed., Trends in Theoretical Computer Science Ch. 1 (Computer Science Press, Rockville, MD, 1988).
18. N. Immerman, Languages that capture complexity classes. SIAM J. Comput. 16 (1987) 760-778.
19. D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets, Inform. Processing Lett. 27 (1988) 119-123.
20. P. Kanellakis, Elements of relational database theory, in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. B, Ch. 17 (Elsevier, Amsterdam, 1990).
21. H. Kautz and B. Selman, Hard problems for simple default logics, Artif. Intelligence 49 (1991) 243-279.
22. P. Kolaitis and M. Vardi, On the expressive power of datalog: tools and a case study, in: Proc. PODS-90 (1990) 61-71.
23. K. Konolige, On the relationship between default and autoepistemic logic, Artif. Intelligence 35 (1988) 343-382, + Errata, same journal, 41 (1989/90) 115.
24. K. Konolige, On the relation between autoepistemic logic and circumscription, in: Proc. IJCAI-89 (1989).
25. H. Levesque, All i know: A study in autoepistemic logic, Artif. Intelligence 42 (1990) 263-309.
26. J. Lobo, J. Minker and A. Rajasekar, Foundations of Disjunctive Logic Programming (MIT Press, Cambridge, MA, 1992).
27. W. Lukasiewicz, Non-Monotonic Reasoning (Ellis Horwood, Chichester, England, 1990).
28. W. Marek and M. Truszczyński, Autoepistemic logic, J. ACM 38 (1991) 588-619.
29. W. Marek and M. Truszczyński, Nonmonotonic Logics - Context-Dependent Reasoning (Springer, Berlin, 1993).
30. R. Moore, Semantical considerations on nonmonotonic logics, Artif. Intelligence 25 (1985) 75-94.
31. T. Przymusinski, On the declarative and procedural semantics of stratified deductive databases, in: J. Minker, ed., Foundations of Deductive Databases and Logic Programming (Morgan Kaufman, Washington, DC, 1988) 193-216.
32. T. Przymusinski, Stable semantics for disjunctive programs, New Generation Comput. 9 (1991) 401-424.
33. T. Przymusinski, Three-valued nonmonotonic formalisms and semantics of logic programming, Artif. Intelligence 49 (1991) 309-344.
34. R. Reiter, A logic for default reasoning, Artif. Intelligence 13 (1980) 81-132.
35. J. Schlipf, The expressive powers of logic programming semantics, Tech. Report CIS-TR-90-3, Computer Science Department, University of Cincinnati, 1990. Preliminary version in Proc. PODS-90 (1990) 196-204. To appear in J. Comput. System Sci.
36. J. Stillman, The complexity of propositional default logic, in: Proc. AAAI-92 (1992) 794-799.
37. L. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.
38. M. Vardi, Complexity of relational query languages, in: Proc. 14th STOC (1982) 137-146.
39. M. Vardi, Querying logical databases, J. Comput. and System Sci. 33 (1986) 142-160.
40. M. Winslett, Updating Logical Databases (Cambridge Univ. Press, Cambridge, 1990).