{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:19:24Z","timestamp":1761401964398},"reference-count":0,"publisher":"AI Access Foundation","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["jair"],"abstract":"<jats:p>Properties like logical closure and consistency are  important properties in any logical reasoning system. Caminada and Amgoud showed that not every logic-based argument system satisfies these relevant properties. But under  conditions like closure under contraposition or transposition of the monotonic part of the underlying logic, ASPIC-like systems satisfy these properties. In contrast, the logical closure and  consistency properties are not well-understood for other  well-known and widely applied systems like logic programming or assumption based argumentation. Though conditions like closure under contraposition or transposition seem intuitive in ASPIC-like systems, they  rule out many sensible ASPIC-like systems that satisfy both properties of closure and consistency.  \n\nWe present a new condition referred to as the self-contradiction axiom that guarantees the consistency property  in both ASPIC-like and assumption-based systems and is implied by both properties of closure under  contraposition or transposition. We develop a logic-associated abstract argumentation framework, by associating abstract argumentation with abstract logics to represent  the conclusions of arguments. We show that logic-associated abstract argumentation frameworks  capture  ASPIC-like systems (without preferences) and assumption-based argumentation. We present two simple and natural properties of  compactness and cohesion in  logic-associated abstract argumentation frameworks and show that they capture  the logical closure and consistency properties. We demonstrate that  in both  assumption-based argumentation and ASPIC-like systems,  cohesion  follows naturally from the self-contradiction axiom. We further give a translation from ASPIC-like systems (without preferences) into equivalent assumption-based systems that keeps the self-contradiction axiom invariant.  <\/jats:p>","DOI":"10.1613\/jair.4107","type":"journal-article","created":{"date-parts":[[2018,7,18]],"date-time":"2018-07-18T14:26:52Z","timestamp":1531924012000},"page":"79-109","source":"Crossref","is-referenced-by-count":26,"title":["Closure and Consistency  In Logic-Associated  Argumentation"],"prefix":"10.1613","volume":"49","author":[{"given":"P. M.","family":"Dung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. M.","family":"Thang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"16860","published-online":{"date-parts":[[2014,1,29]]},"container-title":["Journal of Artificial Intelligence Research"],"original-title":[],"link":[{"URL":"https:\/\/www.jair.org\/index.php\/jair\/article\/download\/10859\/25910","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.jair.org\/index.php\/jair\/article\/download\/10859\/25909","content-type":"application\/postscript","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.jair.org\/index.php\/jair\/article\/download\/10859\/25910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T22:26:03Z","timestamp":1571178363000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jair.org\/index.php\/jair\/article\/view\/10859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,29]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1613\/jair.4107","relation":{},"ISSN":["1076-9757"],"issn-type":[{"value":"1076-9757","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,29]]}}}