82 search results - page 13 / 17 » Datalog and Description Logics: Expressive Power |
98
Voted
FOIS
2006
15 years 9 days ago
2006
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
108
Voted
RTA
2000
Springer
15 years 2 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
104
Voted
LATA
2009
Springer
15 years 5 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
135
Voted
AAAI
2010
15 years 11 days ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
107
click to vote
ICDT
2012
ACM
13 years 1 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...