{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:08:01Z","timestamp":1676945281544},"reference-count":91,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5380,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1016\/s0004-3702(98)00092-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"1-75","source":"Crossref","is-referenced-by-count":5,"title":["Prolog technology for default reasoning: proof theory and compilation techniques"],"prefix":"10.1016","volume":"106","author":[{"given":"Torsten","family":"Schaub","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Br\u00fcning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00092-7_BIB1","series-title":"Warren's Abstract Machine: A Tutorial Reconstruction","author":"Ait-Kaci","year":"1991"},{"issue":"2","key":"10.1016\/S0004-3702(98)00092-7_BIB2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1093\/logcom\/6.2.205","article-title":"A proof theoretical approach to default reasoning I. Tableaux for default logic","volume":"6","author":"Amati","year":"1996","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB3","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a theory of declarative knowledge","author":"Apt","year":"1987"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB4","series-title":"Proceedings Conference on Automated Deduction","first-page":"224","article-title":"Caching and lemmaizing in model elimination theorem provers","volume":"Vol. 607","author":"Astrachan","year":"1992"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB5","series-title":"Proceedings 3rd International Conference on the Principles of Knowledge Representation and Reasoning","first-page":"306","article-title":"Embedding defaults into terminological knowledge representation formalisms","author":"Baader","year":"1992"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB6","series-title":"Proceedings International Joint Conference on Artificial Intelligence (UCAI-89)","first-page":"463","article-title":"A theorem prover for prioritized circumscription","author":"Baker","year":"1989"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB7","series-title":"Proceedings Conference on Automated Deduction","first-page":"87","article-title":"Model ehmination without contrapositives","volume":"Vol. 814","author":"Baumgartner","year":"1994"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB8","article-title":"Model elimination without contrapositives and its application to PTTP","author":"Baumgartner","year":"1994","journal-title":"Preprints Tableaux-94"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB9","series-title":"Proceedings Conference on Automated Deduction","first-page":"769","article-title":"PROTEIN: a PROver with a Theory Extension INterface","volume":"Vol. 814","author":"Baumgartner","year":"1994"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB10","series-title":"A Course in Mathematical Logic","author":"Bell","year":"1977"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB11","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-91)","first-page":"370","article-title":"Default logic, propositional logic and constraints","author":"Ben-Eliyahu","year":"1991"},{"issue":"2\u20134","key":"10.1016\/S0004-3702(98)00092-7_BIB12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.3233\/FI-1995-232342","article-title":"An approach to context-based default reasoning","volume":"23","author":"Besnard","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB13","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-83)","first-page":"27","article-title":"A theorem-prover for a decidable subset of default logic","author":"Besnard","year":"1983"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB14","series-title":"Proceedings Conference on Automated Deduction","first-page":"783","volume":"Vol. 84","author":"Bibel","year":"1994"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB15","series-title":"Automated Theorem Proving","author":"Bibel","year":"1987"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB16","series-title":"Proceedings Tableaux-97","first-page":"107","article-title":"A sequent calculus for skeptical default logic","volume":"Vol. 1227","author":"Bonatti","year":"1997"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB17","series-title":"Proceedings Tableaux-96","first-page":"127","article-title":"Proof systems for default and autoepistemic logic","volume":"Vol. 1071","author":"Bonatti","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB18","series-title":"Nonmonotonic and Inductive Logic","first-page":"153","article-title":"Deduction with supernormal defaults","author":"Brass","year":"1991"},{"issue":"2","key":"10.1016\/S0004-3702(98)00092-7_BIB19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0004-3702(91)90099-6","article-title":"Cumulative default logic: in defense of nonmonotonic inference rules","volume":"50","author":"Brewka","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB20","series-title":"Proceedings 9th International Symposium on Methodologies for Intelligent Systems","first-page":"315","article-title":"A model-based approach to consistency-checking","volume":"Vol. 1079","author":"Br\u00fcning","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB21","article-title":"Prolog technology for default reasoning: implementation and the XRay system","author":"Br\u00fcning","year":"1998"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB22","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB23","series-title":"Symbolic Logic and Mechanical Theorem Proving","author":"Chang","year":"1973"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB24","series-title":"Proceedings International Conference on Logic Programming","article-title":"Experimenting with nonmonotonic reasoning","author":"Cholewi\u0144ski","year":"1995"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB25","series-title":"Proceedings 5th International Conference on the Principles of Knowledge Representation and Reasoning","article-title":"Default reasoning system DeReS","author":"Cholewi\u0144ski","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB26","series-title":"Proceedings 3rd International Conference on Logic Programming and Nonmonotonic Reasoning","article-title":"Reasoning with stratified default theories","author":"Cholewi\u0144ski","year":"1995"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB27","series-title":"Programming in Prolog","author":"Clocksin","year":"1981"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB28","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB29","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0004-3702(86)90081-0","article-title":"An assumption-based truth maintenance system","volume":"28","author":"de Kleer","year":"1986","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(98)00092-7_BIB30","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)90106-6","article-title":"Alternative approaches to default logic","volume":"70","author":"Delgrande","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB31","series-title":"Relative Complexities of First-Order Calculi","author":"Eder","year":"1992"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB32","series-title":"A Mathematical Introduction to Logic","author":"Enderton","year":"1972"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB33","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-96)","first-page":"627","article-title":"Towards efficient default reasoning","author":"Etherington","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB34","article-title":"Improvements to prepositional satisfiability search algorithms","author":"Freeman","year":"1995"},{"issue":"3","key":"10.1016\/S0004-3702(98)00092-7_BIB35","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1111\/j.1467-8640.1994.tb00168.x","article-title":"Default logic: a unified view","volume":"10","author":"Froidevaux","year":"1994","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB36","year":"1994"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB37","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-88)","first-page":"455","article-title":"Compiling circumscriptive theories into logic programs: preliminary report","author":"Gelfond","year":"1988"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB38","series-title":"Proceedings 2nd International Conference on the Principles of Knowledge Representation and Reasoning","first-page":"230","article-title":"Disjunctive defaults","author":"Gelfond","year":"1991"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB39","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0004-3702(89)90026-X","article-title":"A circumscriptive theorem prover","volume":"39","author":"Ginsberg","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB40","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(94)90006-X","article-title":"On cumulative default logics","volume":"66","author":"Giordano","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB41","series-title":"Proceedings Conference on Automated Deduction","first-page":"778","article-title":"SETHEO V3.2: recent developments","volume":"Vol. 814","author":"Goller","year":"1994"},{"issue":"3","key":"10.1016\/S0004-3702(98)00092-7_BIB42","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","article-title":"Complexity results for nonmonotonic logics","volume":"2","author":"Gottlob","year":"1992","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB43","unstructured":"N. Helft, K. Inoue, D. Poole, Extracting answers in circumscription, ICOT Research Center, 1-4-28 Mita, Miriato-ku, Tokyo 108, Japan; University of British Columbia, Vancouver, B.C., Canada V6T 1W5, December 1989; ICOT Technical Memorandum No. 855."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB44","article-title":"Incremental Partial Deduction","volume":"Vol. Diski 97","author":"Hoppe","year":"1995"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB45","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-90)","first-page":"278","article-title":"Computing the extensions of autoepistemic and default logic with a TMS","author":"Junker","year":"1990"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB46","series-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth","year":"1993"},{"issue":"2","key":"10.1016\/S0004-3702(98)00092-7_BIB47","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00244282","article-title":"setheo: a high-performance theorem prover","volume":"8","author":"Letz","year":"1992","journal-title":"J. Automat. Reason."},{"issue":"3","key":"10.1016\/S0004-3702(98)00092-7_BIB48","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00881947","article-title":"Controlled integrations of the cut rule into connection tableau calculi","volume":"13","author":"Letz","year":"1994","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB49","article-title":"First-order calculi and proof procedures for automated deduction","author":"Letz","year":"1993"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB50","series-title":"Proceedings European Conference on Symbolic and Quantitative Approaches for Uncertainty","first-page":"219","article-title":"Computing extensions of default theories","volume":"Vol. 548","author":"L\u00e9vy","year":"1991"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB51","series-title":"Proceedings European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty","first-page":"285","article-title":"Lemma handling in default logic theorem provers","volume":"Vol. 946","author":"Linke","year":"1995"},{"issue":"4","key":"10.1016\/S0004-3702(98)00092-7_BIB52","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/11663081.1997.10510925","article-title":"Towards a classification of default logics","volume":"7","author":"Linke","year":"1997","journal-title":"J. Appl. Non-Classical Logics"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB53","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB54","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/321450.321456","article-title":"Mechanical theorem proving by model elimination","volume":"15","author":"Loveland","year":"1986","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-8640.1988.tb00086.x","article-title":"Considerations on default logic\u2014an alternative approach","volume":"4","author":"\u0141ukaszewicz","year":"1988","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB56","series-title":"Nonmonotonic Logic: Context-Dependent Reasoning, Artificial Intelligence","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB57","series-title":"Nonmonotonic and Inductive Logic","first-page":"153","article-title":"Normal form results for default logics","volume":"Vol. 659","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB58","series-title":"Proceedings 2nd International Workshop on Logic Programming and Nonmonotonic Reasoning","first-page":"283","article-title":"Rational default logic and disjunctive logic programming","author":"Mikitiuk","year":"1993"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB59","series-title":"Applications of Uncertainty Formalisms in Information Systems","article-title":"The XRay system: an implementation platform for local query answering in default logics","author":"Nicolas","year":"1998"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB60","series-title":"Working Notes of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems","first-page":"66","article-title":"Evaluating an algorithm for default reasoning","author":"Niemel\u00e4","year":"1995"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB61","series-title":"Proceedings Ninth International Conference on Automated Deduction","first-page":"675","article-title":"Decision procedure for autoepistemic logic","author":"Niemel\u00e4","year":"1988"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB62","series-title":"Proceedings 4th International Conference on the Principles of Knowledge Representation and Reasoning","first-page":"473","article-title":"A decision method for nonmonotonic reasoning based on autoepistemic reasoning","author":"Niemel\u00e4","year":"1994"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB63","series-title":"Proceedings International Joint Conference on Artificial Intelligence (IJCAI-95)","first-page":"312","article-title":"Towards efficient default reasoning","author":"Niemel\u00e4","year":"1995"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB64","series-title":"The Knowledge Frontier: Essays in the Representation of Knowledge","first-page":"331","article-title":"Theorist: a logical reasoning system for defaults and diagnosis","author":"Poole","year":"1987"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB65","series-title":"A Theorist to Prolog Compiler, Logic Programming and Artificial Intelligence Group","author":"Poole","year":"1987"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB66","series-title":"Proceedings International Joint Conference on Artificial Intelligence (IJCAI-87)","first-page":"905","article-title":"Variables in hypotheses","author":"Poole","year":"1987"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB67","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(88)90077-X","article-title":"A logical framework for default reasoning","volume":"36","author":"Poole","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB68","series-title":"Proceedingis 1st International Conference on the Principles of Knowledge Representation and Reasoning","first-page":"333","article-title":"What the lottery paradox tells us about default reasoning","author":"Poole","year":"1989"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB69","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF03037149","article-title":"Compiling a default reasoning system into prolog","volume":"9","author":"Poole","year":"1991","journal-title":"New Generation Computing"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB70","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(89)90067-2","article-title":"An algorithm to compute circumscription","volume":"38","author":"Przymusinski","year":"1989","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(98)00092-7_BIB71","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A logic for default reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB72","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1080\/11663081.1996.10510867","article-title":"Analytic tableaux for default logics","volume":"6","author":"Risch","year":"1996","journal-title":"J. Appl. Non-Classical Logics"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB73","series-title":"Algorithmische Untersuchungen zu Defaultlogiken","author":"Rothschild","year":"1993"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB74","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1111\/j.1467-8640.1991.tb00331.x","article-title":"Using crucial literals to select better theories","volume":"7","author":"Sattar","year":"1991","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB75","series-title":"Proceedings European Conference on Artificial Intelligence (ECAI-96)","first-page":"105","article-title":"Prolog technology for default reasoning","author":"Schaub","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB76","series-title":"Proceedings 10th International Symposium on Methodologies for Intelligent Systems","article-title":"An implementation platform for query answering in default logics: theoretical underpinnings","author":"Schaub","year":"1997"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB77","series-title":"Proceedings Conference on Automated Deduction","first-page":"293","article-title":"XRay: a Prolog technology theorem prover for default reasoning: a system description","volume":"Vol. 1104","author":"Schaub","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB78","series-title":"Proceedings European Conference on Artificial Intelligence (ECAI-92)","first-page":"304","article-title":"On constrained default theories","author":"Schaub","year":"1992"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB79","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00881832","article-title":"A new methodology for query answering in default logics via structure-oriented theorem proving","volume":"15","author":"Schaub","year":"1995","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB80","article-title":"The family of default logics","volume":"Vol. 2","author":"Schaub","year":"1998"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB81","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/BF00881957","article-title":"Tableau-based characterization and theorem proving for default logic","volume":"13","author":"Schwind","year":"1994","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB82","series-title":"Proceedings Conference on Automated Deduction","article-title":"A tableaux-based theorem prover for a decidable subset of default logic","author":"Schwind","year":"1990"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB83","series-title":"XRay, An implementation platform for local query answering in default logics","year":"1998"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB84","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0004-3702(76)90021-7","article-title":"Refutation graphs","volume":"7","author":"Shostak","year":"1976","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB85","series-title":"Proceedings International Joint Conference on Artificial Intelligence (UCAI-93)","first-page":"109","article-title":"SCOTT: a model-guided theorem prover","author":"Slaney","year":"1993"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB86","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/BF03037328","article-title":"A Prolog technology theorem prover","volume":"2","author":"Stickel","year":"1984","journal-title":"New Generation Computing"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB87","article-title":"A Prolog technology theorem prover: a new exposition and implementation in Prolog","volume":"464","author":"Stickel","year":"1989"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB88","series-title":"Proceedings Conference on Automated Deduction","first-page":"673","article-title":"A Prolog technology theorem prover","volume":"Vol. 449","author":"Stickel","year":"1990"},{"issue":"1","key":"10.1016\/S0004-3702(98)00092-7_BIB89","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00881829","article-title":"Default reasoning by deductive planning","volume":"15","author":"Thielscher","year":"1995","journal-title":"J. Automat. Reason."},{"key":"10.1016\/S0004-3702(98)00092-7_BIB90","series-title":"Proceedings AAAI National Conference on Artificial Intelligence (AAAI-96)","first-page":"645","article-title":"Splitting a default theory","author":"Turner","year":"1996"},{"key":"10.1016\/S0004-3702(98)00092-7_BIB91","series-title":"IEEE 1985 Symposium on Logic Programming","first-page":"40","article-title":"An experiment in programming with full first-order logic","author":"Umrigar","year":"1985"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000927?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000927?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T06:59:50Z","timestamp":1580281190000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":91,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S0004370298000927"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00092-7","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}