{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T12:07:02Z","timestamp":1753877222449,"version":"3.41.2"},"reference-count":51,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T00:00:00Z","timestamp":1704931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,3,8]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>An approach for encoding abstract dialectical frameworks and their semantics into classical higher-order logic is presented. Important properties and semantic relationships are formally encoded and proven using the proof assistant Isabelle\/HOL. This approach allows for the computer-assisted analysis of abstract dialectical frameworks using automated and interactive reasoning tools within a uniform logic environment. Exemplary applications include the formal analysis and verification of meta-theoretical properties, and the generation of interpretations and extensions under specific semantic constraints.<\/jats:p>","DOI":"10.1093\/logcom\/exad079","type":"journal-article","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T06:55:20Z","timestamp":1705042520000},"source":"Crossref","is-referenced-by-count":0,"title":["An encoding of abstract dialectical frameworks into higher-order logic"],"prefix":"10.1093","volume":"35","author":[{"given":"Antoine","family":"Martina","sequence":"first","affiliation":[{"name":"University of Luxembourg, Department of Computer Science , 6, avenue de la Fonte, L-4364 Esch-sur-Alzette, Luxembourg"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Steen","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Greifswald, Institut f\u00fcr Mathematik und Informatik , Walther-Rathenau-Stra\u00dfe 47, 17489 Greifswald, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2024,1,11]]},"reference":[{"key":"2025030912424840900_ref1","first-page":"56","article-title":"Handling inconsistency with preference-based argumentation","author":"Amgoud","year":"2010","journal-title":"In International Conference on Scalable Uncertainty Management"},{"key":"2025030912424840900_ref2","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.jal.2013.03.009","article-title":"A QBF-based formalization of abstract argumentation semantics","volume":"11","author":"Arieli","year":"2013","journal-title":"Journal of Applied Logic"},{"key":"2025030912424840900_ref3","first-page":"159","article-title":"Abstract argumentation frameworks and their semantics","volume-title":"Handbook of Formal Argumentation","author":"Baroni","year":"2018"},{"key":"2025030912424840900_ref4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","article-title":"SCC-recursiveness: a general schema for argumentation semantics","volume":"168","author":"Baroni","year":"2005","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/AAC-200901","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games: 25 years later","volume":"11","author":"Baroni","year":"2020","journal-title":"Argument and Computation"},{"key":"2025030912424840900_ref6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-22110-1_14","article-title":"CVC4","volume-title":"International Conference on Computer Aided Verification","author":"Barrett","year":"2011"},{"key":"2025030912424840900_ref7","first-page":"241","article-title":"A software system using a SAT solver for reasoning under complete, stable, preferred, and grounded argumentation semantics","author":"Beierle","year":"2015","journal-title":"Joint German\/Austrian Conference on Artificial Intelligence (K\u00fcnstliche Intelligenz)"},{"key":"2025030912424840900_ref8","first-page":"1","article-title":"Church\u2019s type theory","author":"Benzm\u00fcller","year":"2019","journal-title":"Stanford Encyclopedia of Philosophy"},{"key":"2025030912424840900_ref9","first-page":"215","article-title":"Automation of higher-order logic","volume-title":"Handbook of the History of Logic, Volume 9, Computational Logic","author":"Benzm\u00fcller","year":"2014"},{"key":"2025030912424840900_ref10","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2020.103348","article-title":"Designing normative theories for ethical and legal reasoning: ref10 framework, methodology, and tool support","volume":"287","author":"Benzm\u00fcller","year":"2020","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref11","first-page":"59","article-title":"Checking the acceptability of a set of arguments","volume-title":"Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004)","author":"Besnard","year":"2004"},{"volume-title":"Handbook of Satisfiability","year":"2009","author":"Biere","key":"2025030912424840900_ref12"},{"key":"2025030912424840900_ref13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10817-013-9278-5","article-title":"Extending sledgehammer with SMT solvers","volume":"51","author":"Blanchette","year":"2013","journal-title":"Journal of Automated Reasoning"},{"key":"2025030912424840900_ref14","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-642-14052-5_11","article-title":"Nitpick: A counterexample generator for higher-order logic based on a relational model finder","volume-title":"International Conference on Interactive Theorem Proving","author":"Blanchette","year":"2010"},{"key":"2025030912424840900_ref15","doi-asserted-by":"crossref","first-page":"2686","DOI":"10.1609\/aaai.v33i01.33012686","article-title":"Weighted abstract dialectical frameworks through the lens of approximation Fixpoint theory","volume":"33","author":"Bogaerts","year":"2019","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"2025030912424840900_ref16","first-page":"237","article-title":"Abstract dialectical frameworks","volume-title":"Handbook of Formal Argumentation","author":"Brewka","year":"2018"},{"key":"2025030912424840900_ref17","first-page":"803","article-title":"Abstract dialectical frameworks revisited","volume-title":"Proceedings of the 23rd International Joint Conference on Artificial Intelligence","author":"Brewka","year":"2013"},{"key":"2025030912424840900_ref18","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v32i1.11545","article-title":"Weighted abstract dialectical frameworks","volume":"32","author":"Brewka","year":"2018","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"2025030912424840900_ref19","first-page":"102","article-title":"Abstract dialectical frameworks","author":"Brewka","year":"2010","journal-title":"In Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning"},{"key":"2025030912424840900_ref20","doi-asserted-by":"crossref","first-page":"2060003:1","DOI":"10.1142\/S0218213020600039","article-title":"Logical encoding of argumentation frameworks with higher-order attacks and evidential supports","volume":"29","author":"Cayrol","year":"2020","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"2025030912424840900_ref21","first-page":"2623","article-title":"Foundations of implementations for formal argumentation","volume":"4","author":"Cerutti","year":"2017","journal-title":"IfCoLog Journal of Logics and Their Applications"},{"key":"2025030912424840900_ref22","doi-asserted-by":"crossref","first-page":"1750002:1","DOI":"10.1142\/S0218213017500026","article-title":"An efficient Java-based solver for abstract argumentation frameworks: jArgSemSAT","volume":"26","author":"Cerutti","year":"2017","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"2025030912424840900_ref23","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"Journal of Symbolic Logic"},{"key":"2025030912424840900_ref24","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ijar.2016.04.003","article-title":"Argumentation update in YALLA (yet another logic language for argumentation)","volume":"75","author":"Dupin","year":"2016","journal-title":"International Journal of Approximate Reasoning"},{"key":"2025030912424840900_ref25","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-1-4615-1567-8_6","article-title":"Approximations, stable operators, well-founded Fixpoints and applications in nonmonotonic reasoning","volume-title":"Logic-Based Artificial Intelligence","author":"Denecker","year":"2000"},{"key":"2025030912424840900_ref26","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.ic.2004.02.004","article-title":"Ultimate approximation and its application in nonmonotonic knowledge representation systems","volume":"192","author":"Denecker","year":"2004","journal-title":"Information and Computation"},{"key":"2025030912424840900_ref27","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1080\/19462166.2015.1036922","article-title":"Reasoning in abstract dialectical frameworks using quantified boolean formulas","volume":"6","author":"Diller","year":"2015","journal-title":"Argument and Computation"},{"key":"2025030912424840900_ref28","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":"2025030912424840900_ref29","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","article-title":"Coherence in finite argument systems","volume":"141","author":"Dunne","year":"2002","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref30","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1093\/logcom\/exu006","article-title":"Stage semantics and the SCC-recursive schema for argumentation semantics","volume":"26","author":"Dvo\u0159\u00e1k","year":"2014","journal-title":"Journal of Logic and Computation"},{"key":"2025030912424840900_ref31","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.artint.2013.10.001","article-title":"Complexity-sensitive decision procedures for abstract argumentation","volume":"206","author":"Dvo\u0159\u00e1k","year":"2014","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref32","first-page":"133","article-title":"Reasoning in argumentation frameworks using quantified Boolean formulas","volume":"6","author":"Egly","year":"2006","journal-title":"Computational Models of Argument: Proceedings of COMMA"},{"key":"2025030912424840900_ref33","first-page":"233","article-title":"The DIAMOND system for computing with abstract dialectical frameworks","volume-title":"Comma","author":"Ellmauthaler","year":"2014"},{"key":"2025030912424840900_ref34","article-title":"Meta-logical investigations in argumentation networks","volume-title":"Studies in Logic - Mathematical Logic and Foundations","author":"Gabbay","year":"2013"},{"key":"2025030912424840900_ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.1.11348","article-title":"On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics","volume":"70","author":"Gaggl","year":"2021","journal-title":"Journal of Artificial Intelligence Research"},{"key":"2025030912424840900_ref36","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2266967","article-title":"Completeness in the theory of types","volume":"15","author":"Henkin","year":"1950","journal-title":"Journal of Symbolic Logic"},{"key":"2025030912424840900_ref37","doi-asserted-by":"crossref","DOI":"10.1016\/j.artint.2022.103697","article-title":"Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving","volume":"307","author":"Linsbichler","year":"2022","journal-title":"Artificial Intelligence"},{"journal-title":"Supplemental Material to the Article: Isabelle\/HOL Sources Files.","article-title":"An encoding of abstract dialectical frameworks into higher-order logic","author":"Martina","key":"2025030912424840900_ref38"},{"key":"2025030912424840900_ref39","first-page":"337","article-title":"Z3: An efficient SMT solver","author":"de Moura","year":"2008","journal-title":"In International Conference on Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"2025030912424840900_ref40","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45949-9","volume-title":"Isabelle\/HOL: A Proof Assistant for Higher-Order Logic.","author":"Nipkow","year":"2002"},{"key":"2025030912424840900_ref41","first-page":"111","article-title":"E \u2013 A brainiac theorem prover","volume":"15","author":"Schulz","year":"2002","journal-title":"AI Communications"},{"key":"2025030912424840900_ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-98197-0","volume-title":"Argumentation in Artificial Intelligence","author":"Simari","year":"2009"},{"key":"2025030912424840900_ref43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s13218-019-00628-8","article-title":"Extensional Paramodulation for higher-order logic and its effective implementation Leo-III","volume":"34","author":"Steen","year":"2020","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"2025030912424840900_ref44","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/s10817-021-09588-x","article-title":"Extensional higher-order Paramodulation in Leo-III","volume":"65","author":"Steen","year":"2021","journal-title":"Journal of Automated Reasoning"},{"key":"2025030912424840900_ref45","doi-asserted-by":"crossref","first-page":"exac027","DOI":"10.1093\/logcom\/exac027","article-title":"A formalisation of abstract argumentation in higher-order logic","volume":"09","author":"Steen","year":"2023","journal-title":"Journal of Logic and Computation"},{"key":"2025030912424840900_ref46","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.artint.2013.09.004","article-title":"Approximating operators and semantics for abstract dialectical frameworks","volume":"205","author":"Strass","year":"2013","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref47","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.artint.2015.05.003","article-title":"Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory","volume":"226","author":"Strass","year":"2015","journal-title":"Artificial Intelligence"},{"key":"2025030912424840900_ref48","doi-asserted-by":"crossref","first-page":"pp. 164","DOI":"10.1007\/978-3-642-20832-4_11","article-title":"Argumentation and answer set programming","author":"Toni","year":"2011","journal-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning"},{"key":"2025030912424840900_ref49","first-page":"138","article-title":"Advanced SAT techniques for abstract argumentation","volume-title":"International Workshop on Computational Logic in Multi-Agent Systems","author":"Wallner","year":"2013"},{"key":"2025030912424840900_ref50","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/11542384_8","article-title":"Isabelle\/Isar","volume-title":"The Seventeen Provers of the World","author":"Wenzel","year":"2006"},{"key":"2025030912424840900_ref51","first-page":"615","article-title":"An argumentation-based approach to handling inconsistencies in DL-lite","author":"Zhang","year":"2009","journal-title":"In Annual Conference on Artificial Intelligence"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/35\/2\/exad079\/55478249\/exad079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/logcom\/article-pdf\/35\/2\/exad079\/55478249\/exad079.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T12:43:10Z","timestamp":1741524190000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/doi\/10.1093\/logcom\/exad079\/7517065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,11]]},"references-count":51,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,3,8]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exad079","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"type":"print","value":"0955-792X"},{"type":"electronic","value":"1465-363X"}],"subject":[],"published-other":{"date-parts":[[2025,3]]},"published":{"date-parts":[[2024,1,11]]},"article-number":"exad079"}}