36 search results - page 3 / 8 » Proof Complexity of Propositional Default Logic |
64
Voted
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
91
Voted
ASP
2003
Springer
15 years 2 months ago
2003
Springer
Default logic is used to describe regular behavior and normal properties. We suggest to exploit the framework of default logic for detecting outliers - individuals who behave in a...
APAL
1999
14 years 9 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
LPNMR
1997
Springer
15 years 1 months ago
1997
Springer
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
ECCC
2007
14 years 9 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...