{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:33Z","timestamp":1750308993787,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2007,4,1]],"date-time":"2007-04-01T00:00:00Z","timestamp":1175385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2007,4]]},"abstract":"<jats:p>\n            In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanations for a series of observations with the same domain. The question arises as to whether previously computed answers can be recycled. A \u201cyes\u201d answer could result in substantial savings of repeated computations. For systems based on classical logic, the answer\n            <jats:italic>is<\/jats:italic>\n            yes. For nonmonotonic systems, however, one tends to believe that the answer should be\n            <jats:italic>no<\/jats:italic>\n            , since recycling is a form of adding information. In this article, we show that computed answers can always be recycled, in a nontrivial way, for the class of rewrite procedures proposed earlier by the authors for logic programs with negation. We present some experimental results on an encoding of the logistics domain.\n          <\/jats:p>","DOI":"10.1145\/1227839.1227841","type":"journal-article","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T14:37:11Z","timestamp":1181140631000},"page":"9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Recycling computed answers in rewrite systems for abduction"],"prefix":"10.1145","volume":"8","author":[{"given":"Fangzhen","family":"Lin","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Kowloon, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[{"name":"University of Alberta, Alberta, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,4]]},"reference":[{"key":"e_1_2_1_1_1","first-page":"661","article-title":"On the relationship between abduction and deduction","volume":"2","author":"Console L.","year":"1991","unstructured":"Console , L. , Theseider , D. , and Porasso , P. 1991 . On the relationship between abduction and deduction . J. Logic Program. 2 , 5, 661 -- 690 . Console, L., Theseider, D., and Porasso, P. 1991. On the relationship between abduction and deduction. J. Logic Program. 2, 5, 661--690.","journal-title":"J. Logic Program."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(97)00074-5"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Dershowitz N. and Jouannaud P. 1990. Rewrite systems. In Handbook of Theoretical Computer Science: Formal Methods and Semantics. North-Holland vol. B 243--320.   Dershowitz N. and Jouannaud P. 1990. Rewrite systems. In Handbook of Theoretical Computer Science: Formal Methods and Semantics. North-Holland vol. B 243--320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Ist Workshop on Logic Programming and Nonmonotonic Reasoning. MIT Press","author":"Dix J.","year":"1991","unstructured":"Dix , J. 1991 . Classifying semantics of logic programs . In Proceedings of the Ist Workshop on Logic Programming and Nonmonotonic Reasoning. MIT Press , Cambridge, MA. 167--180. Dix, J. 1991. Classifying semantics of logic programs. In Proceedings of the Ist Workshop on Logic Programming and Nonmonotonic Reasoning. MIT Press, Cambridge, MA. 167--180."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 8th International Conference on Logic Programming. MIT Press","author":"Dung P.","year":"1991","unstructured":"Dung , P. 1991 . Negations as hypothesis: An abductive foundation for logic programming . In Proceedings of the 8th International Conference on Logic Programming. MIT Press , Cambridge, MA. 3--17. Dung, P. 1991. Negations as hypothesis: An abductive foundation for logic programming. In Proceedings of the 8th International Conference on Logic Programming. MIT Press, Cambridge, MA. 3--17."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)94697-X"},{"volume-title":"Proceedings of the 6th International Conference on Logic Programming. MIT Press","author":"Eshghi K.","key":"e_1_2_1_7_1","unstructured":"Eshghi , K. and Kowalski , R . 1989. Abduction compared with negation by failure . In Proceedings of the 6th International Conference on Logic Programming. MIT Press , Cambridge, MA. 234--254. Eshghi, K. and Kowalski, R. 1989. Abduction compared with negation by failure. In Proceedings of the 6th International Conference on Logic Programming. MIT Press, Cambridge, MA. 234--254."},{"key":"e_1_2_1_8_1","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages F.","year":"1994","unstructured":"Fages , F. 1994 . Consistency of Clark's completion and existence of stable models . J. Methods Logic Comput. Sci. 1 , 51 -- 60 . Fages, F. 1994. Consistency of Clark's completion and existence of stable models. J. Methods Logic Comput. Sci. 1, 51--60.","journal-title":"J. Methods Logic Comput. Sci."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(97)00026-5"},{"volume-title":"Proceedings of the 5th International Conference on Logic Programming. MIT Press","author":"Gelfond M.","key":"e_1_2_1_10_1","unstructured":"Gelfond , M. and Lifschitz , V . 1988. The stable model semantics for logic programming . In Proceedings of the 5th International Conference on Logic Programming. MIT Press , Cambridge, MA. 1070--1080. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference on Logic Programming. MIT Press, Cambridge, MA. 1070--1080."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)00065-8"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057453"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1119439.1119440"},{"key":"e_1_2_1_14_1","unstructured":"Kakas A. Kowalski R. and Toni F. 1995. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Oxford UK.  Kakas A. Kowalski R. and Toni F. 1995. The role of abduction in logic programming. In Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Oxford UK."},{"volume-title":"Proceedings of the 9th European Conference on Artificial Intelligence. 285--291","author":"Kakas A.","key":"e_1_2_1_15_1","unstructured":"Kakas , A. and Mancarella , P . 1990a. Generalized stable models: A semantics for abduction . In Proceedings of the 9th European Conference on Artificial Intelligence. 285--291 . Kakas, A. and Mancarella, P. 1990a. Generalized stable models: A semantics for abduction. In Proceedings of the 9th European Conference on Artificial Intelligence. 285--291."},{"volume-title":"Proceedings of the Ist Pacific Rim International and Conference on Artificial Intellgence (PRICAI). 438--443","author":"Kakas A.","key":"e_1_2_1_16_1","unstructured":"Kakas , A. and Mancarella , P . 1990b. On the relation between truth maintenance and abduction . In Proceedings of the Ist Pacific Rim International and Conference on Artificial Intellgence (PRICAI). 438--443 . Kakas, A. and Mancarella, P. 1990b. On the relation between truth maintenance and abduction. In Proceedings of the Ist Pacific Rim International and Conference on Artificial Intellgence (PRICAI). 438--443."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00075-8"},{"volume-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Kakas A.","key":"e_1_2_1_18_1","unstructured":"Kakas , A. , van Nuffelen , B. , and Denecker , M . 2001. A-system: Problem solving through abduction . In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI) , New York. 591--596. Kakas, A., van Nuffelen, B., and Denecker, M. 2001. A-system: Problem solving through abduction. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI), New York. 591--596."},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"Lin F.","year":"1995","unstructured":"Lin , F. 1995 . Embracing causality in specifying the indirect effects of actions . In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) . Morgan Kaufmann, New York. 1985--1993. Lin, F. 1995. Embracing causality in specifying the indirect effects of actions. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufmann, New York. 1985--1993."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622434.1622444"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. Lacture Notes in Ccomputer Science","volume":"1730","author":"Lin F.","unstructured":"Lin , F. and Wang , K . 1999. From causal theories to logic programs (sometimes) . In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. Lacture Notes in Ccomputer Science , vol. 1730 , Springer Verlag. 117--131. Lin, F. and Wang, K. 1999. From causal theories to logic programs (sometimes). In Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning. Lacture Notes in Ccomputer Science, vol. 1730, Springer Verlag. 117--131."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00227-8"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the 7th International Conference on Logic Programming. MIT Press","author":"Przymusinski T.","year":"1990","unstructured":"Przymusinski , T. 1990 . Extended stable semantics for normal and disjunctive logic programs . In Proceedings of the 7th International Conference on Logic Programming. MIT Press , Cambridge, MA. 459--477. Przymusinski, T. 1990. Extended stable semantics for normal and disjunctive logic programs. In Proceedings of the 7th International Conference on Logic Programming. MIT Press, Cambridge, MA. 459--477."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(90)90032-Z"},{"volume-title":"Proceedings of the 8th International Conference on Logic Programming. MIT Press","author":"Satoh K.","key":"e_1_2_1_27_1","unstructured":"Satoh , K. and Iwayama , N . 1991. Computing abduction using the TMS . In Proceedings of the 8th International Conference on Logic Programming. MIT Press , Cambridge, MA. 505--518. Satoh, K. and Iwayama, N. 1991. Computing abduction using the TMS. In Proceedings of the 8th International Conference on Logic Programming. MIT Press, Cambridge, MA. 505--518."},{"volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press","author":"Satoh K.","key":"e_1_2_1_28_1","unstructured":"Satoh , K. and Iwayama , R . 1992. A query evaluation method for abductive logic programming . In Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press , Cambridge, MA. 671--685. Satoh, K. and Iwayama, R. 1992. A query evaluation method for abductive logic programming. In Proceedings of the Joint International Conference and Symposium on Logic Programming. MIT Press, Cambridge, MA. 671--685."},{"key":"e_1_2_1_29_1","volume-title":"Smodels: A system for computing the stable models of logic programs, version 2.26","author":"Simons P.","year":"2000","unstructured":"Simons , P. 2000 . Smodels: A system for computing the stable models of logic programs, version 2.26 . http:\/\/www.tcs.hut.fi\/Software\/smodels\/. Simons, P. 2000. Smodels: A system for computing the stable models of logic programs, version 2.26. http:\/\/www.tcs.hut.fi\/Software\/smodels\/."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)00023-Y"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1227839.1227841","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1227839.1227841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:21Z","timestamp":1750282881000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1227839.1227841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,4]]}},"alternative-id":["10.1145\/1227839.1227841"],"URL":"https:\/\/doi.org\/10.1145\/1227839.1227841","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2007,4]]},"assertion":[{"value":"2007-04-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}