Approximating operators and semantics for abstract dialectical frameworks

DOI10.1016/j.artint.2013.09.004zbMath1334.68212OpenAlexW2023808640MaRDI QIDQ490444

Hannes Strass

Publication date: 27 August 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2013.09.004

zbMATH Keywords

approximationsnonmonotonic reasoninglogic programmingfixpoint semanticsabstract argumentation frameworksabstract dialectical frameworks

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (27)

On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ A Formal Theory of Justifications ⋮ Safe inductions and their applications in knowledge representation ⋮ Probabilistic Abstract Dialectical Frameworks ⋮ Lattice point of view for argumentation framework ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Range-based argumentation semantics as two-valued models ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs ⋮ Fixpoint semantics for active integrity constraints ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ Theory of semi-instantiation in abstract argumentation ⋮ A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence ⋮ Judgment Aggregation in Abstract Dialectical Frameworks ⋮ Realizability of three-valued semantics for abstract dialectical frameworks ⋮ EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface ⋮ Flexible Approximators for Approximating Fixpoint Theory ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ Understanding the Abstract Dialectical Framework ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages ⋮ On three-valued acceptance conditions of abstract dialectical frameworks

Uses Software

• Carneades

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semi-equilibrium models for paracoherent answer set programs
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Reasoning about preferences in argumentation frameworks
• On the evaluation of argumentation formalisms
• The carneades model of argument and burden of proof
• Semantical considerations on nonmonotonic logic
• On the relation between default and autoepistemic logic
• A logic for default reasoning
• An argumentation framework in default logic
• Fixpoint semantics for logic programming a survey
• Uniform semantic treatment of default and autoepistemic logics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• On the intertranslatability of non-monotonic logics
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Logical modes of attack in argumentation networks
• A lattice-theoretical fixpoint theorem and its applications
• On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
• Instantiating Knowledge Bases in Abstract Dialectical Frameworks
• Argumentation and Answer Set Programming
• A Schema for Generating Relevant Logic Programming Semantics and its Applications in Argumentation Theory
• On the Issue of Reinstatement in Argumentation
• Robust semantics for argumentation frameworks
• Deterministic and non-deterministic stable models
• Translating default logic into standard autoepistemic logic
• A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments

This page was built for publication: Approximating operators and semantics for abstract dialectical frameworks