{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T22:17:12Z","timestamp":1700173032699},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2002,11,13]],"date-time":"2002-11-13T00:00:00Z","timestamp":1037145600000},"content-version":"unspecified","delay-in-days":12,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2002,11]]},"abstract":"In this paper, we consider an approach to update nonmonotonic knowledge bases represented \nas extended logic programs under the answer set semantics. In this approach, new information \nis incorporated into the current knowledge base subject to a causal rejection principle, which \nenforces that, in case of conflicts between rules, more recent rules are preferred and older \nrules are overridden. Such a rejection principle is also exploited in other approaches to update \nlogic programs, notably in the method of dynamic logic programming, due to Alferes et al.<\/jats:italic><\/jats:p>One of the central issues of this paper is a thorough analysis of various properties \nof the current approach, in order to get a better understanding of the inherent causal \nrejection principle. For this purpose, we review postulates and principles for update and \nrevision operators which have been proposed in the area of theory change and nonmonotonic \nreasoning. Moreover, some new properties for approaches to updating logic programs are \nconsidered as well. Like related update approaches, the current semantics does not incorporate \na notion of minimality of change<\/jats:italic>, so we consider refinements of the semantics in this direction. \nWe also investigate the relationship of our approach to others in more detail. In particular, \nwe show that the current approach is semantically equivalent to inheritance programs, which \nhave been independently defined by Buccafurri et al.<\/jats:italic>, and that it coincides with certain classes \nof dynamic logic programs. In view of this analysis, most of our results about properties of the \ncausal rejection principle apply to each of these approaches as well. Finally, we also deal with \ncomputational issues. Besides a discussion on the computational complexity of our approach, \nwe outline how the update semantics and its refinements can be directly implemented on \ntop of existing logic programming systems. In the present case, we implemented the update \napproach using the logic programming system DLV.<\/jats:p>","DOI":"10.1017\/s1471068401001247","type":"journal-article","created":{"date-parts":[[2002,11,18]],"date-time":"2002-11-18T11:33:55Z","timestamp":1037619235000},"page":"711-767","source":"Crossref","is-referenced-by-count":60,"title":["On properties of update sequences \nbased on causal rejection"],"prefix":"10.1017","volume":"2","author":[{"given":"THOMAS","family":"EITER","sequence":"first","affiliation":[]},{"given":"MICHAEL","family":"FINK","sequence":"additional","affiliation":[]},{"given":"GIULIANA","family":"SABBATINI","sequence":"additional","affiliation":[]},{"given":"HANS","family":"TOMPITS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,11,13]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068401001247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T00:24:20Z","timestamp":1557188660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068401001247\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"alternative-id":["S1471068401001247"],"URL":"https:\/\/doi.org\/10.1017\/s1471068401001247","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}