Approximating operators and semantics for abstract dialectical frameworks
From MaRDI portal
Publication:490444
Recommendations
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
- Understanding the abstract dialectical framework
- Expressiveness of two-valued semantics for abstract dialectical frameworks
- On the equivalence between abstract dialectical frameworks and logic programs
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
Cites work
- scientific article; zbMATH DE number 1418282 (Why is no real title available?)
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- A lattice-theoretical fixpoint theorem and its applications
- A logic for default reasoning
- A schema for generating relevant logic programming semantics and its applications in argumentation theory
- An argumentation framework in default logic
- Answer-set programming encodings for argumentation frameworks
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Argumentation and answer set programming
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Deterministic and non-deterministic stable models
- Fixpoint semantics for logic programming a survey
- Instantiating knowledge bases in abstract dialectical frameworks
- Logical modes of attack in argumentation networks
- On the Issue of Reinstatement in Argumentation
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the evaluation of argumentation formalisms
- On the instantiation of knowledge bases in abstract argumentation frameworks
- On the intertranslatability of non-monotonic logics
- On the relation between default and autoepistemic logic
- Reasoning about preferences in argumentation frameworks
- Robust semantics for argumentation frameworks
- Semantical considerations on nonmonotonic logic
- Semi-equilibrium models for paracoherent answer set programs
- The carneades model of argument and burden of proof
- Translating default logic into standard autoepistemic logic
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Uniform semantic treatment of default and autoepistemic logics
Cited in
(36)- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Nonmonotonic tools for argumentation
- Embedding justification theory in approximation fixpoint theory
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Fixpoint semantics for recursive \textsc{shacl}
- On the equivalence between abstract dialectical frameworks and logic programs
- Paracoherent answer set semantics meets argumentation frameworks
- scientific article; zbMATH DE number 6928628 (Why is no real title available?)
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Towards conditional logic semantics for abstract dialectical frameworks
- Realizability of three-valued semantics for abstract dialectical frameworks
- Knowledge compilation of logic programs using approximation fixpoint theory
- Lattice point of view for argumentation framework
- Safe inductions and their applications in knowledge representation
- Fixpoint semantics for active integrity constraints
- Flexible approximators for approximating fixpoint theory
- On well-founded set-inductions and locally monotone operators
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Grounded fixpoints and their applications in knowledge representation
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Range-based argumentation semantics as two-valued models
- On three-valued acceptance conditions of abstract dialectical frameworks
- Probabilistic abstract dialectical frameworks
- Expressiveness of two-valued semantics for abstract dialectical frameworks
- EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- A discussion game for the grounded semantics of abstract dialectical frameworks
- An epistemic interpretation of abstract dialectical argumentation
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Judgment aggregation in abstract dialectical frameworks
- Understanding the abstract dialectical framework
- A formal theory of justifications
- Theory of semi-instantiation in abstract argumentation
This page was built for publication: Approximating operators and semantics for abstract dialectical frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490444)
