{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:08:23Z","timestamp":1781651303538,"version":"3.54.5"},"reference-count":41,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3947,"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":[[2002,11]]},"DOI":"10.1016\/s0004-3702(02)00271-0","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:23:56Z","timestamp":1034004236000},"page":"53-89","source":"Crossref","is-referenced-by-count":45,"title":["Complexity results for structure-based causality"],"prefix":"10.1016","volume":"142","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Lukasiewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00271-0_BIB001","series-title":"Proceedings AAAI-94, Seattle, WA","first-page":"230","article-title":"Probabilistic evaluation of counterfactual queries","author":"Balke","year":"1994"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB002","series-title":"Proceedings AAAI-97, Providence, RI","first-page":"203","article-title":"Using CSP look-back techniques to solve real-world SAT instances","author":"Bayardo","year":"1997"},{"issue":"2","key":"10.1016\/S0004-3702(02)00271-0_BIB003","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1006\/jcss.1995.1017","article-title":"PP is closed under intersection","volume":"50","author":"Beigel","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(02)00271-0_BIB004","series-title":"Proceedings AAAI-98, Madison, WI","first-page":"262","article-title":"An algorithm to evaluate quantified boolean formulae","author":"Cadoli","year":"1998"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB005","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0004-3702(90)90060-D","article-title":"The computational complexity of probabilistic inference using Bayesian belief networks","volume":"42","author":"Cooper","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB006","series-title":"Proceedings UAI-02","article-title":"Causes and explanations in the structural-model approach: Tractable cases","author":"Eiter","year":"2002"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB007","series-title":"Proceedings KR-02, Toulouse, France","first-page":"49","article-title":"Complexity results for explanations in the structural-model approach","author":"Eiter","year":"2002"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB008","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(90)90060-U","article-title":"A logic for reasoning about probabilities","volume":"87","author":"Fagin","year":"1990","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0004-3702(02)00271-0_BIB009","series-title":"Proceedings AAAI-00, Austin, TX","first-page":"285","article-title":"A distributed algorithm to evaluate quantified boolean formulae","author":"Feldmann","year":"2000"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB010","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0004-3702(97)00047-7","article-title":"Axioms of causal relevance","volume":"97","author":"Galles","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB011","series-title":"Proceedings AAAI-90, Boston, MA","first-page":"524","article-title":"Causal theories for nonmonotonic reasoning","author":"Geffner","year":"1990"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB012","series-title":"Default Reasoning: Causal and Conditional Theories","author":"Geffner","year":"1992"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB013","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0004-3702(02)00271-0_BIB014","series-title":"Proceedings AAAI-98, Madison, WI","first-page":"623","article-title":"An action language based on causal explanation: Preliminary report","author":"Giunchiglia","year":"1998"},{"issue":"2","key":"10.1016\/S0004-3702(02)00271-0_BIB015","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01202284","article-title":"On the power of deterministic reductions to C=P","volume":"26","author":"Green","year":"1993","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB016","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1613\/jair.648","article-title":"Axiomatizing causal reasoning","volume":"12","author":"Halpern","year":"2000","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00271-0_BIB017","unstructured":"J.Y. Halpern, J. Pearl, Causes and explanations: A structural-model approach, Technical Report R-266, UCLA Cognitive Systems Lab, Los Angeles, CA, 2000"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB018","series-title":"Proceedings UAI-01, Seattle, WA","first-page":"194","article-title":"Causes and explanations: A structural-model approach\u2014Part I: Causes","author":"Halpern","year":"2001"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB019","series-title":"Proceedings IJCAI-01, Seattle, WA","first-page":"27","article-title":"Causes and explanations: A structural-model approach\u2014Part II: Explanations","author":"Halpern","year":"2001"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB020","unstructured":"M. Hopkins, A proof of the conjunctive cause conjecture, Unpublished 2001"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB021","series-title":"Proceedings AAAI-02, Edmonton, AB","first-page":"546","article-title":"Strategies for determining causes of reported events","author":"Hopkins","year":"2002"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB022","series-title":"Handbook of Theoretical Computer Science, Vol. A","article-title":"A catalog of complexity classes","author":"Johnson","year":"1990"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB023","series-title":"Proceedings ECAI-92, Vienna, Austria","first-page":"359","article-title":"Planning as satisfiability","author":"Kautz","year":"1992"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB024","series-title":"Proceedings KR-98, Trento, Italy","first-page":"536","article-title":"Situation calculus and causal logic","author":"Lifschitz","year":"1998"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB025","series-title":"Proceedings AAAI-96, Portland, OR","first-page":"670","article-title":"Embracing causality in specifying the indirect effects of actions","author":"Lin","year":"1996"},{"issue":"2","key":"10.1016\/S0004-3702(02)00271-0_BIB026","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/201019.201021","article-title":"Provably correct theories of action","volume":"42","author":"Lin","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB027","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.505","article-title":"The computational complexity of probabilistic planning","volume":"9","author":"Littman","year":"1998","journal-title":"J. Artificial Intelligence Res."},{"issue":"3","key":"10.1016\/S0004-3702(02)00271-0_BIB028","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/377978.377983","article-title":"Probabilistic logic programming with conditional constraints","volume":"2","author":"Lukasiewicz","year":"2001","journal-title":"ACM Trans. Comput. Logic"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB029","series-title":"Proceedings AAAI-97, Providence, RI","first-page":"460","article-title":"Causal theories of actions and change","author":"McCain","year":"1997"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB030","first-page":"44","article-title":"A characterization of PC=P","volume":"E75-D","author":"Ogiwara","year":"1992","journal-title":"The Transactions of the Institute of Electronics, Information and Communication Engineers"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB031","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB032","series-title":"Proceedings IJCAI-99, Stockholm, Sweden","first-page":"1437","article-title":"Reasoning with cause and effect","author":"Pearl","year":"1999"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB033","series-title":"Causality: Models, Reasoning, and Inference","author":"Pearl","year":"2000"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB034","series-title":"Proceedings IJCAI-99, Stockholm, Sweden","first-page":"1192","article-title":"Improvements to the evaluation of quantified Boolean formulae","author":"Rintanen","year":"1999"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00271-0_BIB035","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB036","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/0004-3702(94)90072-8","article-title":"Finding MAPs for belief networks is NP-hard","volume":"68","author":"Shimony","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(02)00271-0_BIB037","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/116825.116858","article-title":"Complexity classes defined by counting quantifiers","volume":"38","author":"Tor\u00e1n","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB038","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0004-3702(99)00058-2","article-title":"A logic of universal causation","volume":"113","author":"Turner","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB039","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00289117","article-title":"The complexity of combinatorial problems with succinct input representation","volume":"23","author":"Wagner","year":"1986","journal-title":"Acta Informatica"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB040","series-title":"Proceedings ICALP-86","first-page":"434","article-title":"More complicated questions about maxima and minima, and some closures of NP","author":"Wagner","year":"1986"},{"key":"10.1016\/S0004-3702(02)00271-0_BIB041","series-title":"Proceedings CADE-97","first-page":"272","article-title":"SATO: An efficient propositional prover","author":"Zhang","year":"1997"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002710?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002710?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T12:31:14Z","timestamp":1583757074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002710"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S0004370202002710"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00271-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}