Complete extensions in argumentation coincide with 3-valued stable models in logic programming
From MaRDI portal
Publication:2269506
Recommendations
- Ideal extensions as logical programming models
- Preferred extensions as stable models
- On the equivalence between logic programming semantics and argumentation semantics
- On the equivalence between logic programming semantics and argumentation semantics
- On the semantics of abstract argumentation frameworks: a logic programming approach
Cites work
- An Algorithm for Computing Semi-stable Semantics
- Argument-based extended logic programming with defeasible priorities
- Computing ideal sceptical argumentation
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- Logical modes of attack in argumentation networks
- 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 Issue of Reinstatement in Argumentation
- On the partial semantics for disjunctive deductive databases
- Robust semantics for argumentation frameworks
Cited in
(27)- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- An abstract argumentation and logic programming comparison based on 5-valued labellings
- Assumption-based argumentation is logic programming with projection
- Fibring argumentation frames
- A logical account of formal argumentation
- Annotation theories over finite graphs
- Design and results of the second international competition on computational models of argumentation
- On the equivalence between logic programming semantics and argumentation semantics
- A QBF-based formalization of abstract argumentation semantics
- Range-based argumentation semantics as two-valued models
- Abduction in argumentation frameworks
- Approximating operators and semantics for abstract dialectical frameworks
- Paracoherent answer set semantics meets argumentation frameworks
- On the equivalence between abstract dialectical frameworks and logic programs
- On the semantics of abstract argumentation frameworks: a logic programming approach
- A General Framework for Stable Roommates Problems using Answer Set Programming
- Theory of semi-instantiation in abstract argumentation
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients
- Knowledge representation, scientific argumentation and non-monotonic logic
- \textsc{sm}ProbLog: stable model semantics in ProbLog for probabilistic argumentation
- Abstract argumentation and answer set programming: two faces of Nelson's logic
- Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks
- Complexity of abstract argumentation under a claim-centric view
- Semantic-based construction of arguments: an answer set programming approach
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
This page was built for publication: Complete extensions in argumentation coincide with 3-valued stable models in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269506)
