31 search results - page 1 / 7 » The Boundary Between Decidability and Undecidability for Tra... |
CSL
2004
Springer
13 years 10 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
ICDT
2003
ACM
13 years 10 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...
DLOG
2010
13 years 2 months ago
2010
Abstract. This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First,...
IJCAI
2003
13 years 6 months ago
2003
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar chy of decidable logics with multiple maximal el ements. It would be desirable to ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...