291 search results - page 31 / 59 » On the Complexity of Fragments of Modal Logics |
TABLEAUX
1999
Springer
15 years 4 months ago
1999
Springer
Abstract. We define sequent-style calculi for nominal tense logics characterized by classes of modal frames that are first-order definable by certain Π0 1 -formulae and Π0 2 -...
113
click to vote
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
147
click to vote
FROCOS
2009
Springer
15 years 6 months ago
2009
Springer
We investigate the temporal extension of the description logic DL-Lite(RN ) bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and...
116
click to vote
KR
2010
Springer
15 years 4 months ago
2010
Springer
Horn fragments of Description Logics (DLs) have gained popularity because they provide a beneficial trade-off between expressive power and computational complexity and, more spec...