Paracoherent answer set semantics meets argumentation frameworks
From MaRDI portal
(Redirected from Publication:5108496)
Abstract: In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotonic logics for AI. Relations between argumentation framework (AF) semantics and logic programming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studied, namely semi-stable and stage. In this paper, we show that another perspective is possible on incoherent AFs, called paracoherent extensions, as they have a counterpart in paracoherent answer set semantics. We compare this perspective with semi-stable and stage semantics, by showing that computational costs remain unchanged, and moreover an interesting symmetric behaviour is maintained. Under consideration for acceptance in TPLP.
Recommendations
Cites work
- A three-valued semantics for deductive databases and logic programs
- Algorithm selection for paracoherent answer set computation
- An encompassing framework for paraconsistent logic programs
- Approved Models for Normal Logic Programs
- Approximating operators and semantics for abstract dialectical frameworks
- Argumentation in artificial intelligence
- Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
- College Admissions and the Stability of Marriage
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computing ideal sceptical argumentation
- Design and results of the second international competition on computational models of argumentation
- Dilemmas and paradoxes: cycles in argumentation frameworks
- Empirical study on human evaluation of complex argumentation frameworks
- Extending and implementing the stable model semantics
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- Logic Programming
- Logical Weak Completions of Paraconsistent Logics
- Normal forms for answer sets programming
- On elementary loops of logic programs
- On principle-based evaluation of extension-based argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the acceptance of loops in argumentation frameworks
- On the equivalence between logic programming semantics and argumentation semantics
- On the partial semantics for disjunctive deductive databases
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Robust semantics for argumentation frameworks
- SCC-recursiveness: a general schema for argumentation semantics
- Semi-equilibrium models for paracoherent answer set programs
- Semi-stable semantics
- Stage semantics and the SCC-recursive schema for argumentation semantics
- The cf2 argumentation semantics revisited
- The handling of loops in argumentation networks
- The logical foundations of goal-regression planning in autonomous agents
- The well-founded semantics for general logic programs
- Three-valued nonmonotonic formalisms and semantics of logic programs
- What is a reasonable argumentation semantics?
Cited in
(7)- Paracoherent answer set computation
- Algorithm selection for paracoherent answer set computation
- Semi-equilibrium models for paracoherent answer set programs
- Modular paracoherent answer sets
- Polysemy and Coercion – A Frame-Based Approach Using LTAG and Hybrid Logic
- Better paracoherent answer sets with less resources
- Abstract argumentation and answer set programming: two faces of Nelson's logic
This page was built for publication: Paracoherent answer set semantics meets argumentation frameworks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108496)
