Encoding deductive argumentation in quantified Boolean formulae
From MaRDI portal
Publication:1045994
DOI10.1016/J.ARTINT.2009.06.006zbMATH Open1185.68662OpenAlexW2051999406MaRDI QIDQ1045994
Stefan Woltran, P. 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
argumentationclassical logicinconsistencyargument systemsconflicting knowledgequantified Boolean formulae
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Argumentation in artificial intelligence
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Dialectic proof procedures for assumption-based, admissible argumentation
- Defeasible logic programming: an argumentative approach
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
- A logic-based theory of deductive arguments
- A reasoning model based on the production of acceptable arguments
- Argument-based extended logic programming with defeasible priorities
- On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
- Coherence in finite argument systems.
- Complete sets and the polynomial-time hierarchy
- Properties and Complexity of Some Formal Inter-agent Dialogues
- Computing argumentation in logic programming
- A solver for QBFs in negation normal form
- The complexity of logic-based abduction
- Theory and Applications of Satisfiability Testing
- Default reasoning using classical logic
- Argumentation through a distributed self-stabilizing approach
Cited In (8)
- Encoding nested Boolean functions as quantified Boolean formulas
- Algorithms for generating arguments and counterarguments in propositional logic
- Expressiveness of SETAFs and support-free ADFs under 3-valued semantics
- Generic logical encoding for argumentation
- Brodskio kodavimo metodas teiginių logikai;Brodsky’s coding method for propositional logic
- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas
- Deductive argumentation by enhanced sequent calculi and dynamic derivations
- Proving Valid Quantified Boolean Formulas in HOL Light
Uses Software
This page was built for publication: Encoding deductive argumentation in quantified Boolean formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045994)
