62 search results - page 1 / 13 » The Complexity of the Warranted Formula Problem in Propositi... |
LOGCOM
2010
13 years 3 months ago
2010
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
IBERAMIA
2010
Springer
13 years 2 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
13 years 6 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
JSAT
2006
13 years 4 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...