2006 · 30 citations · 17 references
HumanitiesComputer ScienceFormal MethodsKnowledge RepresentationLogicArgumentationArgumentation TheoryAutomated ReasoningDeductive ReasoningDeductive SystemsPropositional LogicBoolean FunctionsComputational ArgumentationDecision ProblemsFormal ArgumentationHierarchyPolynomial HierarchyPropositional Reasoning
Abstract. This paper describes a generic approach to implement propositional argumentation frameworks by means of quantified Boolean formulas (QBFs). The motivation to this work is based on the following observations: Firstly, depending on the underlying deductive system and the chosen semantics (i.e., the kind of extension under consideration), reasoning in argumentation frameworks can become computationally involving up to the fourth level of the polynomial hierarchy. This makes the language of QBFs a suitable target formalism since decision problems from the polynomial hierarchy can be efficiently represented in terms of QBF. Secondly, several practicably efficient solvers for QBFs are currently available, and thus can be used as black-box engines in potential implementations of argumentation frameworks. Finally, the definition of suitable QBF modules provides us with a tool box in order to capture a broad range of reasoning tasks associated to formal argumentation. 1.
17
Raymond Reiter · Artificial Intelligence · 1980 · 3.9K citations
Henry Kautz, Bart Selman · 1992 · 828 citations
A logical framework for default reasoning
David Poole · Artificial Intelligence · 1988 · 729 citations