A QBF-based formalization of abstract argumentation semantics

DOI10.1016/J.JAL.2013.03.009zbMATH Open1284.68533DBLPjournals/japll/ArieliC13OpenAlexW2085401920WikidataQ62044287 ScholiaQ62044287MaRDI QIDQ2446545FDOQ2446545

Authors: Ofer Arieli, Martin Caminada 

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

Recommendations

• On the semantics of abstract argumentation frameworks: a logic programming approach
• A logic of argumentation for specification and verification of abstract argumentation frameworks
• On the semantics of abstract argumentation
• The hidden power of abstract argumentation semantics
• PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS
• ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS
• A formal concept view of abstract argumentation
• A general approach to extension-based semantics in abstract argumentation
• Revisiting Abstract Argumentation Frameworks

zbMATH Keywords

quantified Boolean formulassigned theoriessemantics for abstract argumentation frameworks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in artificial intelligence (68T27)

Cites Work

• How to reason defeasibly
• Computing ideal sceptical argumentation
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• The well-founded semantics for general logic programs
• Title not available (Why is that?)
• Reasoning with logical bilattices
• A logic for default reasoning
• On the evaluation of argumentation formalisms
• Argument-based extended logic programming with defeasible priorities
• Argumentation Semantics for Defeasible Logic
• Computational properties of argument systems satisfying graph-theoretic constraints
• A logical account of formal argumentation
• Semi-stable semantics
• On the Issue of Reinstatement in Argumentation
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Answer-set programming encodings for argumentation frameworks
• Complexity of semi-stable and stage semantics in argumentation frameworks
• SCC-recursiveness: a general schema for argumentation semantics
• Robust semantics for argumentation frameworks
• Title not available (Why is that?)
• Instantiating abstract argumentation with classical logic arguments: postulates and properties
• Computational methods for database repair by signed formulae
• An application of model checking games to abstract argumentation
• An argument game for stable semantics
• Title not available (Why is that?)
• Complete extensions in argumentation coincide with 3-valued stable models in logic programming
• Argumentation and answer set programming
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• Title not available (Why is that?)
• Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
• A Logic of Abstract Argumentation
• Conflict-tolerant semantics for argumentation frameworks
• Similarity-based inconsistency-tolerant logics
• Computational models of argument. Proceedings of the 4th conference, COMMA 2012, Vienna, Austria, September 10--12, 2012
• Reducing Preferential Paraconsistent Reasoning to Classical Entailment
• Inconsistency Tolerance
• Robust QBF Encodings for Sequential Circuits with Applications to Verification, Debug, and Test
• Title not available (Why is that?)
• On Computing Belief Change Operations using Quantified Boolean Formulas
• Paraconsistent reasoning via quantified Boolean formulas. II: Circumscribing inconsistent theories

Cited In (10)

• Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
• A propositional logical encoding of enriched interactions in abstract argumentation graphs
• A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
• Complexity-sensitive decision procedures for abstract argumentation
• Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks
• The first international competition on computational models of argumentation: results and analysis
• Encoding deductive argumentation in quantified Boolean formulae
• Computing smallest MUSes of quantified Boolean formulas
• Encoding argument graphs in logic
• Methods for solving reasoning problems in abstract argumentation -- a survey

Uses Software

• ASPARTIX
• OSCAR

This page was built for publication: A QBF-based formalization of abstract argumentation semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446545)