Sciweavers

25 search results - page 4 / 5
» Conjunctive Query Containment in Description Logics with n-a...
Sort
View
KRDB
2003
121views Database» more  KRDB 2003»
13 years 6 months ago
Knowledge Representation using Schema Tuple Queries
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...
Michael Minock
DLOG
2011
12 years 8 months ago
Query Answering over SROIQ Knowledge Bases with SPARQL
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
Ilianna Kollia, Birte Glimm, Ian Horrocks
SEBD
2001
145views Database» more  SEBD 2001»
13 years 6 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
PODS
2009
ACM
113views Database» more  PODS 2009»
14 years 5 months ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 9 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz