{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T21:00:41Z","timestamp":1758402041275},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"content-version":"unspecified","delay-in-days":0,"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":[[2007,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We have studied the update operator \u2295<jats:sub>1<\/jats:sub> defined for update sequences by Eiter <jats:italic>et al<\/jats:italic>. without tautologies and we have observed that it satisfies an interesting property. This property, which we call Weak Independence of Syntax (WIS), is similar to one of the postulates proposed by Alchourr\u00f3n, G\u00e4rdenfors, and Makinson (AGM); only that in this case it applies to nonmonotonic logic. In addition, we consider other five additional basic properties about update programs and we show that \u2295<jats:sub>1<\/jats:sub> satisfies them. This work continues the analysis of the AGM postulates with respect to the \u2295<jats:sub>1<\/jats:sub> operator under a refined view that considers <jats:bold>N<jats:sub>2<\/jats:sub><\/jats:bold> as a monotonic logic which allows us to expand our understanding of answer sets. Moreover, <jats:bold>N<jats:sub>2<\/jats:sub><\/jats:bold> helped us to derive an alternative definition of \u2295<jats:sub>1<\/jats:sub> avoiding the use of unnecessary extra atoms.<\/jats:p>","DOI":"10.1017\/s1471068406003000","type":"journal-article","created":{"date-parts":[[2007,6,19]],"date-time":"2007-06-19T14:25:47Z","timestamp":1182263147000},"page":"451-479","source":"Crossref","is-referenced-by-count":15,"title":["Updates in answer set programming: An approach based on basic structural properties"],"prefix":"10.1017","volume":"7","author":[{"given":"MAURICIO","family":"OSORIO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00cdCTOR","family":"CUEVAS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2007,7,1]]},"reference":[{"key":"S1471068406003000_ref30","first-page":"465","article-title":"Constructive propositional calculus with strong negation","volume":"85","author":"Vorob'ev","year":"1952","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"S1471068406003000_ref29","volume-title":"Alternatives to Classical Logic","volume":"3","author":"van Dalen","year":"1986"},{"key":"S1471068406003000_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10015-8"},{"key":"S1471068406003000_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-015-9309-0_8"},{"key":"S1471068406003000_ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24627-5_15"},{"key":"S1471068406003000_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45632-5_15"},{"key":"S1471068406003000_ref19","first-page":"70","volume-title":"Answer Set Programming: Advances in Theory and Implementation ASP'05","author":"Ortiz","year":"2005"},{"key":"S1471068406003000_ref18","doi-asserted-by":"publisher","DOI":"10.2307\/2268973"},{"key":"S1471068406003000_ref8","first-page":"1070","volume-title":"5th Conference on Logic Programming","author":"Gelfond","year":"1988"},{"key":"S1471068406003000_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-7288-6"},{"key":"S1471068406003000_ref28","volume-title":"An Algebraic Approach to Non-Classical Logics","author":"Rasiowa","year":"1974"},{"key":"S1471068406003000_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001881"},{"key":"S1471068406003000_ref24","volume-title":"Proceedings of the Fourth Mexican International Conference on Computer Science (ENC'03) Workshop on Logic and Agents","author":"Osorio","year":"2003"},{"key":"S1471068406003000_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02121114"},{"key":"S1471068406003000_ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2274239"},{"key":"S1471068406003000_ref15","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068406003000_ref4","volume-title":"Progress in Artificial Intelligence: 12th Portuguese Conference on Artificial Intelligence, EPIA 2005","author":"Banti","year":"2005"},{"key":"S1471068406003000_ref3","volume-title":"Nonmonotonic Reasoning, Action, and Change (NRAC'03)","author":"Banti","year":"2003"},{"key":"S1471068406003000_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"key":"S1471068406003000_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001923"},{"key":"S1471068406003000_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401001247"},{"key":"S1471068406003000_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/11533092_5"},{"key":"S1471068406003000_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S1471068406003000_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.06.012"},{"key":"S1471068406003000_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(91)90069-V"},{"key":"S1471068406003000_ref31","first-page":"689","article-title":"The problem of deducibility in constructive propositional calculus with strong negation","volume":"85","author":"Vorob'ev","year":"1952","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"S1471068406003000_ref20","first-page":"57","volume-title":"Logic Based Program Synthesis and Transformation. 11th International Workshop, LOPSTR 2001","author":"Osorio","year":"2001"},{"key":"S1471068406003000_ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526664.007"},{"key":"S1471068406003000_ref14","doi-asserted-by":"crossref","unstructured":"Kracht M. 1998. On extensions of intermediate logics by strong negation. Journal of Philosophical Logic: 49\u201373.","DOI":"10.1023\/A:1004222213212"},{"key":"S1471068406003000_ref16","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018978005636"},{"key":"S1471068406003000_ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.apal.2004.06.012"}],"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\/S1471068406003000","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T18:52:47Z","timestamp":1554058367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068406003000\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["S1471068406003000"],"URL":"https:\/\/doi.org\/10.1017\/s1471068406003000","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}