{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T04:46:31Z","timestamp":1758343591217,"version":"3.44.0"},"reference-count":61,"publisher":"Oxford University Press (OUP)","issue":"7","license":[{"start":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:00:00Z","timestamp":1725580800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>In the setting of Defeasible Logic, we deal with the problem of revising and contracting a non-monotonic theory while minimizing the number of rules to be removed from the theory itself. The process is based on the notions of a set of rules being necessary and sufficient in order to prove a claim. The substantial difference among classical and non-monotonic reasoning processes makes this issue significant in order to achieve the correct revision processes. We show that the process is however computationally hard, and can be solved in polynomial time on non-deterministic machines.<\/jats:p>","DOI":"10.1093\/logcom\/exae044","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:14:59Z","timestamp":1725585299000},"source":"Crossref","is-referenced-by-count":0,"title":["Revising non-monotonic theories with sufficient and necessary conditions: the case of Defeasible Logic"],"prefix":"10.1093","volume":"35","author":[{"given":"Francesco","family":"Olivieri","sequence":"first","affiliation":[{"name":"Brisbane , 4000 QLD, Australia"}]},{"given":"Matteo","family":"Cristani","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Verona, Verona, 37134, Italy"}]},{"given":"Guido","family":"Governatori","sequence":"additional","affiliation":[{"name":"Artificial Intelligence and Cyber Futures Institute , Charles Sturt University, Bathurst, NSW, 2795, Australia"}]},{"given":"Luca","family":"Pasetto","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Luxembourg, Esch-sur-Alzette, 4365, Luxembourg"}]},{"given":"Antonino","family":"Rotolo","sequence":"additional","affiliation":[{"name":"Department of Juridical Science , University of Bologna, Bologna, 40100, Italy"}]},{"given":"Simone","family":"Scannapieco","sequence":"additional","affiliation":[{"name":"Real T. s.r.l. , Verona, 37100, Italy"}]},{"given":"Claudio","family":"Tomazzoli","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Verona, Verona, 37134, Italy"}]},{"given":"Tewabe","family":"Chekole Workneh","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Verona, Verona, 37134, Italy"}]}],"member":"286","published-online":{"date-parts":[[2024,9,6]]},"reference":[{"key":"2025091917091374400_ref1","doi-asserted-by":"crossref","first-page":"510","DOI":"10.2307\/2274239","article-title":"On the logic of theory change: partial meet contraction and revision functions","volume":"50","author":"Alchourr\u00f3n","year":"1985","journal-title":"Journal of Symbolic Logic"},{"key":"2025091917091374400_ref2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/int.20008","article-title":"Defeasible logic with dynamic priorities","volume":"19","author":"Antoniou","year":"2004","journal-title":"International Journal of Intelligent Systems"},{"key":"2025091917091374400_ref3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/371316.371517","article-title":"Representation results for defeasible logic","volume":"2","author":"Antoniou","year":"2001","journal-title":"ACM Transactions on Computational Logic"},{"key":"2025091917091374400_ref4","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1007\/s11225-018-9812-x","article-title":"Truth-tracking by belief revision","volume":"107","author":"Baltag","year":"2019","journal-title":"Studia Logica"},{"key":"2025091917091374400_ref5","first-page":"101","article-title":"Revising nonmonotonic theories: the case of defeasible logic","volume":"1701","author":"Billington","year":"1999","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"2025091917091374400_ref6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00248151","article-title":"Iterated revision and minimal change of conditional beliefs","volume":"25","author":"Boutilier","year":"1996","journal-title":"Journal of Philosophical Logic"},{"key":"2025091917091374400_ref7","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer set programming at a glance","volume":"54","author":"Brewka","year":"2011","journal-title":"Communications of the ACM"},{"key":"2025091917091374400_ref8","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.artint.2018.11.002","article-title":"Strong inconsistency","volume":"267","author":"Brewka","year":"2019","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref9","article-title":"Houdini (unchained): an effective reasoner for defeasible logic","volume-title":"CEUR Workshop Proceedings","author":"Cristani","year":"2022"},{"key":"2025091917091374400_ref10","first-page":"39","article-title":"Changes to temporary norms","volume-title":"ICAIL","author":"Cristani","year":"2017"},{"key":"2025091917091374400_ref11","first-page":"154","article-title":"Automatic synthesis of best practices for energy consumptions","volume-title":"IMIS","author":"Cristani","year":"2016"},{"key":"2025091917091374400_ref12","first-page":"885","article-title":"Defeasible reasoning about electric consumptions","volume-title":"30th IEEE International Conference on Advanced Information Networking and Applications","author":"Cristani","year":"2016"},{"key":"2025091917091374400_ref13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(96)00038-0","article-title":"On the logic of iterated belief revision","volume":"89","author":"Darwiche","year":"1997","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref14","first-page":"264","article-title":"Agm-style belief revision of logic programs under answer set semantics","volume-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8148 LNAI","author":"Delgrande","year":"2013"},{"key":"2025091917091374400_ref15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2014.08.006","article-title":"Belief revision in horn theories","volume":"218","author":"Delgrande","year":"2015","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3203409","article-title":"General belief revision","volume":"65","author":"Delgrande","year":"2018","journal-title":"Journal of the ACM"},{"key":"2025091917091374400_ref17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ijar.2017.11.013","article-title":"An extension-based approach to belief revision in abstract argumentation","volume":"93","author":"Diller","year":"2018","journal-title":"International Journal of Approximate Reasoning"},{"key":"2025091917091374400_ref18","first-page":"450","article-title":"Faster exact solutions for some np-hard problems","volume":"1643","author":"Drori","year":"1999","journal-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"},{"key":"2025091917091374400_ref19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"77","author":"Dung","year":"1995","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10992-011-9217-z","article-title":"Stratified belief bases revision with argumentative inference","volume":"42","author":"Falappa","year":"2013","journal-title":"Journal of Philosophical Logic"},{"key":"2025091917091374400_ref21","first-page":"181","article-title":"Computing private international law","volume":"346","author":"Governatori","year":"2021","journal-title":"Frontiers in Artificial Intelligence and Applications"},{"key":"2025091917091374400_ref22","first-page":"104","article-title":"Superiority based revision of defeasible theories","volume-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6403 LNCS","author":"Governatori","year":"2010"},{"key":"2025091917091374400_ref23","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/jigpal\/jzp075","article-title":"Changing legal systems: legal abrogations and annulments in defeasible logic","volume":"18","author":"Governatori","year":"2009","journal-title":"Logic Journal of the IGPL"},{"key":"2025091917091374400_ref24","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1093\/logcom\/14.5.675","article-title":"Argumentation semantics for defeasible logics","volume":"14","author":"Governatori","year":"2004","journal-title":"Journal of Logic and Computation"},{"key":"2025091917091374400_ref25","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.ijar.2018.10.020","article-title":"Revision of defeasible preferences","volume":"104","author":"Governatori","year":"2019","journal-title":"International Journal of Approximate Reasoning"},{"key":"2025091917091374400_ref26","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s10992-013-9295-1","article-title":"Computing strong and weak permissions in defeasible logic","volume":"42","author":"Governatori","year":"2013","journal-title":"Journal of Philosophical Logic"},{"key":"2025091917091374400_ref27","first-page":"399","article-title":"Strategic argumentation is np-complete","volume-title":"21st European Conference on Artificail Intelligence","author":"Governatori","year":"2014"},{"key":"2025091917091374400_ref28","first-page":"399","article-title":"Strategic argumentation is np-complete","volume-title":"21st European Conference on Artificial Intelligence","author":"Governatori","year":"2014"},{"key":"2025091917091374400_ref29","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1017\/S1471068416000053","article-title":"The rationale behind the concept of goal","volume":"16","author":"Governatori","year":"2016","journal-title":"Theory and Practice of Logic Programming"},{"key":"2025091917091374400_ref30","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1093\/jigpal\/jzp006","article-title":"A defeasible logic for modelling policy-based intentions and motivational attitudes","volume":"17","author":"Governatori","year":"2009","journal-title":"Logic Journal of the IGPL"},{"key":"2025091917091374400_ref31","first-page":"63","article-title":"Legal contractions: a logical analysis","volume-title":"International Conference on Artificial Intelligence and Law","author":"Governatori","year":"2013"},{"key":"2025091917091374400_ref32","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/11663081.2023.2244359","article-title":"Postulate satisfaction for inconsistency measures in monotonic logics and databases","volume":"33","author":"Grant","year":"2023","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2025091917091374400_ref33","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10472-021-09740-8","article-title":"General information spaces: measuring inconsistency, rationality postulates, and complexity","volume":"90","author":"Grant","year":"2022","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2025091917091374400_ref34","first-page":"203","article-title":"An epistemic approach to conditionals","volume":"18","author":"G\u00e4rdenfors","year":"1981","journal-title":"American Philosophical Quarterly"},{"key":"2025091917091374400_ref35","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01580442","article-title":"Facet of regular 0-1 polytopes","volume":"8","author":"Hammer","year":"1975","journal-title":"Mathematical Programming"},{"key":"2025091917091374400_ref36","doi-asserted-by":"crossref","first-page":"103876","DOI":"10.1016\/j.artint.2023.103876","article-title":"Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks","volume":"317","author":"Heyninck","year":"2023","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref37","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1023\/A:1026110129951","article-title":"A thorough axiomatization of a principle of conditional preservation in belief revision","volume":"40","author":"Kern-Isberner","year":"2004","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2025091917091374400_ref38","first-page":"161","article-title":"Taxonomy of improvement operators and the problem of minimal change","author":"Konieczny","year":"2010","journal-title":"Proceedings of the International Conference on Knowledge Representation and Reasoning"},{"key":"2025091917091374400_ref39","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF00485649","article-title":"Subjunctives, dispositions and chances","volume":"34","author":"Levi","year":"1977","journal-title":"Synthese"},{"key":"2025091917091374400_ref40","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1017\/S1471068411000603","article-title":"Dynamics of knowledge in DeLP through argument theory change","volume":"13","author":"Moguillansky","year":"2013","journal-title":"Theory and Practice of Logic Programming"},{"key":"2025091917091374400_ref41","article-title":"Defeasible logic","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"Nute","year":"1987"},{"key":"2025091917091374400_ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-75775-5_6","article-title":"Computing defeasible meta-logic","volume":"12678","author":"Olivieri","year":"2021","journal-title":"Lecture Notes in Computer Science"},{"key":"2025091917091374400_ref43","first-page":"603","article-title":"Compliant business processes with exclusive choices from agent specification","volume-title":"PRIMA","author":"Olivieri","year":"2015"},{"key":"2025091917091374400_ref44","first-page":"261","article-title":"Deontic meta-rules","volume":"34","author":"Olivieri","year":"2024","journal-title":"Journal of Logic and Computation"},{"key":"2025091917091374400_ref45","first-page":"594","article-title":"Resource-driven substructural defeasible logic","volume-title":"PRIMA","author":"Olivieri","year":"2018"},{"key":"2025091917091374400_ref46","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1017\/S1471068406003000","article-title":"Updates in answer set programming: an approach based on basic structural properties","volume":"7","author":"Osorio","year":"2007","journal-title":"Theory and Practice of Logic Programming"},{"key":"2025091917091374400_ref47","doi-asserted-by":"crossref","first-page":"103884","DOI":"10.1016\/j.artint.2023.103884","article-title":"On measuring inconsistency in definite and indefinite databases with denial constraints","volume":"318","author":"Parisi","year":"2023","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref48","article-title":"On the comparison of theories: preferring the most specific explanation","volume-title":"Proceedings of the 9th International Joint Conference on Artificial Intelligence (IJCAI)","author":"Poole","year":"1985"},{"key":"2025091917091374400_ref49","first-page":"299","article-title":"Kernel contraction and the order of relevance","volume-title":"19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022","author":"Ribeiro","year":"2022"},{"key":"2025091917091374400_ref50","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.artint.2013.06.001","article-title":"Minimal change: relevance and recovery revisited","volume":"201","author":"Ribeiro","year":"2013","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref51","first-page":"336","article-title":"Argument theory change: revision upon warrant","volume-title":"Computational Models of Argument","author":"Rotstein","year":"2008"},{"key":"2025091917091374400_ref52","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0004-3702(00)00054-0","article-title":"Prioritized logic programming and its application to commonsense reasoning","volume":"123","author":"Sakama","year":"2000","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref53","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0004-3702(92)90069-A","article-title":"A mathematical treatment of defeasible reasoning and its implementation","volume":"53","author":"Simari","year":"1992","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref54","first-page":"2089","article-title":"Argument revision","volume":"27","author":"Snaith","year":"2017","journal-title":"Journal of Logic and Computation"},{"key":"2025091917091374400_ref55","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3166\/jancl.13.87-113","article-title":"Computing generalized specificity","volume":"13","author":"Stolzenburg","year":"2003","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"2025091917091374400_ref56","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/s10992-006-9027-x","article-title":"New foundations for a relational theory of theory-revision","volume":"35","author":"Tennant","year":"2006","journal-title":"Journal of Philosophical Logic"},{"key":"2025091917091374400_ref57","doi-asserted-by":"crossref","first-page":"103344","DOI":"10.1016\/j.artint.2020.103344","article-title":"Handling and measuring inconsistency in non-monotonic logics","volume":"286","author":"Ulbricht","year":"2020","journal-title":"Artificial Intelligence"},{"key":"2025091917091374400_ref58","doi-asserted-by":"crossref","first-page":"696","DOI":"10.2178\/jsl\/1122038910","article-title":"Minimal predicates, fixed-points, and definability","volume":"70","author":"Van Benthem","year":"2005","journal-title":"Journal of Symbolic Logic"},{"key":"2025091917091374400_ref59","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10472-015-9471-9","article-title":"A series of revisions of david poole\u2019s specificity","volume":"78","author":"Wirth","year":"2016","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"2025091917091374400_ref60","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ins.2005.01.012","article-title":"The minimization of axiom sets characterizing generalized approximation operators","volume":"176","author":"Yang","year":"2006","journal-title":"Information Sciences"},{"key":"2025091917091374400_ref61","doi-asserted-by":"crossref","first-page":"3032","DOI":"10.1016\/j.ins.2011.02.020","article-title":"On minimization of axiom sets characterizing covering-based approximation operators","volume":"181","author":"Zhang","year":"2011","journal-title":"Information Sciences"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/35\/7\/exae044\/59029380\/exae044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/35\/7\/exae044\/59029380\/exae044.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T21:09:26Z","timestamp":1758316166000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exae044\/7749889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,6]]},"references-count":61,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,9,11]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exae044","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published-other":{"date-parts":[[2025,10]]},"published":{"date-parts":[[2024,9,6]]},"article-number":"exae044"}}