Hypothetical datalog: Complexity and expressibility

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 326 LNCS, Issue , 1988, Pages 144-160

  Bonner, Anthony J ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT DATABASES; LOGIC PROGRAMMING; QUERY LANGUAGES; QUERY PROCESSING;

DATABASE QUERIES; DATALOG; EXPRESSIBILITY; EXPTIME; HORN CLAUSE; ITS DATA; RELATIONAL DATABASE;

COMPUTER CIRCUITS;

EID: 85034806847     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-50171-1_9     Document Type: Conference Paper

References (29)

1. S. Abiteboul and V. Vianu. A Transaction Language Complete for Database Update Specification. In Proceedings of the A CM Symposium on the Principles of Database Systems, pages 260-268, 1987.
2. K.R. Apt, H.A. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 2, pages 89-148, Morgan Kaufmann, 1988.
3. K.R. Apt and M.H. Van Emden. Contributions to the Theory of Logic Programming. Journal of the ACM, 29(3):841-862, 1982.
4. A.J. Bonner. A Logic for Hypothetical Reasoning. In Proceedings of the Seventh National Conference on Artificial Intelligence, American Association for Artificial Intelligence, August 1988.
5. A.J. Bonner. Hypothetical Datalog: Complexity and Expressibility. Technical Report DCS-TR-231, Department of Computer Science, Rutgers university, New Brunswick, NJ 089031 1988.
6. A.J. Bonner. Hypothetical Data.log: Complexity and Expressibility. In Proceedings of the Second International Conference on Database Theory, Bruges, Belgium, August 31-September 2 1988.
7. A.J. Bonner. A Logic for Hypothetical Reasoning. Technical Report DCS-TR-230, Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, 1988.
8. A.K. Chandra and D. Harel. “Computable Queries for Relational Databases”. Journal of Computer and Systems Science, 21(2):156-178, 1980.
9. A.K. Chandra and D. Harel. “Horn Clauses and the Fixpoint Hierarchy”. In Proceedings of the ACM Symposium on the Principle of Database Systems, pages 158-163, 1982.
10. A.K. Chandra and D. Harel. “Structure and Complexity of Relational Queries”. In Proceedings of the Symposium on the Foundations of Computer Science, pages 333-347, 1980.
11. A.K. Chandra, D. Kozen, and L.J. Stockmeyer. “Alternation”. Journal of the ACM, 114-133, 1981.
12. A.K. Chandra and L.J. Stockmeyer. “Alternation”. In Proceedings of the Symposium on the Foundations of Computer Science, pages 98-108, 1976.
13. M.C. Fitting. Intuitionistic Logic, Model Theory and Forcing. North-Holland, 1969.
14. D.M. Gabbay. “N-Prolog: an Extension of Prolog with Hypothetical Implications. II. Logical Foundations and Negation as Failure”. Journal of Logic Programming, 2(4):251-283, 1985.
15. D.M. Gabbay and U. Reyle. “N-Prolog: an Extension of Prolog with Hypothetical Implications. I”. Journal of Logic Programming, 1(4):319-355, 1984.
16. D. Harel. First-Order Dynamic Logic. Volume 68 of Lecture Notes in Computer Science, Springer Verlag, 1979.
17. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
18. N. Immerman. Relational Queries Computable in Polynomial Time. In Proceedings of the Symposium on the Foundations of Computer Science, pages 147-152, 1982.
19. R. Kowalski. Logic for Problem Solving. North­ Holland, 1979.
20. R.E. Ladner. The Computational Complexity of Provability in Systems of Propositional Modal Logic. SIAM Journal of Computing, 6(3):467-480, 1977.
21. S. Manchanda and D.S. Warren. A Logic-based Language for Database Updates. In Jack Minker, editor, Foundations of Deductive Database and Logic Programming, chapter 10, pages 363-394, Morgan Kaufmann, 1988.
22. L.T. McCarty. “Clausal Intuitionistic Logic. I. Fixed-Point Semantics”. Journal of Logic Programming, 5(1):1-31, 1988.
23. L.T. McCarty. Clausal Intuitionistic Logic. II. Tableau Proof Procedures. Journal of Logic Programming, 1988. To appear.
24. D. Miller. A Logical Analysis of Modules in Logic Programming. In Proceedings of the IEEE Symposium on Logic Programming, 1986.
25. R. Statman. Intuitionistic Propositional Logic is Polynomial-Space complete. Theoretical Computer Science, 9(1):67-72, 1979.
26. M.H. Van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, 3(4):733-742, 1976.
27. M. Vardi. Relational Queri putable in Polynomial Time. In Proceedings of the Symposium on the Foundations of Computer Science, pages 137-145, 1982.
28. M. Vardi. The Complexity of Relational Query Languages. In Proceedings of the ACM Symposium on the Principles of Database Systems, pages 137-146, 1982.
29. D.S. Warren. Database Updates in Pure Prolog. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 244- 253, 1984.