An abstract argumentation and logic programming comparison based on 5-valued labellings
From MaRDI portal
Publication:2146012
DOI10.1007/978-3-030-86772-0_12OpenAlexW3201601375MaRDI QIDQ2146012
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_12
Related Items (1)
Cites Work
- Unnamed Item
- Algorithms for decision problems in argument systems under preferred semantics
- On the partial semantics for disjunctive deductive databases
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- On the equivalence between logic programming semantics and argumentation semantics
- Argumentation and Answer Set Programming
- Preferred extensions as stable models
- On the Issue of Reinstatement in Argumentation
- Robust semantics for argumentation frameworks
- An argumentation-theoretic foundation for logic programming
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation
This page was built for publication: An abstract argumentation and logic programming comparison based on 5-valued labellings