{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T05:26:05Z","timestamp":1740201965754,"version":"3.37.3"},"reference-count":0,"publisher":"IOS Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"abstract":"<jats:p>In a formal argumentation framework, one is interested in whether a particular argument is accepted or not under argumentation semantics. When an argument A is accepted, on the other hand, one may ask a question &amp;ldquo;what if A were rejected?&amp;rdquo; We formulate such counterfactual reasoning in abstract argumentation frameworks. Based on Lewis's logic, we define two counterfactual conditionals in AF and investigate formal properties. We also argue counterfactual dependencies in AF and modal interpretation of AF in terms of counterfactual conditionals.<\/jats:p>","DOI":"10.3233\/978-1-61499-436-7-385","type":"book-chapter","created":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:00Z","timestamp":1740133260000},"source":"Crossref","is-referenced-by-count":0,"title":["Counterfactual Reasoning in Argumentation Frameworks"],"prefix":"10.3233","author":[{"family":"Sakama Chiaki","sequence":"additional","affiliation":[]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","Computational Models of Argument"],"original-title":[],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:26:03Z","timestamp":1740133563000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospressISSNISBN&issn=0922-6389&volume=266&spage=385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/978-1-61499-436-7-385","relation":{},"ISSN":["0922-6389"],"issn-type":[{"value":"0922-6389","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}