{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:57Z","timestamp":1761610257175,"version":"build-2065373602"},"reference-count":22,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80595-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"167-182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments"],"prefix":"10.1016","volume":"70","author":[{"given":"Koji","family":"Iwanuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0004-3702(96)00042-2","article-title":"Computing answers with model elimination","volume":"90","author":"Baumgartner","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB2","unstructured":"A. del Val: A new method for consequence finding and compilation in restricted languages, Proc. of AAAI-99 (1999) 259\u2013264."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB3","unstructured":"R. Demolombe: A strategy for the computation of conditional answers, Proc. of ECAI 92, LNAI, 810 (1992) 134\u2013138."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB4","unstructured":"R. Demolombe and L. F. D. Cerro: An inference rule for hypothesis generation, Proc. of IJCAI-91 (1991) 152\u2013157."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB5","unstructured":"M. Fuchs: Lemma generation for model elimination by combining top-down and bottom-up inference, Proc. of IJCAI-99, pp. 4\u20139 (1999)."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0743-1066(87)90003-3","article-title":"Intelligent query answering in rule based systems","volume":"4","author":"Imielinski","year":"1987","journal-title":"J. Logic Programming"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","article-title":"Linear resolution for consequence finding","volume":"56","author":"Inoue","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB8","unstructured":"K. Inoue, S. Kawaguchi and H. Haneda: Controlling Speculative Computation in Multi-Agent Environments, Proc. of CLIMA-01 (2001) 9\u201318."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"K. Iwanuma: Lemma matching for a PTTP-based top-down theorem prover, Proc. of CADE-14, LNAI 1249 (1997) 146\u2013160.","DOI":"10.1007\/3-540-63104-6_16"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB10","unstructured":"K. Iwanuma, K. Inoue and K. Satoh: Completeness of pruning methods for consequence finding procedure SOL, Proc. of FTP 2000 (2000) 89\u2013100."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB11","doi-asserted-by":"crossref","unstructured":"K. Iwanuma and K. Inoue: Minimal answer computation and SOL, JELIA2002 (2002) to appear.","DOI":"10.1007\/3-540-45757-7_21"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF00247669","article-title":"The semantics of Answer Literals","volume":"17","author":"Kunen","year":"1996","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB13","first-page":"39","article-title":"Clausal tableaux","volume":"Vol. 1","author":"Letz","year":"1998"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF00881947","article-title":"Controlled integration of the cut rule into connection tableau calculi","volume":"13","author":"Letz","year":"1994","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB15","unstructured":"D. W. Loveland: Automated Theorem Proving: A Logical Basis (North-Holland, Amsterdam, 1978)."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB16","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"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB17","series-title":"The Future of Computational Logic","article-title":"Computational logic and multi-agent systems: a roadmap","author":"Sadri","year":"1999"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB18","unstructured":"C. Sakama, K. Inoue, K. Iwanuma and K. Satoh: A defeasible reasoning system in multi-agent environments. Proc. of CLIMA-00 (2000) 1\u20136."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB19","doi-asserted-by":"crossref","unstructured":"K. Satoh, K. Inoue, K. Iwanuma and K. Sakama: Speculative computation by abduction under incomplete communication environments, Proc. of ICMAS2000 (2000) 263\u2013270.","DOI":"10.1109\/ICMAS.2000.858462"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB20","doi-asserted-by":"crossref","unstructured":"K. Satoh and K. Yamamoto: Speculative computation with Multi-Agent Belief Revision, Proc. of AAMAS 2002 (2002) to appear.","DOI":"10.1145\/544947.544950"},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB21","unstructured":"K. Satoh: Speculative computation and abduction for an autonomous agent, Proc. of NMR2002, (2002) 191\u2013199."},{"key":"10.1016\/S1571-0661(04)80595-4_NEWBIB22","unstructured":"J. R. Slagle, C. L. Chang and R. C. Lee. Completeness theorems for semantic resolution in consequence-finding, Proc. of IJCAI-69 (1969) 281\u2013285."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805954?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805954?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:02Z","timestamp":1761609962000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S1571066104805954"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80595-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80595-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}