{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T19:46:34Z","timestamp":1773690394683,"version":"3.50.1"},"reference-count":63,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,6,1]],"date-time":"2013-06-01T00:00:00Z","timestamp":1370044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007223","name":"Technische Universitat Wien","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007223","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHA 550\/8-2"],"award-info":[{"award-number":["SCHA 550\/8-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2013,6]]},"abstract":"<jats:p>We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs.<\/jats:p>\n          <jats:p>\n            We first consider belief revision: for logic programs\n            <jats:italic>P<\/jats:italic>\n            and\n            <jats:italic>Q<\/jats:italic>\n            , the goal is to determine a program\n            <jats:italic>R<\/jats:italic>\n            that corresponds to the revision of\n            <jats:italic>P<\/jats:italic>\n            by\n            <jats:italic>Q<\/jats:italic>\n            , denoted\n            <jats:italic>P<\/jats:italic>\n            *\n            <jats:italic>Q<\/jats:italic>\n            . We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision.\n          <\/jats:p>\n          <jats:p>\n            We next consider approaches for merging a set of logic programs,\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            , ...,\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>n<\/jats:sub>\n            . Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>i<\/jats:sub>\n            those models of\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>i<\/jats:sub>\n            that vary the least from models of the other programs. The second approach informally selects those models of a program\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            that are closest to the models of programs\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>1<\/jats:sub>\n            , ...,\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>n<\/jats:sub>\n            . In this case,\n            <jats:italic>P<\/jats:italic>\n            <jats:sub>0<\/jats:sub>\n            can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets.\n          <\/jats:p>\n          <jats:p>Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.<\/jats:p>","DOI":"10.1145\/2480759.2480766","type":"journal-article","created":{"date-parts":[[2013,6,18]],"date-time":"2013-06-18T12:36:08Z","timestamp":1371558968000},"page":"1-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["A Model-Theoretic Approach to Belief Change in Answer Set Programming"],"prefix":"10.1145","volume":"14","author":[{"given":"James","family":"Delgrande","sequence":"first","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Potsdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274239"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00065-5"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-005-0492-y"},{"key":"e_1_2_1_4_1","volume-title":"Reasoning and Declarative Problem Solving","author":"Baral C.","unstructured":"Baral , C. 2003. Knowledge Representation , Reasoning and Declarative Problem Solving . Cambridge University Press . Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.88001"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1992.tb00337.x"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014446411602"},{"key":"e_1_2_1_8_1","volume-title":"Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann","author":"Booth R.","year":"2002","unstructured":"Booth , R. 2002 . Social contraction and belief negotiation . In Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann , San Francisco, 375--384. Booth, R. 2002. Social contraction and belief negotiation. In Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann, San Francisco, 375--384."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Buccafurri F. and Gottlob G. 2002. Multiagent compromises joint fixpoints and stable models. In Computational Logic: Logic Programming and Beyond Essays in Honour of Robert A. Kowalski Part I. Springer 561--585.   Buccafurri F. and Gottlob G. 2002. Multiagent compromises joint fixpoints and stable models. In Computational Logic: Logic Programming and Beyond Essays in Honour of Robert A. Kowalski Part I. Springer 561--585.","DOI":"10.1007\/3-540-45628-7_21"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.877512"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068407003110"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the AAAI National Conference on Artificial Intelligence. 449--479","author":"Dalal M.","year":"1988","unstructured":"Dalal , M. 1988 . Investigations into theory of knowledge base revision . In Proceedings of the AAAI National Conference on Artificial Intelligence. 449--479 . Dalal, M. 1988. Investigations into theory of knowledge base revision. In Proceedings of the AAAI National Conference on Artificial Intelligence. 449--479."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001539"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Delgrande J. Schaub T. and \n      Tompits H\n  . \n  2007\n  . A preference-based framework for updating logic programs. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201907). C. Baral G. Brewka and J. Schlipf Eds. Lecture Notes in Artificial Intelligence vol. \n  4483 Springer-Verlag 71--83.   Delgrande J. Schaub T. and Tompits H. 2007. A preference-based framework for updating logic programs. In Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201907) . C. Baral G. Brewka and J. Schlipf Eds. Lecture Notes in Artificial Intelligence vol. 4483 Springer-Verlag 71--83.","DOI":"10.1007\/978-3-540-72200-7_8"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908)","author":"Delgrande J.","unstructured":"Delgrande , J. , Schaub , T. , Tompits , H. , and Woltran , S . 2008. Belief revision of logic programs under answer set semantics . In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908) . G. Brewka and J. Lang Eds., AAAI Press, 411--421. Delgrande, J., Schaub, T., Tompits, H., and Woltran, S. 2008. Belief revision of logic programs under answer set semantics. In Proceedings of the 11th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201908). G. Brewka and J. Lang Eds., AAAI Press, 411--421."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_17"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90018-S"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.05.002"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001247"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001753"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI\u201905)","author":"Eiter T.","unstructured":"Eiter , T. , Tompits , H. , and Woltran , S . 2005. On solution correspondences in answer set programming . In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI\u201905) . 97--102. Eiter, T., Tompits, H., and Woltran, S. 2005. On solution correspondences in answer set programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI\u201905). 97--102."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020308080246"},{"key":"e_1_2_1_24_1","volume-title":"Knowledge in Flux: Modelling the Dynamics of Epistemic States","author":"G\u00e4rdenfors P.","unstructured":"G\u00e4rdenfors , P. 1988. Knowledge in Flux: Modelling the Dynamics of Epistemic States . The MIT Press , Cambridge, MA . G\u00e4rdenfors, P. 1988. Knowledge in Flux: Modelling the Dynamics of Epistemic States. The MIT Press, Cambridge, MA."},{"key":"e_1_2_1_25_1","unstructured":"Gebser M. Kaminski R. Kaufmann B. Ostrowski M. Schaub T. and Thiele S. A user\u2019s guide to Gringo clasp Clingo and iClingo. http:\/\/potassco.sourceforge.net.  Gebser M. Kaminski R. Kaufmann B. Ostrowski M. Schaub T. and Thiele S. A user\u2019s guide to Gringo clasp Clingo and iClingo. http:\/\/potassco.sourceforge.net."},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI\u201908)","author":"Gebser M.","unstructured":"Gebser , M. , P\u00fchrer , J. , Schaub , T. , and Tompits , H . 2008. A meta-programming technique for debugging answerset programs . In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI\u201908) . D. Fox and C. Gomes Eds., AAAI Press, 448--453. Gebser, M., P\u00fchrer, J., Schaub, T., and Tompits, H. 2008. A meta-programming technique for debugging answerset programs. In Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI\u201908). D. Fox and C. Gomes Eds., AAAI Press, 448--453."},{"key":"e_1_2_1_27_1","first-page":"4","article-title":"Complex optimization in answer set programming","volume":"11","author":"Gebser M.","year":"2011","unstructured":"Gebser , M. , Kaminski , R. , and Schaub , T. 2011 . Complex optimization in answer set programming . Theory Pract. Logic Program. 11 , 4 -- 5 , 821--839. Gebser, M., Kaminski, R., and Schaub, T. 2011. Complex optimization in answer set programming. Theory Pract. Logic Program. 11, 4--5, 821--839.","journal-title":"Theory Pract. Logic Program."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 5th International Conference and Symposium of Logic Programming (ICLP\u201988)","author":"Gelfond M.","unstructured":"Gelfond , M. and Lifschitz , V . 1988. The stable model semantics for logic programming . In Proceedings of the 5th International Conference and Symposium of Logic Programming (ICLP\u201988) . R. Kowalski and K. Bowen Eds., MIT Press, 1070--1080. Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of the 5th International Conference and Symposium of Logic Programming (ICLP\u201988). R. Kowalski and K. Bowen Eds., MIT Press, 1070--1080."},{"key":"e_1_2_1_29_1","series-title":"Applied Logic Series","volume-title":"A Textbook of Belief Dynamics","author":"Hansson S. O.","unstructured":"Hansson , S. O. 1999. A Textbook of Belief Dynamics . Applied Logic Series . Kluwer Academic Publishers . Hansson, S. O. 1999. A Textbook of Belief Dynamics. Applied Logic Series. Kluwer Academic Publishers."},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI\u201995)","author":"Inoue K.","unstructured":"Inoue , K. and Sakama , C . 1995. Abductive framework for nonomonotonic theory change . In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI\u201995) . Morgan Kaufmann, 204--210. Inoue, K. and Sakama, C. 1995. Abductive framework for nonomonotonic theory change. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI\u201995). Morgan Kaufmann, 204--210."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(97)10001-2"},{"key":"e_1_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Katsuno H. and Mendelzon A. 1992. On the difference between updating a knowledge base and revising it. In Belief Revision P. G\u00e4rdenfors Ed. Cambridge University Press 183--203.  Katsuno H. and Mendelzon A. 1992. On the difference between updating a knowledge base and revising it. In Belief Revision P. G\u00e4rdenfors Ed. Cambridge University Press 183--203.","DOI":"10.1017\/CBO9780511526664.007"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/12.5.773"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann","author":"Konieczny S.","unstructured":"Konieczny , S. , Lang , J. , and Marquis , P . 2002. Distance-based merging: A general framework and some complexity results . In Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann , San Francisco, 97--108. Konieczny, S., Lang, J., and Marquis, P. 2002. Distance-based merging: A general framework and some complexity results. In Proceedings of the 8th International Conference on the Principles of Knowledge Representation and Reasoning. D. Fensel, F. Giunchiglia, D. McGuiness, and M. Williams Eds., Morgan Kaufmann, San Francisco, 97--108."},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Kudo Y.\n     and \n      Murai T\n  . \n  2004\n  . A method of belief base revision for extended logic programs based on state transition diagrams. In Proceedings of the 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES\u201904) Part I. M. G. Negoita R. J. Howlett and L. C. Jain Eds. Lecture Notes in Computer Science vol. \n  3213 Springer 1079--1084.  Kudo Y. and Murai T. 2004. A method of belief base revision for extended logic programs based on state transition diagrams. In Proceedings of the 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES\u201904) Part I. M. G. Negoita R. J. Howlett and L. C. Jain Eds. Lecture Notes in Computer Science vol. 3213 Springer 1079--1084.","DOI":"10.1007\/978-3-540-30132-5_146"},{"key":"e_1_2_1_36_1","volume-title":"Evolving Knowledge Bases: Specification and Semantics","author":"Leite J.","unstructured":"Leite , J. 2003. Evolving Knowledge Bases: Specification and Semantics . IOS Press , Amsterdam . Leite, J. 2003. Evolving Knowledge Bases: Specification and Semantics. IOS Press, Amsterdam."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1149114.1149117"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.667090"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR\u201992)","author":"Lifschitz V.","unstructured":"Lifschitz , V. and Woo , T . 1992. Answer sets in general nonmonotonic reasoning (preliminary report) . In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR\u201992) . B. Nebel, C. Rich, and W. Swartout Eds., Morgan Kaufmann Publishers, 603--614. Lifschitz, V. and Woo, T. 1992. Answer sets in general nonmonotonic reasoning (preliminary report). In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR\u201992). B. Nebel, C. Rich, and W. Swartout Eds., Morgan Kaufmann Publishers, 603--614."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"Lin J. and Mendelzon A. 1999. Knowledge base merging by majority. In Dynamic Worlds: From the Frame Problem to Knowledge Management R. Pareschi and B. Fronh\u00f6fer Eds. Kluwer 195--218.  Lin J. and Mendelzon A. 1999. Knowledge base merging by majority. In Dynamic Worlds: From the Frame Problem to Knowledge Management R. Pareschi and B. Fronh\u00f6fer Eds. Kluwer 195--218.","DOI":"10.1007\/978-94-017-1317-7_6"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00092-3"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.3166\/jancl.11.59-84"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.2307\/2268973"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406003000"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_15"},{"key":"e_1_2_1_47_1","volume-title":"Proceedings of the 2nd International Workshop on Answer Set Programming (ASP\u201903)","volume":"78","author":"Osorio M.","unstructured":"Osorio , M. and Zepeda , C . 2003. Towards the use of semantics contents in ASP for planning and diagnostic in GIS . In Proceedings of the 2nd International Workshop on Answer Set Programming (ASP\u201903) . M. D. Vos and A. Provetti Eds., CEUR Workshop Proceedings , vol. 78 , CEUR-WS.org. Osorio, M. and Zepeda, C. 2003. Towards the use of semantics contents in ASP for planning and diagnostic in GIS. In Proceedings of the 2nd International Workshop on Answer Set Programming (ASP\u201903). M. D. Vos and A. Provetti Eds., CEUR Workshop Proceedings, vol. 78, CEUR-WS.org."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00091-X"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/153850.153857"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001716"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/11750734_18"},{"key":"e_1_2_1_52_1","doi-asserted-by":"crossref","unstructured":"Sakama C.\n     and \n      Inoue K\n  . \n  2007\n  . Constructing consensus logic programs. In Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (Lopstr\u201906). Revised Selected Papers G. Puebla Ed. Lecture Notes in Computer Science vol. \n  4407 Springer 26--42.   Sakama C. and Inoue K. 2007. Constructing consensus logic programs. In Proceedings of the 16th International Symposium on Logic-Based Program Synthesis and Transformation (Lopstr\u201906) . Revised Selected Papers G. Puebla Ed. Lecture Notes in Computer Science vol. 4407 Springer 26--42.","DOI":"10.1007\/978-3-540-71410-1_4"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1342991.1342993"},{"key":"e_1_2_1_54_1","volume-title":"Proceedings of the International Conference on 5th Generation Computer Systems. 455--462","author":"Satoh K.","year":"1988","unstructured":"Satoh , K. 1988 . Nonmonotonic reasoning by minimal belief revision . In Proceedings of the International Conference on 5th Generation Computer Systems. 455--462 . Satoh, K. 1988. Nonmonotonic reasoning by minimal belief revision. In Proceedings of the International Conference on 5th Generation Computer Systems. 455--462."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00187-X"},{"key":"e_1_2_1_56_1","volume-title":"Proceedings of the 19th European Conference on Artificial Intelligence (ECAI\u201910)","author":"Slota M.","unstructured":"Slota , M. and Leite , J . 2010. On semantic update operators for answer-set programs . In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI\u201910) . H. Coelho, R. Studer, and M. Wooldridge Eds., IOS Press, 957--962. Slota, M. and Leite, J. 2010. On semantic update operators for answer-set programs. In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI\u201910). H. Coelho, R. Studer, and M. Wooldridge Eds., IOS Press, 957--962."},{"key":"e_1_2_1_57_1","volume-title":"Causation in Decision, Belief Change, and Statistics","author":"Spohn W.","unstructured":"Spohn , W. 1988. Ordinal conditional functions: A dynamic theory of epistemic states . In Causation in Decision, Belief Change, and Statistics , W. Harper and B. Skyrms Eds., Vol. II , Kluwer Academic Publishers , 105--134. Spohn, W. 1988. Ordinal conditional functions: A dynamic theory of epistemic states. In Causation in Decision, Belief Change, and Statistics, W. Harper and B. Skyrms Eds., Vol. II, Kluwer Academic Publishers, 105--134."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001819"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/646329.687166"},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 7th International Symposium on Logical Formalizations of Commonsense Reasoning. S. McIlraith, P. Peppas, and M. Thielscher Eds., Fakult\u00e4t f\u00fcr Informatik, ISSN 1430-211X, 213--219","author":"Zacar\u00edas F.","unstructured":"Zacar\u00edas , F. , Osorio , M. , Acosta Guadarrama , J. C. , and Dix , J . 2005. Updates in Answer Set Programming based on structural properties . In Proceedings of the 7th International Symposium on Logical Formalizations of Commonsense Reasoning. S. McIlraith, P. Peppas, and M. Thielscher Eds., Fakult\u00e4t f\u00fcr Informatik, ISSN 1430-211X, 213--219 . Zacar\u00edas, F., Osorio, M., Acosta Guadarrama, J. C., and Dix, J. 2005. Updates in Answer Set Programming based on structural properties. In Proceedings of the 7th International Symposium on Logical Formalizations of Commonsense Reasoning. S. McIlraith, P. Peppas, and M. Thielscher Eds., Fakult\u00e4t f\u00fcr Informatik, ISSN 1430-211X, 213--219."},{"key":"e_1_2_1_61_1","volume-title":"Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI\u201997)","volume":"1","author":"Zhang Y.","unstructured":"Zhang , Y. and Foo , N . 1997. Towards generalized rule-based updates . In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI\u201997) . Vol. 1 , Morgan Kaufmann, 82--88. Zhang, Y. and Foo, N. 1997. Towards generalized rule-based updates. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI\u201997). Vol. 1, Morgan Kaufmann, 82--88."},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.02.002"},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the 13th European Conference on Artificial Intelligence (ECAI\u201998)","author":"Zhang Y.","unstructured":"Zhang , Y. and Foo , N. Y . 1998. Updating logic programs . In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI\u201998) . 403--407. Zhang, Y. and Foo, N. Y. 1998. Updating logic programs. In Proceedings of the 13th European Conference on Artificial Intelligence (ECAI\u201998). 403--407."}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480759.2480766","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480759.2480766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:39:14Z","timestamp":1750235954000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480759.2480766"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["10.1145\/2480759.2480766"],"URL":"https:\/\/doi.org\/10.1145\/2480759.2480766","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"value":"1529-3785","type":"print"},{"value":"1557-945X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,6]]},"assertion":[{"value":"2009-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}