{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:01:46Z","timestamp":1775818906675,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540207214","type":"print"},{"value":"9783540246091","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_25","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T22:31:31Z","timestamp":1294957891000},"page":"289-301","source":"Crossref","is-referenced-by-count":6,"title":["Strong Equivalence for Causal Theories"],"prefix":"10.1007","author":[{"given":"Hudson","family":"Turner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akman, V., Erdo\u011fan, S., Lee, J., Lifschitz, V., Turner, H.: Representing the Zoo World and the Traffic World in the language of the Causal Calculator. Artificial Intelligence (2003) (to appear)","DOI":"10.1016\/j.artint.2003.08.002"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Artikis, A., Sergot, M., Pitt, J.: An executable specification of an argumentation protocol. In: Proc. of Artificial Intelligence and Law (ICAIL), pp. 1\u201311 (2003)","DOI":"10.1145\/1047788.1047790"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36540-0_1","volume-title":"Agent-Oriented Software Engineering III","author":"A. Artikis","year":"2003","unstructured":"Artikis, A., Sergot, M., Pitt, J.: Specifying electronic societies with the Causal Calculator. In: Giunchiglia, F., Odell, J.J., Weiss, G. (eds.) AOSE 2002. LNCS, vol.\u00a02585, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"25_CR4","unstructured":"Bochman, A.: A logic for causal reasoning. In: Proc. IJCAI 2003, pp. 141\u2013146 (2003)"},{"key":"25_CR5","unstructured":"Campbell, J., Lifschitz, V.: Reinforcing a claim in commonsense reasoning. In: Logical Formalizations of Commonsense Reasoning: Papers from 2003 AAAI Spring Symposium, pp. 51\u201356 (2003)"},{"key":"25_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/3-540-44957-4_55","volume-title":"Computational Logic - CL 2000","author":"E. Erdem","year":"2000","unstructured":"Erdem, E., Lifschitz, V., Wong, M.: Wire routing and satisfiability planning. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 822\u2013836. Springer, Heidelberg (2000)"},{"key":"25_CR7","unstructured":"Gelfond, M., Lifschitz, V., Przymusi\u0144ska, H., Truszczy\u0144ski, M.: Disjunctive defaults. In: Proc. KR 1991, pp. 230\u2013237 (1991)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic causal theories. Artificial Intelligence (2003) (to appear)","DOI":"10.1016\/j.artint.2002.12.001"},{"key":"25_CR9","unstructured":"Lee, J., Lifschitz, V.: Describing additive fluents in action language C+. In: Proc. IJCAI 2003, pp. 1079\u20131084 (2003)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0004-3702(97)00057-X","volume":"96","author":"V. Lifschitz","year":"1997","unstructured":"Lifschitz, V.: On the logic of causal explanation. Artificial Intelligence\u00a096, 451\u2013465 (1997)","journal-title":"Artificial Intelligence"},{"key":"25_CR11","unstructured":"Lifschitz, V.: Missionaries and cannibals in the Causal Calculator. In: Proc. KR 2000, pp. 85\u201396 (2000)"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4615-1567-8_7","volume-title":"Logic-Based Artificial Intelligence","author":"V. Lifschitz","year":"2000","unstructured":"Lifschitz, V., McCain, N., Remolina, E., Tacchella, A.: Getting to the airport: the oldest planning problem in AI. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 147\u2013165. Kluwer, Dordrecht (2000)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02, 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2-3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence\u00a025(2-3), 369\u2013390 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"25_CR15","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical logic. In: Proc. KR 2002, pp. 170\u2013176 (2002)"},{"key":"25_CR16","unstructured":"McCain, N., Turner, H.: A causal theory of ramifications and qualifications. In: Proc. of IJCAI 1995, pp. 1978\u20131984 (1995)"},{"key":"25_CR17","unstructured":"McCain, N., Turner, H.: Causal theories of action and change. In: Proc. AAAI 1997, pp. 460\u2013465 (1997)"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/978-1-4615-1567-8_21","volume-title":"Logic-Based Artificial Intelligence","author":"I. Niemel\u00e4","year":"2000","unstructured":"Niemel\u00e4, I., Simons, P.: Extending the smodels system with cardinality and weight constraints. In: Minker, J. (ed.) Logic-Based Artificial Intelligence, pp. 491\u2013521. Kluwer, Dordrecht (2000)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A new logical characterization of stable models and answer sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS, vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"25_CR20","series-title":"Lecture Notes in Artificial Intelligence","first-page":"306","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibrium logic and logic programs with nested expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"issue":"1,2","key":"25_CR21","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence\u00a013(1,2), 81\u2013132 (1980)","journal-title":"Artificial Intelligence"},{"issue":"1-3","key":"25_CR22","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0743-1066(96)00125-2","volume":"31","author":"H. Turner","year":"1997","unstructured":"Turner, H.: Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming\u00a031(1-3), 245\u2013298 (1997)","journal-title":"Journal of Logic Programming"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0004-3702(99)00058-2","volume":"113","author":"H. Turner","year":"1999","unstructured":"Turner, H.: A logic of universal causation. Artificial Intelligence\u00a0113, 87\u2013123 (1999)","journal-title":"Artificial Intelligence"},{"key":"25_CR24","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong equivalence for logic programs and default theories (made easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"issue":"4&5","key":"25_CR25","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming\u00a03(4&5), 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:52:59Z","timestamp":1559926379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}