A QBF-based formalization of abstract argumentation semantics
From MaRDI portal
Publication:2446545
DOI10.1016/j.jal.2013.03.009zbMath1284.68533OpenAlexW2085401920WikidataQ62044287 ScholiaQ62044287MaRDI QIDQ2446545
Publication date: 17 April 2014
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jal.2013.03.009
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
The first international competition on computational models of argumentation: results and analysis ⋮ Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks ⋮ Computing smallest MUSes of quantified Boolean formulas ⋮ Complexity-sensitive decision procedures for abstract argumentation ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ Encoding Argument Graphs in Logic ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Complexity of semi-stable and stage semantics in argumentation frameworks
- On the evaluation of argumentation formalisms
- Computing ideal sceptical argumentation
- Computational properties of argument systems satisfying graph-theoretic constraints
- A logic for default reasoning
- How to reason defeasibly
- An abstract, argumentation-theoretic approach to default reasoning
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Reasoning with logical bilattices
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- A logical account of formal argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Computational methods for database repair by signed formulae
- Conflict-Tolerant Semantics for Argumentation Frameworks
- Argumentation and Answer Set Programming
- An Application of Model Checking Games to Abstract Argumentation
- Argument-based extended logic programming with defeasible priorities
- Semi-stable semantics
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- On the Issue of Reinstatement in Argumentation
- An argument game for stable semantics
- A Logic of Abstract Argumentation
- Robust semantics for argumentation frameworks
- The well-founded semantics for general logic programs
- Reducing Preferential Paraconsistent Reasoning to Classical Entailment
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- Argumentation Semantics for Defeasible Logic
- On Computing Belief Change Operations using Quantified Boolean Formulas
- Similarity-Based Inconsistency-Tolerant Logics
- Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
- Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
- Inconsistency Tolerance
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: A QBF-based formalization of abstract argumentation semantics
