74 search results - page 7 / 15 » On the Parameterized Complexity of Default Logic and Autoepi... |
CIE
2008
Springer
14 years 10 months ago
2008
Springer
We study the complexity of the model checking problem, for fixed models A, over certain fragments L of first-order logic, obtained by restricting which of the quantifiers and boole...
118
click to vote
LPNMR
1995
Springer
15 years 1 months ago
1995
Springer
In this paper we propose a version of default logic with the following two properties: (1) defaults with mutually inconsistent justications are never used together in constructing ...
LPNMR
1997
Springer
15 years 2 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...
93
Voted
CSL
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The optimization of rough set based classification models with respect to parameterized balance between a model's complexity and confidence is discussed. For this purpose, the...