{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T22:34:40Z","timestamp":1759617280231},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"type":"print","value":"9781643685342"},{"type":"electronic","value":"9781643685359"}],"license":[{"start":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T00:00:00Z","timestamp":1724716800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,8,27]]},"abstract":"<jats:p>Dialectical Classical Logic Argumentation (D-Cl-Arg) formalises maxi-consistent non-monotonic reasoning under the practical assumption that agents have bounded resources for classical inference, and that agents do not typically check arguments\u2019 premises for subset minimality and consistency. However, D-Cl-Arg still satisfies all rationality postulates. Moreover D-Cl-Arg accommodates uses of argument characteristic of dialectical practice. This paper extends D-Cl-Arg to accommodate further dialectical uses of argument; in particular unrestricted rebuts on the deductively derived conclusions of arguments, and Occam Razor defeats that dialectically demonstrate that an argument makes use of redundant premises. We show that all rationality postulates are still satisfied, while relaxing constraints on preference relations that were previously required to prove rationality.<\/jats:p>","DOI":"10.3233\/faia240309","type":"book-chapter","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:54:11Z","timestamp":1726473251000},"source":"Crossref","is-referenced-by-count":0,"title":["Extending Dialectical Classical Logic Argumentation with Unrestricted Rebut and Occam Razor Defeats"],"prefix":"10.3233","author":[{"given":"Marcello","family":"D\u2019Agostino","sequence":"first","affiliation":[{"name":"Department of Philosophy, University of Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Modgil","sequence":"additional","affiliation":[{"name":"Department of Informatics, King\u2019s College London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA240309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T07:54:13Z","timestamp":1726473253000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA240309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,27]]},"ISBN":["9781643685342","9781643685359"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia240309","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"type":"print","value":"0922-6389"},{"type":"electronic","value":"1879-8314"}],"subject":[],"published":{"date-parts":[[2024,8,27]]}}}