{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:30Z","timestamp":1761620910446},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540285380"},{"type":"electronic","value":"9783540318279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546207_17","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:41:23Z","timestamp":1127832083000},"page":"211-226","source":"Crossref","is-referenced-by-count":4,"title":["$\\mathcal{M}$ odular-\u03b5: An Elaboration Tolerant Approach to the Ramification and Qualification Problems"],"prefix":"10.1007","author":[{"given":"Antonis","family":"Kakas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Loizos","family":"Michael","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"17_CR1","first-page":"1","volume":"3","author":"M. Denecker","year":"1998","unstructured":"Denecker, M., Theseider-Dupr\u00e9, D., Van Belleghem, K.: An inductive definition approach to ramifications. Linkoping Electronic Articles in Computer and Information Science\u00a03(7), 1\u201343 (1998)","journal-title":"Linkoping Electronic Articles in Computer and Information Science"},{"key":"17_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-24609-1_8","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Dimopoulos","year":"2003","unstructured":"Dimopoulos, Y., Kakas, A., Michael, L.: Reasoning about actions and change in answer set programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 61\u201373. Springer, Heidelberg (2003)"},{"key":"17_CR3","unstructured":"Elkan, C.: On solving the qualification problem. In: Extending Theories of Actions: Formal theory and practical applications, AAAI Spring Symposium (1995)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ginsberg, M., Smith, D.: Reasoning about Action II: The Qualification Problem. AIJ\u00a035 (1988)","DOI":"10.1016\/0004-3702(88)90020-3"},{"issue":"1\u20132","key":"17_CR5","first-page":"49","volume":"153","author":"E. Giunchiglia","year":"2004","unstructured":"Giunchiglia, E., Lee, J., Lifschitz, V., McCain, N., Turner, H.: Nonmonotonic Causal Theories. AIJ\u00a0153(1\u20132), 49\u2013104 (2004)","journal-title":"AIJ"},{"key":"17_CR6","volume-title":"Proceedings of ECAI 2004","author":"A. Herzig","year":"2004","unstructured":"Herzig, A., Varzinczak, I.: Domain Descriptions Should be Modular. In: Proceedings of ECAI 2004. IOS Press, Amsterdam (2004)"},{"key":"17_CR7","unstructured":"Kakas, A., Miller, R.: Reasoning about Actions, Narratives and Ramifications. Journal of Electronic Transactions on AI\u00a01(4) (1998)"},{"key":"17_CR8","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: Planning, propositional logic, and stochastic search. In: Proceedings of NCAI 1996 (1996)"},{"key":"17_CR9","unstructured":"Lifschitz, V.: Missionaries and cannibals in the causal calculator. In: Proceedings of KR 2000 (2000)"},{"key":"17_CR10","unstructured":"McCarthy, J.: Elaboration tolerance (1999), http:\/\/www-formal.stanford.edy\/jmc\/elaboration"},{"key":"17_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-45632-5_17","volume-title":"Computational Logic: Logic Programming and Beyond","author":"R. Miller","year":"2002","unstructured":"Miller, R., Shanahan, M.: Some Alternative Formulations of the Event Calculus. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 452\u2013490. Springer, Heidelberg (2002)"},{"issue":"5","key":"17_CR12","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1093\/logcom\/14.5.731","volume":"14","author":"M. Shanahan","year":"2004","unstructured":"Shanahan, M., Witkowski, M.: Event Calculus Planning Through Satisfiability. J. of Logic Comp.\u00a014(5), 731\u2013745 (2004)","journal-title":"J. of Logic Comp."},{"issue":"1\u20132","key":"17_CR13","first-page":"1","volume":"131","author":"M. Thielscher","year":"2001","unstructured":"Thielscher, M.: The Qualification Problem: A solution to the problem of anomalous models. AIJ\u00a0131(1\u20132), 1\u201337 (2001)","journal-title":"AIJ"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546207_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:18:46Z","timestamp":1605644326000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546207_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285380","9783540318279"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11546207_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}