An encoding of abstract dialectical frameworks into higher-order logic

DOI10.1093/LOGCOM/EXAD079MaRDI QIDQ6915765zbMATH OpenFDO

Authors Antoine Martina, Alexander Steen

Publication date 15 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAD079

zbMATH Keywords

abstract dialectical frameworksautomated reasoningformal argumentationhigher-order logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A formulation of the simple theory of types.
• A QBF-based formalization of abstract argumentation semantics
• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
• Advanced SAT techniques for abstract argumentation
• An encoding of abstract dialectical frameworks into higher-order logic
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Approximating operators and semantics for abstract dialectical frameworks
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Argumentation and answer set programming
• Argumentation update in YALLA (yet another logic language for argumentation)
• Coherence in finite argument systems.
• Completeness in the theory of types
• Complexity-sensitive decision procedures for abstract argumentation
• Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support
• Extending Sledgehammer with SMT solvers
• Extensional higher-order paramodulation in Leo-III
• scientific article; zbMATH DE number 1809862 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• scientific article; zbMATH DE number 7015113 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• Isabelle/HOL. A proof assistant for higher-order logic
• Nitpick: a counterexample generator for higher-order logic based on a relational model finder
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
• SCC-recursiveness: a general schema for argumentation semantics
• Stage semantics and the SCC-recursive schema for argumentation semantics
• Ultimate approximation and its application in nonmonotonic knowledge representation systems

Cited in

(1)

• An encoding of abstract dialectical frameworks into higher-order logic

This page was built for publication: An encoding of abstract dialectical frameworks into higher-order logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915765)