Sciweavers

Share
JELIA
2010
Springer

Sets of Boolean Connectives That Make Argumentation Easier

11 years 3 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset of a given knowledge base which has to entail the claim α. In most scenarios, arguments are given in the full language of classical propositional logic which makes reasoning in such frameworks a computationally costly task. For instance, the problem of deciding whether there exists a support for a given claim has been shown to be Σp 2-complete. In order to better understand the sources of complexity (and to identify tractable fragments), we focus on arguments given over formulae in which the allowed connectives are taken from certain sets of Boolean functions. We provide a complexity classification for four different decision problems (existence of a support, checking the validity of an argument, relevance and dispensability) with respect to all possible sets of Boolean functions.
Nadia Creignou, Johannes Schmidt, Michael Thomas,
Added 28 Jan 2011
Updated 28 Jan 2011
Type Journal
Year 2010
Where JELIA
Authors Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Comments (0)
books