{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:58Z","timestamp":1725663118908},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540501718"},{"type":"electronic","value":"9783540459439"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-50171-1_9","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:17:10Z","timestamp":1330183030000},"page":"144-160","source":"Crossref","is-referenced-by-count":4,"title":["Hypothetical datalog: Complexity and expressibility"],"prefix":"10.1007","author":[{"given":"Anthony J.","family":"Bonner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu. A Transaction Language Complete for Database Update Specification. In Proceedings of the ACM Symposium on the Principles of Database Systems, pages 260\u2013268, 1987.","DOI":"10.1145\/28659.28688"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013148, Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. Van Emden. Contributions to the Theory of Logic Programming. Journal of the ACM, 29(3):841\u2013862, 1982.","journal-title":"Journal of the ACM"},{"key":"9_CR4","unstructured":"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."},{"key":"9_CR5","series-title":"Technical Report","volume-title":"Hypothetical Datalog: Complexity and Expressibility","author":"A.J. Bonner","year":"1988","unstructured":"A.J. Bonner. Hypothetical Datalog: Complexity and Expressibility. Technical Report DCS-TR-231, Department of Computer Science, Rutgers university, New Brunswick, NJ 08903, 1988."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"A.J. Bonner. Hypothetical Datalog: Complexity and Expressibility. In Proceedings of the Second International Conference on Database Theory, Bruges, Belgium, August 31-September 2 1988.","DOI":"10.1007\/3-540-50171-1_9"},{"key":"9_CR7","series-title":"Technical Report","volume-title":"A Logic for Hypothetical Reasoning","author":"A.J. Bonner","year":"1988","unstructured":"A.J. Bonner. A Logic for Hypothetical Reasoning. Technical Report DCS-TR-230, Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, 1988."},{"issue":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A.K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel. \u201cComputable Queries for Relational Databases\u201d. Journal of Computer and Systems Science, 21(2):156\u2013178, 1980.","journal-title":"Journal of Computer and Systems Science"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"A.K. Chandra and D. Harel. \u201cHorn Clauses and the Fixpoint Hierarchy\u201d. In Proceedings of the ACM Symposium on the Principles of Database Systems, pages 158\u2013163, 1982.","DOI":"10.1145\/588136.588137"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"A.K. Chandra and D. Harel. \u201cStructure and Complexity of Relational Queries\u201d. In Proceedings of the Symposium on the Foundations of Computer Science, pages 333\u2013347, 1980.","DOI":"10.1109\/SFCS.1980.41"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, D. Kozen, and L.J. Stockmeyer. \u201cAlternation\u201d. Journal of the ACM, 114\u2013133, 1981.","DOI":"10.1145\/322234.322243"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"A.K. Chandra and L.J. Stockmeyer. \u201cAlternation\u201d. In Proceedings of the Symposium on the Foundations of Computer Science, pages 98\u2013108, 1976.","DOI":"10.1109\/SFCS.1976.4"},{"key":"9_CR13","unstructured":"M.C. Fitting. Intuitionistic Logic, Model Theory and Forcing. North-Holland, 1969."},{"issue":"4","key":"9_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(85)80003-0","volume":"2","author":"D.M. Gabbay","year":"1985","unstructured":"D.M. Gabbay. \u201cN-Prolog: an Extension of Prolog with Hypothetical Implications. II. Logical Foundations and Negation as Failure\u201d. Journal of Logic Programming, 2(4):251\u2013283, 1985.","journal-title":"Journal of Logic Programming"},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"1","author":"D.M. Gabbay","year":"1984","unstructured":"D.M. Gabbay and U. Reyle. \u201cN-Prolog: an Extension of Prolog with Hypothetical Implications. I\u201d. Journal of Logic Programming, 1(4):319\u2013355, 1984.","journal-title":"Journal of Logic Programming"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"D. Harel. First-Order Dynamic Logic. Volume 68 of Lecture Notes in Computer Science, Springer Verlag, 1979.","DOI":"10.1007\/3-540-09237-4"},{"key":"9_CR17","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"N. Immerman. Relational Queries Computable in Polynomial Time. In Proceedings of the Symposium on the Foundations of Computer Science, pages 147\u2013152, 1982.","DOI":"10.1145\/800070.802187"},{"key":"9_CR19","unstructured":"R. Kowalski. Logic for Problem Solving. North-Holland, 1979."},{"issue":"3","key":"9_CR20","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"R.E. Ladner. The Computational Complexity of Provability in Systems of Propositional Modal Logic. SIAM Journal of Computing, 6(3):467\u2013480, 1977.","journal-title":"SIAM Journal of Computing"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"S. Manchanda and D.S. Warren. A Logic-based Language for Database Updates. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 10, pages 363\u2013394, Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50014-2"},{"issue":"1","key":"9_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(88)90005-2","volume":"5","author":"L.T. McCarty","year":"1988","unstructured":"L.T. McCarty. \u201cClausal Intuitionistic Logic. I. Fixed-Point Semantics\u201d. Journal of Logic Programming, 5(1):1\u201331, 1988.","journal-title":"Journal of Logic Programming"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"L.T. McCarty. Clausal Intuitionistic Logic. II. Tableau Proof Procedures. Journal of Logic Programming, 1988. To appear.","DOI":"10.1016\/0743-1066(88)90014-3"},{"key":"9_CR24","unstructured":"D. Miller. A Logical Analysis of Modules in Logic Programming. In Proceedings of the IEEE Symposium on Logic Programming, 1986."},{"issue":"1","key":"9_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R. Statman","year":"1979","unstructured":"R. Statman. Intuitionistic Propositional Logic is Polynomial-Space complete. Theoretical Computer Science, 9(1):67\u201372, 1979.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9_CR26","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M.H. Emden Van","year":"1976","unstructured":"M.H. Van Emden and R.A. Kowalski. The Semantics of Predicate Logic as a Programming Language. Journal of the ACM, 23(4):733\u2013742, 1976.","journal-title":"Journal of the ACM"},{"key":"9_CR27","unstructured":"M. Vardi. Relational Queries Computable in Polynomial Time. In Proceedings of the Symposium on the Foundations of Computer Science, pages 137\u2013145, 1982."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"M. Vardi. The Complexity of Relational Query Languages. In Proceedings of the ACM Symposium on the Principles of Database Systems, pages 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"},{"key":"9_CR29","unstructured":"D.S. Warren. Database Updates in Pure Prolog. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 244\u2013253, 1984."}],"container-title":["Lecture Notes in Computer Science","ICDT '88"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50171-1_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:17:33Z","timestamp":1605629853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50171-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540501718","9783540459439"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-50171-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}