Sciweavers

146 search results - page 20 / 30
» Data Complexity in the EL Family of Description Logics
Sort
View
KR
2010
Springer
13 years 11 months ago
Improving Query Answering over DL-Lite Ontologies
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies w...
Riccardo Rosati, Alessandro Almatelli
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
PODS
2011
ACM
201views Database» more  PODS 2011»
12 years 10 months ago
Data exchange beyond complete data
In the traditional data exchange setting, source instances are restricted to be complete in the sense that every fact is either true or false in these instances. Although natural ...
Marcelo Arenas, Jorge Pérez, Juan L. Reutte...
AI
2010
Springer
13 years 7 months ago
Logic-based ontology comparison and module extraction, with an application to DL-Lite
We develop a formal framework for comparing different versions of ontologies, and apply it to ontologies formulated in terms of DL-Lite, a family of `lightweight' description...
Roman Kontchakov, Frank Wolter, Michael Zakharyasc...
KI
2004
Springer
14 years 1 months ago
Mining Hierarchical Temporal Patterns in Multivariate Time Series
Abstract. The Unification-based Temporal Grammar is a temporal extension of static unification-based grammars. It defines a hierarchical temporal rule language to express comple...
Fabian Mörchen, Alfred Ultsch