2490 search results - page 139 / 498 » Complexity of Contextual Reasoning |
125
Voted
CSL
2001
Springer
15 years 9 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 ...
134
click to vote
LICS
1999
IEEE
15 years 8 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...
120
click to vote
LICS
1996
IEEE
15 years 8 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...
149
click to vote
DLOG
2003
15 years 6 months ago
2003
In this paper we introduce a decidable fixpoint extension of temporal Description Logics. We exploit the decidability results obtained for various monodic extensions of Descripti...