133 search results - page 5 / 27 » Decidable Fragments of Many-Sorted Logic |
134
click to vote
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
ICDT
2003
ACM
15 years 4 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
100
click to vote
DLOG
2007
15 years 1 months ago
2007
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
119
click to vote
DLOG
2009
14 years 9 months ago
2009
Abstract This paper analyzes the probabilistic description logic PSHIQ by looking at it as a fragment of probabilistic first-order logic with semantics based on possible worlds. We...