Hypothetical Datalog: Complexity and Expressiblity.

@inproceedings{DBLP:conf/icdt/Bonner88,
  author    = {Anthony J. Bonner},
  editor    = {Marc Gyssens and
               Jan Paredaens and
               Dirk Van Gucht},
  title     = {Hypothetical Datalog: Complexity and Expressiblity},
  booktitle = {ICDT'88, 2nd International Conference on Database Theory, Bruges,
               Belgium, August 31 - September 2, 1988, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {326},
  year      = {1988},
  isbn      = {3-540-50171-1},
  pages     = {144-160},
  ee        = {db/conf/icdt/Bonner88.html},
  crossref  = {DBLP:conf/icdt/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An2-2 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Journal Version

References

[1]

Serge Abiteboul, Victor Vianu: A Transcation Language Complete for Database Update and Specification. PODS 1987: 260-268 BibTeX

[2]

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148 BibTeX

[3]

Krzysztof R. Apt, Maarten H. van Emden: Contributions to the Theory of Logic Programming. J. ACM 29(3): 841-862(1982) BibTeX

[4]

Anthony J. Bonner: A Logic for Hypothetical Reasoning. AAAI 1988: 480-484 BibTeX

[5]

Anthony J. Bonner: Hypothetical Datalog: Complexity and Expressibility. Theor. Comput. Sci. 76(1): 3-51(1990) BibTeX

[6]

Anthony J. Bonner: Hypothetical Datalog: Complexity and Expressiblity. ICDT 1988: 144-160 BibTeX

[7]

...

[8]

Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178(1980) BibTeX

[9]

Ashok K. Chandra, David Harel: Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982: 158-163 BibTeX

[10]

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. FOCS 1980: 333-347 BibTeX

[11]

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer: Alternation. J. ACM 28(1): 114-133(1981) BibTeX

[12]

Ashok K. Chandra, Larry J. Stockmeyer: Alternation. FOCS 1976: 98-108 BibTeX

[13]

...

[14]

Dov M. Gabbay: N-Prolog: An Extension of Prolog with Hypothetical Implication II - Logical Foundations, and Negation as Failure. J. Log. Program. 2(4): 251-283(1985) BibTeX

[15]

Dov M. Gabbay, Uwe Reyle: N-Prolog: An Extension of Prolog with Hypothetical Implications I. J. Log. Program. 1(4): 319-355(1984) BibTeX

[16]

...

[17]

John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X
BibTeX

[18]

Neil Immerman: Relational Queries Computable in Polynomial Time (Extended Abstract). STOC 1982: 147-152 BibTeX

[19]

...

[20]

Richard E. Ladner: The Computational Complexity of Provability in Systems of Modal Propositional Logic. SIAM J. Comput. 6(3): 467-480(1977) BibTeX

[21]

Sanjay Manchanda, David Scott Warren: A Logic-based Language for Database Updates. Foundations of Deductive Databases and Logic Programming. 1988: 363-394 BibTeX

[22]

L. Thorne McCarty: Clausal Intuitionistic Logic I - Fixed-Point Semantics. J. Log. Program. 5(1): 1-31(1988) BibTeX

[23]

L. Thorne McCarty: Clausal Intuitionistic Logic II - Tableau Proof Procedures. J. Log. Program. 5(2): 93-132(1988) BibTeX

[24]

Dale Miller: A Theory of Modules for Logic Programming. SLP 1986: 106-114 BibTeX

[25]

Richard Statman: Intuitionistic Propositional Logic is Polynomial-Space Complete. Theor. Comput. Sci. 9: 67-72(1979) BibTeX

[26]

Maarten H. van Emden, Robert A. Kowalski: The Semantics of Predicate Logic as a Programming Language. J. ACM 23(4): 733-742(1976) BibTeX

[27]

...

[28]

Moshe Y. Vardi: The Complexity of Relational Query Languages (Extended Abstract). STOC 1982: 137-146 BibTeX

[29]

David Scott Warren: Database Updates in Pure Prolog. FGCS 1984: 244-253 BibTeX

Referenced by

1. Gösta Grahne, Alberto O. Mendelzon, Peter Z. Revesz: Knowledgebase Transformations. PODS 1992: 246-260
2. Sanjay Manchanda: Declarative Expression of Deductive Database Updates. PODS 1989: 93-100
3. Anthony J. Bonner: Hypothetical Datalog: Negation and Linear Recursion. PODS 1989: 286-300
4. Anthony J. Bonner: Hypothetical Datalog: Complexity and Expressiblity. ICDT 1988: 144-160