{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:46Z","timestamp":1760202526839},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653059"},{"type":"electronic","value":"9783540494492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055505","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T05:43:53Z","timestamp":1153979033000},"page":"340-355","source":"Crossref","is-referenced-by-count":5,"title":["A practical approach to hypothetical database queries"],"prefix":"10.1007","author":[{"given":"Henning","family":"Christiansen","sequence":"first","affiliation":[]},{"given":"Troels","family":"Andreasen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"unstructured":"Andreasen, T., Christiansen, H. Counterfactual exceptions in deductive database queries. Proc. ECAI'96, 12th European Conference on Artificial Intelligence pp. 340\u2013344, 1996.","key":"12_CR1"},{"doi-asserted-by":"crossref","unstructured":"Andreasen, T., Christiansen, H., and Larsen, H.L., eds. Flexible Query-Answering Systems, Kluwer, to appear 1997.","key":"12_CR2","DOI":"10.1007\/978-1-4615-6075-3"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0743-1066(96)00107-0","volume":"33","author":"A.J. Bonner","year":"1997","unstructured":"Bonner, A.J. Intuitionistic Deductive Databases and the Polynomial Time Hierarchy. Journal of Logic Programming (JLP), 33(1):1\u201347,1997.","journal-title":"Journal of Logic Programming (JLP)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(90)90011-6","volume":"76","author":"A.J. Bonner","year":"1990","unstructured":"Bonner, A.J. Hypothetical Datalog: Complexity and Expressibility. Theoretical Computer Science (TCS), 76:3\u201351, 1990.","journal-title":"Theoretical Computer Science (TCS)"},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-56282-6_14","volume":"649","author":"H. Christiansen","year":"1992","unstructured":"Christiansen, H., A complete resolution method for logical meta-programming languages. Lecture Notes in Computer Science 649, pp. 205\u2013219, 1992.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Clark, K.L., Negation as failure. Logic and Data Bases, Gallaire, H., and Minker, J. (eds.), Plenum Press, pp. 293\u2013322, 1978.","key":"12_CR6","DOI":"10.1007\/978-1-4684-3384-5_11"},{"unstructured":"Enderton, H.B., A Mathematical Introduction to Logic. Academic Press, 1972.","key":"12_CR7"},{"doi-asserted-by":"crossref","unstructured":"Gabbay, D.M., Giordano, L., Martelli, A., and Olivetti, N.,. Hypothetical updates, priority and inconsistency in a logic programming language. Lecture Notes in Computer Science (LN in Artificial Intelligence) 928, Springer-Verlag, pp. 203\u2013216, 1995.","key":"12_CR8","DOI":"10.1007\/3-540-59487-6_15"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"2","author":"D.M. Gabbay","year":"1984","unstructured":"Gabbay, D.M. and Reyle, U., N-Prolog: An extension of Prolog with hypothetical implications. Journal of Logic Programming 2, pp. 319\u2013355, 1984.","journal-title":"Journal of Logic Programming"},{"unstructured":"G\u00e4rdenfors, P., Knowledge in the Flux: Modeling the Dynamics of Epistemic States, MIT Press, 1988.","key":"12_CR10"},{"unstructured":"Giordano, L. and Martelli, A., A modal reconstruction of blocks and modules in logic programming. International Logic Programming Symposium, 1991.","key":"12_CR11"},{"doi-asserted-by":"crossref","unstructured":"Giordano, L., Martelli, A., and Rossi, G., Extending Horn clause logic with implication goals. Theoretical Computer Science, 1991.","key":"12_CR12","DOI":"10.1016\/0304-3975(92)90066-O"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0004-3702(86)90067-6","volume":"30","author":"L.M. Ginsberg","year":"1986","unstructured":"Ginsberg, L.M., Counterfactuals. Artificial Intelligence 30, pp. 35\u201379, 1986.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1006\/inco.1995.1017","volume":"116","author":"G. Grahne","year":"1995","unstructured":"Grahne, G., Mendelzon, A., Updates and subjunctive queries. Information and computation 116(2), pp. 241\u2013252, 1995.","journal-title":"Information and computation"},{"doi-asserted-by":"crossref","unstructured":"Kakas, A. C., Kowalski, R., Toni,F., The Role of Abduction in Logic Programming, In: Handbook of Logic in Artificial Intelligence and Logic Programming 5, pages 235\u2013324, D.M. Gabbay, C.J. Hogger and J.A. Robinson eds., Oxford University Press, 1998).","key":"12_CR15","DOI":"10.1093\/oso\/9780198537922.003.0007"},{"key":"12_CR16","first-page":"569","volume":"74","author":"R.A. Kowalski","year":"1974","unstructured":"Kowalski, R.A., Predicate logic as a programming language. Information Processing 74, pp. 569\u2013574, 1974.","journal-title":"Information Processing"},{"unstructured":"Kowalski, R.A., and Sadri, F., Logic programming with exceptions. Proc. of Eighth International Conference on Logic Programming, MIT Press, pp. 598\u2013613, 1991.","key":"12_CR17"},{"unstructured":"Lewis, D, Counterfactuals. Harward University Press, 1973.","key":"12_CR18"},{"doi-asserted-by":"crossref","unstructured":"Lloyd, J.W., Foundations of logic programming, Second, extended edition. Springer-Verlag, 1987.","key":"12_CR19","DOI":"10.1007\/978-3-642-83189-8"},{"unstructured":"Miller, D., Lexical scoping as universal quantification, Proc. of Sixth International Conference on Logic Programming, MIT Press, pp. 268\u2013283, 1989.","key":"12_CR20"},{"unstructured":"Monteiro, L. and Porto, A., Contextual Logic Programming, Proc. of Sixth International Conference on Logic Programming, MIT Press, pp. 284\u2013302, 1989.","key":"12_CR21"},{"key":"12_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-16078-7_65","volume":"210","author":"M. A. Nait Abdallah","year":"1986","unstructured":"Nait Abdallah, M. A., Ions and local definitions in logic programming, Lecture Notes in Computer Science 210, pp. 60\u201372, Springer-Verlag, 1986.","journal-title":"Lecture Notes in Computer Science"},{"unstructured":"Pereira, L.M., Apar\u00edcio, J.N., and Alfares, J.J., Counterfactual reasoning based on revising assumptions. Logic Programming, Proceedings of the 1991 Internal Symposium, MIT Press 1991.","key":"12_CR23"},{"unstructured":"SICStus Prolog user's manual. Version 3 #6, SICS, Swedish Institute of Computer Science, 1997.","key":"12_CR24"},{"doi-asserted-by":"crossref","unstructured":"Winslett, M., Updating Logical Databases. Cambridge Tracts in Theoretical Computer Science, vol. 9, Cambridge University Press, 1990.","key":"12_CR25","DOI":"10.1017\/CBO9780511663109"}],"container-title":["Lecture Notes in Computer Science","Transactions and Change in Logic Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T11:28:36Z","timestamp":1627644516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653059","9783540494492"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0055505","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}