Encoding deductive argumentation in quantified Boolean formulae
type: Item
instance of: scholarly article
title: Encoding deductive argumentation in quantified Boolean formulae
zbMATH Open document ID: 1185.68662
author: P. Besnard
author: Anthony Hunter
author: Stefan Woltran
published in: Artificial Intelligence
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 5650766
zbMATH Keywords: argument systems
zbMATH Keywords: argumentation
zbMATH Keywords: classical logic
zbMATH Keywords: inconsistency
zbMATH Keywords: quantified Boolean formulae
zbMATH Keywords: conflicting knowledge
describes a project that uses: Dungine
MaRDI profile type: Publication
full work available at URL: j.artint.2009.06.006
OpenAlex ID: W2051999406
cites work: A reasoning model based on the production of acceptable arguments
cites work: Argumentation through a distributed self-stabilizing approach
cites work: Default reasoning using classical logic
cites work: Argumentation in artificial intelligence
cites work: Q3511268
cites work: A logic-based theory of deductive arguments
cites work: Q4784873
cites work: On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Dialectic proof procedures for assumption-based, admissible argumentation
cites work: Coherence in finite argument systems.
cites work: Q4557972
cites work: Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
cites work: Theory and Applications of Satisfiability Testing
cites work: A solver for QBFs in negation normal form
cites work: The complexity of logic-based abduction
cites work: Defeasible logic programming: an argumentative approach
cites work: Computing argumentation in logic programming
cites work: Q3429159
cites work: Properties and Complexity of Some Formal Inter-agent Dialogues
cites work: Argument-based extended logic programming with defeasible priorities
cites work: Q4789446
cites work: Complete sets and the polynomial-time hierarchy
DOI: 10.1016/J.ARTINT.2009.06.006
description: scientific article; zbMATH DE number 5650766