Sciweavers

237 search results - page 12 / 48
» On the decidability and complexity of reasoning about only k...
Sort
View
ER
2007
Springer
130views Database» more  ER 2007»
14 years 1 months ago
Towards Automated Reasoning on ORM Schemes
The goal of this article is to formalize Object Role Modeling (ORM) using the DLR description logic. This would enable automated reasoning on the formal properties of ORM diagrams,...
Mustafa Jarrar
IJCAI
2007
13 years 8 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
EDBT
2006
ACM
103views Database» more  EDBT 2006»
14 years 7 months ago
Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
Foto N. Afrati, Rada Chirkova, Manolis Gergatsouli...
WWW
2008
ACM
14 years 8 months ago
Structured objects in owl: representation and reasoning
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
Boris Motik, Bernardo Cuenca Grau, Ulrike Sattler
ECAI
1998
Springer
13 years 11 months ago
Metaprogramming Forced Moves
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
Tristan Cazenave