On the equivalence between logic programming semantics and argumentation semantics
From MaRDI portal
Publication:2344367
DOI10.1016/j.ijar.2014.12.004zbMath1328.68211OpenAlexW4249547020WikidataQ62044285 ScholiaQ62044285MaRDI QIDQ2344367
Samy Sá, Wolfgang Dvořák, João Alcântara, Martin Caminada
Publication date: 15 May 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2014.12.004
Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items
An abstract argumentation and logic programming comparison based on 5-valued labellings ⋮ Assumption-based argumentation is logic programming with projection ⋮ Labellings for assumption-based and abstract argumentation ⋮ An argumentation system for defeasible reasoning ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Static and dynamic orderings on Dungean argumentation frameworks -- an overview ⋮ A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness ⋮ Annotated defeasible logic ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs ⋮ Interlinking logic programs and argumentation frameworks ⋮ Base argumentation as an abstraction of deductive argumentation ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ Defining stage argumentation semantics in terms of an abducible semantics ⋮ Abduction in argumentation frameworks ⋮ Design and results of the second international competition on computational models of argumentation ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Tractable reasoning using logic programs with intensional concepts ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of abstract argumentation under a claim-centric view ⋮ On three-valued acceptance conditions of abstract dialectical frameworks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general account of argumentation with preferences
- Algorithms for decision problems in argument systems under preferred semantics
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- A mathematical treatment of defeasible reasoning and its implementation.
- On the evaluation of argumentation formalisms
- A logic for default reasoning
- On the partial semantics for disjunctive deductive databases
- An abstract, argumentation-theoretic approach to default reasoning
- Abstract argumentation systems
- 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
- A logical account of formal argumentation
- Preferred semantics as socratic discussion
- Argument-based extended logic programming with defeasible priorities
- Implementing crash-resistance and non-interference in logic-based argumentation
- On the Issue of Reinstatement in Argumentation
- Robust semantics for argumentation frameworks
- On the equivalence of semantics for normal logic programs
- Defeasible logic programming: an argumentative approach
This page was built for publication: On the equivalence between logic programming semantics and argumentation semantics
