Encoding deductive argumentation in quantified Boolean formulae

DOI10.1016/j.artint.2009.06.006zbMath1185.68662OpenAlexW2051999406MaRDI QIDQ1045994

Stefan Woltran, Philippe Besnard, Anthony Hunter

Publication date: 21 December 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2009.06.006

zbMATH Keywords

inconsistencyclassical logicargumentationargument systemsconflicting knowledgequantified Boolean formulae

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items

Expressiveness of SETAFs and support-free ADFs under 3-valued semantics ⋮ Algorithms for generating arguments and counterarguments in propositional logic

Uses Software

• Dungine

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A solver for QBFs in negation normal form
• Argumentation in artificial intelligence
• Complete sets and the polynomial-time hierarchy
• A reasoning model based on the production of acceptable arguments
• Coherence in finite argument systems.
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Default reasoning using classical logic
• Dialectic proof procedures for assumption-based, admissible argumentation
• Argument-based extended logic programming with defeasible priorities
• The complexity of logic-based abduction
• Properties and Complexity of Some Formal Inter-agent Dialogues
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• Computing argumentation in logic programming
• Argumentation through a distributed self-stabilizing approach
• Defeasible logic programming: an argumentative approach
• Theory and Applications of Satisfiability Testing
• Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
• A logic-based theory of deductive arguments