{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:36:20Z","timestamp":1750221380429,"version":"3.41.0"},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,4,30]],"date-time":"2018-04-30T00:00:00Z","timestamp":1525046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP130102302"],"award-info":[{"award-number":["DP130102302"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Comput. Logic"],"published-print":{"date-parts":[[2018,4,30]]},"abstract":"<jats:p>Recent methods have adapted the well-established AGM and belief base frameworks for belief change to cover belief revision in logic programs. In this study here, we present two new sets of belief change operators for logic programs. They focus on preserving the explicit relationships expressed in the rules of a program, a feature that is missing in purely semantic approaches that consider programs only in their entirety. In particular, operators of the latter class fail to satisfy preservation and support, two important properties for belief change in logic programs required to ensure intuitive results.<\/jats:p>\n          <jats:p>We address this shortcoming of existing approaches by introducing partial meet and ensconcement constructions for logic program belief change, which allow us to define syntax-preserving operators for satisfying preservation and support. Our work is novel in that our constructions not only preserve more information from a logic program during a change operation than existing ones, but they also facilitate natural definitions of contraction operators, the first in the field to the best of our knowledge.<\/jats:p>\n          <jats:p>To evaluate the rationality of our operators, we translate the revision and contraction postulates from the AGM and belief base frameworks to the logic programming setting. We show that our operators fully comply with the belief base framework and formally state the interdefinability between our operators. We further compare our approach to two state-of-the-art logic program revision methods and demonstrate that our operators address the shortcomings of one and generalise the other method.<\/jats:p>","DOI":"10.1145\/3190783","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T12:15:27Z","timestamp":1526040927000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Syntax-Preserving Belief Change Operators for Logic Programs"],"prefix":"10.1145","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1346-5590","authenticated-orcid":false,"given":"Sebastian","family":"Binnewies","sequence":"first","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Zhuang","sequence":"additional","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kewen","family":"Wang","sequence":"additional","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bela","family":"Stantic","sequence":"additional","affiliation":[{"name":"Griffith University, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2274239"},{"volume-title":"Partial meet revision and contraction in logic programs. In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI\u201915)","year":"2015","author":"Binnewies Sebastian","key":"e_1_2_1_2_1"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00015-6"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2016.06.010"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/234286.1057820"},{"volume-title":"Proceedings of the 7th National Conference on Artificial Intelligence. 475--479","year":"1988","author":"Dalal Mukesh","key":"e_1_2_1_6_1"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000281"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40564-8_27"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001539"},{"volume-title":"Logic Programming and Nonmonotonic Reasoning","series-title":"Lecture Notes in Computer Science","author":"Delgrande James P.","key":"e_1_2_1_10_1"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.0824-7935.2004.00240.x"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2480759.2480766"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(79)90008-0"},{"key":"e_1_2_1_14_1","first-page":"1","article-title":"Model-based recasting in answer-set programming","volume":"23","author":"Eiter Thomas","year":"2013","journal-title":"J. App. Non-Class. Logics"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001247"},{"volume-title":"Logic Programming and Nonmonotonic Reasoning","series-title":"Lecture Notes in Computer Science","author":"Eiter Thomas","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/588058.588100"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exm093"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00284974"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01066356"},{"key":"e_1_2_1_21_1","first-page":"203","article-title":"An epistemic approach to conditionals","volume":"18","author":"G\u00e4rdenfors Peter","year":"1981","journal-title":"Amer. Philos. Quart."},{"volume-title":"Knowledge in Flux: Modeling the Dynamics of Epistemic States","author":"G\u00e4rdenfors Peter","key":"e_1_2_1_22_1"},{"volume-title":"Proceedings of the 5h International Conference on Logic Programming. 1070--1080","year":"1988","author":"Gelfond Michael","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1755-2567.1989.tb00725.x"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370186"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01054039"},{"key":"e_1_2_1_27_1","first-page":"1","article-title":"Semi-revision","volume":"7","author":"Hansson Sven Ove","year":"1997","journal-title":"J. Appl. Non-Class. Logics"},{"volume-title":"A Textbook of Belief Dynamics. Theory Change and Database Updating","author":"Hansson Sven Ove","key":"e_1_2_1_28_1"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1086\/psaprocbienmeetp.1976.2.192397"},{"volume-title":"Logics in Artificial Intelligence","series-title":"Lecture Notes in Computer Science","author":"Inoue Katsumi","key":"e_1_2_1_30_1"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90069-V"},{"volume-title":"Mendelzon","year":"1992","author":"Katsuno Hirofumi","key":"e_1_2_1_32_1"},{"volume-title":"Proceedings of the IFIP Congress. 569--574","year":"1974","author":"Kowalski Robert","key":"e_1_2_1_33_1"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33353-8_23"},{"volume-title":"Logic Programming and Knowledge Representation","series-title":"Lecture Notes in Computer Science","author":"Leite Jo\u00e3o Alexandre","key":"e_1_2_1_35_1"},{"volume-title":"Dispositions.","author":"Levi Isaac","key":"e_1_2_1_36_1"},{"volume-title":"Credal Probability, and Chance","author":"Levi Isaac","key":"e_1_2_1_37_1"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"volume-title":"Foundations of Logic Programming","author":"Lloyd John W.","key":"e_1_2_1_39_1"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00431184"},{"key":"e_1_2_1_41_1","first-page":"1","article-title":"Screened revision","volume":"63","author":"Makinson David","year":"1997","journal-title":"Theoria"},{"volume-title":"Proceedings of the Symposium on Mechanisation of Thought Processes. 77--84","year":"1958","author":"McCarthy John","key":"e_1_2_1_42_1"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01049408"},{"volume-title":"Multiple contraction. A further case against G\u00e4rdenfors","author":"Nieder\u00e9e Reinhard","key":"e_1_2_1_44_1"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068406003000"},{"volume-title":"Logics in Artificial Intelligence","series-title":"Lecture Notes in Computer Science","author":"Rott Hans","key":"e_1_2_1_46_1"},{"volume-title":"Proceedings of the International Conference on Fifth Generation Computer Systems. 455--462","year":"1988","author":"Satoh Ken","key":"e_1_2_1_47_1"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001844"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000101"},{"volume-title":"Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201912)","year":"2012","author":"Slota Martin","key":"e_1_2_1_51_1"},{"key":"e_1_2_1_52_1","first-page":"1","article-title":"The rise and fall of semantic rule updates based on SE-models","volume":"14","author":"Slota Martin","year":"2013","journal-title":"Theory Pract. Logic Program."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001819"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10992-011-9178-2"},{"volume-title":"Logics in Artificial Intelligence","series-title":"Lecture Notes in Computer Science","author":"Williams Mary-Anne","key":"e_1_2_1_55_1"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622655.1622661"},{"volume-title":"Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI\u201916)","year":"2016","author":"Zhuang Zhiqiang","key":"e_1_2_1_57_1"}],"container-title":["ACM Transactions on Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3190783","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3190783","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:50Z","timestamp":1750213610000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3190783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,30]]},"references-count":56,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4,30]]}},"alternative-id":["10.1145\/3190783"],"URL":"https:\/\/doi.org\/10.1145\/3190783","relation":{},"ISSN":["1529-3785","1557-945X"],"issn-type":[{"type":"print","value":"1529-3785"},{"type":"electronic","value":"1557-945X"}],"subject":[],"published":{"date-parts":[[2018,4,30]]},"assertion":[{"value":"2017-01-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-05-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}