265 search results - page 5 / 53 » Logical Queries over Views: Decidability and Expressiveness |
107
click to vote
FOIKS
2006
Springer
15 years 1 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
PODS
2003
ACM
15 years 10 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
CSL
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
CONCUR
2010
Springer
14 years 11 months ago
2010
Springer
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...