2214 search results - page 98 / 443 » Complexity of Reasoning |
118
click to vote
IDA
2003
Springer
15 years 8 months ago
2003
Springer
Because uncertain reasoning is often intractable, it is hard to reason with a large amount of knowledge. One solution to this problem is to specify a set of possible models, some s...
122
click to vote
CSL
2010
Springer
15 years 4 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...
115
click to vote
CSL
2001
Springer
15 years 7 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
120
click to vote
LICS
1999
IEEE
15 years 7 months ago
1999
IEEE
The complexity of set constraints has been extensively studied over the last years and was often found quite high. At the lower end of expressiveness, there are atomic set constra...
106
click to vote
LICS
1996
IEEE
15 years 7 months ago
1996
IEEE
In the automata-theoretic approach to verification, we translate specifications to automata. Complexity considerations motivate the distinction between different types of automata...