265 search results - page 13 / 53 » Logical Queries over Views: Decidability and Expressiveness |
FORTE
2001
14 years 11 months ago
2001
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
105
click to vote
JAPLL
2010
14 years 8 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
SIGMOD
2005
ACM
15 years 3 months ago
2005
ACM
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...
105
click to vote
DLOG
2009
14 years 8 months ago
2009
In the current paper we study the reasoning problem for fuzzy SI (f-SI) under arbitrary continuous fuzzy operators. Our work can be seen as an extension of previous works that stud...
KRDB
2003
14 years 11 months ago
2003
This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that ret...