Paracoherent Answer Set Semantics meets Argumentation Frameworks

DOI10.1017/S1471068419000139zbMath1434.68554arXiv1907.09426OpenAlexW2963134965WikidataQ127226081 ScholiaQ127226081MaRDI QIDQ5108496

Francesco Ricca, Giovanni Amendola

Publication date: 4 May 2020

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.09426

zbMATH Keywords

answer set programmingparacoherent reasoningabstract argumentation

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (1)

Paracoherent answer set computation

Cites Work

• Unnamed Item
• Unnamed Item
• Semi-equilibrium models for paracoherent answer set programs
• Approximating operators and semantics for abstract dialectical frameworks
• On the resolution-based family of abstract argumentation semantics and its grounded instance
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• On principle-based evaluation of extension-based argumentation semantics
• Three-valued nonmonotonic formalisms and semantics of logic programs
• The logical foundations of goal-regression planning in autonomous agents
• A three-valued semantics for deductive databases and logic programs
• On the partial semantics for disjunctive deductive databases
• Extending and implementing the stable model semantics
• On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
• An encompassing framework for paraconsistent logic programs
• 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
• Design and results of the second international competition on computational models of argumentation
• Empirical study on human evaluation of complex argumentation frameworks
• Algorithm selection for paracoherent answer set computation
• On the equivalence between logic programming semantics and argumentation semantics
• SCC-recursiveness: a general schema for argumentation semantics
• The cf2 argumentation semantics revisited
• On elementary loops of logic programs
• Dilemmas and paradoxes: cycles in argumentation frameworks
• The handling of loops in argumentation networks
• Stage semantics and the SCC-recursive schema for argumentation semantics
• On the acceptance of loops in argumentation frameworks
• Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
• Semi-stable semantics
• Approved Models for Normal Logic Programs
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Logical Weak Completions of Paraconsistent Logics
• Robust semantics for argumentation frameworks
• The well-founded semantics for general logic programs
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• What Is a Reasonable Argumentation Semantics?
• Logic Programming
• Normal forms for answer sets programming
• College Admissions and the Stability of Marriage

This page was built for publication: Paracoherent Answer Set Semantics meets Argumentation Frameworks