{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:05:45Z","timestamp":1762520745011},"reference-count":64,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6018,"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":[[1997,2]]},"DOI":"10.1016\/s0004-3702(96)00040-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"177-223","source":"Crossref","is-referenced-by-count":25,"title":["Semantics and complexity of abduction from default theories"],"prefix":"10.1016","volume":"90","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Leone","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(96)00040-9_BIB1","series-title":"Proceedings Sixth ACM Symposium on Principles of Programming Languages","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1080\/08839519108927916","article-title":"Perspectives in knowledge representation","volume":"5","author":"Aiello","year":"1991","journal-title":"Appl. Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear time algorithm for testing the truth of certain quantified boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB4","first-page":"299","article-title":"Dualities between alternative semantics for logic programming and nonmonotonic reasoning","volume":"10","author":"Baral","year":"1991","journal-title":"J. Autom. Reasoning"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB5","article-title":"Nonmonotonic Reasoning: Logical Foundations of Commonsense","volume":"12","author":"Brewka","year":"1991"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB6","series-title":"Proceedings KR-91","first-page":"70","article-title":"The monotonic abduction problem: a functional characterization on the edge of tractability","author":"Bylander","year":"1991"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0004-3702(91)90005-5","article-title":"The computational complexity of abduction","volume":"49","author":"Bylander","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB8_1","series-title":"Proceedings KR-94","first-page":"99","article-title":"Default logic as a query language","author":"Cadoli","year":"1994"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB8_2","unstructured":"also full paper in: IEEE Trans. Knowledge Data Eng. (to appear)."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","article-title":"A survey of complexity results for non-monotonic logics","volume":"17","author":"Cadoli","year":"1993","journal-title":"J. Logic Program."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB10","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0004-3702(94)00009-P","article-title":"Tractable reasoning via approximation","volume":"74","author":"Cadoli","year":"1995","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","article-title":"Structure and complexity of relational queries","volume":"25","author":"Chandra","year":"1982","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB12","author":"Charniak","year":"1985"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB13","series-title":"Proceedings ICLP-95","article-title":"Experimenting with nonmonotonic reasoning","author":"Cholewi\u0144ski","year":"1995"},{"issue":"2","key":"10.1016\/S0004-3702(96)00040-9_BIB14","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/202840.202841","article-title":"Approximate solutions to problems in PSPACE","volume":"26","author":"Condon","year":"1995","journal-title":"SIGACT News"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB15","series-title":"Proceedings IJCAI-89","first-page":"1311","article-title":"A theory of diagnosis for incomplete causal models","author":"Console","year":"1989"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB16","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1093\/logcom\/1.5.661","article-title":"On the relationship between abduction and deduction","volume":"1","author":"Console","year":"1991","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB17","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","volume":"60","author":"Dagum","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB18","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF00140676","article-title":"Nonmonotonic reasoning","volume":"4","author":"Donini","year":"1991","journal-title":"Artif. Intell. Rev."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB19","series-title":"Proceedings World Congress for AI (WOCFAI-95)","article-title":"Ground nonmonotonic modal logics for knowledge representation","author":"Donini","year":"1995"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(92)90018-S","article-title":"On the complexity of prepositional knowledge base revision, updates and counterfactuals","volume":"57","author":"Eiter","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB21","first-page":"31","article-title":"Reasoning with parsimonious and moderately grounded expansions","volume":"17","author":"Eiter","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/200836.200838","article-title":"The complexity of logic-based abduction","volume":"42","author":"Eiter","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB23","series-title":"Proceedings LPNMR '95","first-page":"1","article-title":"Complexity results for abductive logic programming","volume":"982","author":"Eiter","year":"1995"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB24","series-title":"Proceedings 5th International Conference and Symposium on Logic Programming","first-page":"562","article-title":"Abductive planning with event calculus","author":"Eshghi","year":"1988"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB25","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB26","series-title":"Proceedings KR-91","first-page":"230","article-title":"Disjunctive defaults","author":"Gelfond","year":"1991"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB27","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(96)00040-9_BIB28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1006\/inco.1995.1124","article-title":"The complexity of prepositional default reasoning under the stationary fixed point semantics","volume":"121","author":"Gottlob","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB29_1","series-title":"Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS-95)","first-page":"66","article-title":"Second-order logic and the weak exponential hierarchies","volume":"969","author":"Gottlob","year":"1995"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB29_2","unstructured":"also full paper available as: CD\/TR 95\/80, CD-Lab for Expert Systems, TU Wien."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB30","series-title":"Proceedings 26th Annual Meeting of the Association for Computational Linguistics","first-page":"95","article-title":"Interpretation as abduction","author":"Hobbs","year":"1988"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB31","article-title":"A catalog of complexity classes","volume":"Vol. A","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB32","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TSMC.1987.4309060","article-title":"A mechanism for forming composite explanatory hypotheses","volume":"17","author":"Josephson","year":"1987","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB33","article-title":"Abductive logic programming","author":"Kakas","year":"1993","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB34","series-title":"Proceedings VLDB-90","first-page":"650","article-title":"Database updates through abduction","author":"Kakas","year":"1990"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB35","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","article-title":"Hard problems for simple default logics","volume":"49","author":"Kautz","year":"1991","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB36_1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(88)90021-5","article-title":"On the relationship between default and autoepistemic logic","volume":"35","author":"Konolige","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB36_2","first-page":"115","article-title":"Errata","volume":"41","author":"Konolige","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB37","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0004-3702(92)90073-7","article-title":"Abduction versus closure in causal theories","volume":"53","author":"Konolige","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB38","author":"Marek","year":"1993"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB39","series-title":"Proceedings LPNMR'93","first-page":"115","article-title":"Rational default logic and disjunctive logic programming","author":"Mikitiuk","year":"1993"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","article-title":"LTUR: a simplified linear time unit resolution for Horn formulae and computer implementation","volume":"29","author":"Minoux","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB41","unstructured":"B. Nebel, Artificial intelligence: a computational perspective, in: G. Brewka, ed., Logic and Computation in AI (to appear)."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB42","series-title":"Proceedings AAAI-91","first-page":"494","article-title":"An efficient first-order Horn clause abduction system based on the ATMS","author":"Ng","year":"1991"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB43","author":"Peng","year":"1990"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB44","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":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB45","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1111\/j.1467-8640.1989.tb00319.x","article-title":"Explanation and prediction: an architecture for default and abductive reasoning","volume":"5","author":"Poole","year":"1989","journal-title":"Comput. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB46","series-title":"Proceedings IJCAI-89","first-page":"1304","article-title":"Normality and faults in logic based diagnosis","author":"Poole","year":"1989"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB47","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF03037184","article-title":"Logic programming, abduction and probability","volume":"11","author":"Poole","year":"1993","journal-title":"New Generation Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB48","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","article-title":"Probabilistic Horn abduction and Bayesian networks","volume":"64","author":"Poole","year":"1993","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB49","doi-asserted-by":"crossref","first-page":"67","DOI":"10.3233\/FI-1994-21124","article-title":"Stationary default extensions","volume":"21","author":"Przymusinska","year":"1994","journal-title":"Fund. Inform."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB50","article-title":"Theories of trans-epistemic defaults","author":"Rajasekar","year":"1994"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB51","series-title":"Complexity of trans-epistemic defaults","author":"Rajasekar","year":"1995"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB52","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":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB53","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1146\/annurev.cs.02.060187.001051","article-title":"Nonmonotonic reasoning","volume":"2","author":"Reiter","year":"1987","journal-title":"Ann. Rev. Comput. Sci."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB54","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","article-title":"On the hardness of approximate reasoning","volume":"82","author":"Roth","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB55","series-title":"Proceedings AAAI-91","first-page":"904","article-title":"Knowledge compilation using Horn approximations","author":"Selman","year":"1991"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB56","series-title":"Proceedings AAAI-90","first-page":"343","article-title":"Abductive and default reasoning: a computational core","author":"Selman","year":"1990"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB57","series-title":"Proceedings AAAI-92","first-page":"440","article-title":"A new method for solving hard satisfiability problems","author":"Selman","year":"1992"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB58","series-title":"Proceedings AAAI-90","first-page":"571","article-title":"It's not my default: the complexity of membership problems in restricted propositional default logic","author":"Stillman","year":"1990"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB59","series-title":"Proceedings AAAI-92","first-page":"794","article-title":"The complexity of propositional default logic","author":"Stillman","year":"1992"},{"key":"10.1016\/S0004-3702(96)00040-9_BIB60","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1137\/0214060","article-title":"On approximation algorithms for # P","volume":"14","author":"Stockmeyer","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(96)00040-9_BIB61","series-title":"Proceedings 14th Annual ACM Symposium on Theory of Computing","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370296000409?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370296000409?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T07:01:25Z","timestamp":1580281285000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370296000409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":64,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0004370296000409"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(96)00040-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}