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 QIDQ2146012FDOQ2146012
Authors: Samy Sá, João Alcântara 
Publication date: 15 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_12
Recommendations
- On the equivalence between logic programming semantics and argumentation semantics
- On the equivalence between logic programming semantics and argumentation semantics
- On the equivalence between assumption-based argumentation and logic programming
- On the correspondence between abstract dialectical frameworks and nonmonotonic conditional logics
Cites Work
- 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
- On the Issue of Reinstatement in Argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- Preferred extensions as stable models
- Robust semantics for argumentation frameworks
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Argumentation and answer set programming
- Title not available (Why is that?)
- An argumentation-theoretic foundation for logic programming
- On the equivalence between logic programming semantics and argumentation semantics
- I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation
Cited In (1)
This page was built for publication: An abstract argumentation and logic programming comparison based on 5-valued labellings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146012)
