• Publications
  • Influence
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means notExpand
  • 1,353
  • 253
Linking Data to Ontologies
Many organizations nowadays face the problem of accessing existing data sources by means of flexible mechanisms that are both powerful and efficient. Ontologies are widely considered as a suitableExpand
  • 746
  • 81
Reconciling description logics and rules
Description logics (DLs) and rules are formalisms that emphasize different aspects of knowledge representation: whereas DLs are focused on specifying and reasoning about conceptual knowledge, rulesExpand
  • 261
  • 49
DL-Lite: Tractable Description Logics for Ontologies
We propose a new Description Logic, called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means not only computingExpand
  • 417
  • 48
Inconsistency-Tolerant Semantics for Description Logics
We address the problem of dealing with inconsistencies in Description Logic (DL) knowledge bases. Our general goal is both to study DL semantical frameworks which are inconsistency-tolerant, and toExpand
  • 196
  • 44
Data Complexity of Query Answering in Description Logics
In this paper we study data complexity of answering conjunctive queries over Description Logic knowledge bases constituted by an ABox and a TBox. In particular, we are interested in characterizingExpand
  • 456
  • 38
DL+log: Tight Integration of Description Logics and Disjunctive Datalog
The integration of Description Logics and Datalog rules presents many semantic and computational problems. In particular, reasoning in a system fully integrating Description Logics knowledge basesExpand
  • 249
  • 31
Description logics of minimal knowledge and negation as failure
We present description logics of minimal knowledge and negation as failure (MKNF-DLs), which augment description logics with modal operators interpreted according to Lifschitz's nonmonotonic logicExpand
  • 266
  • 24
On Conjunctive Query Answering in EL
  • R. Rosati
  • Computer Science
  • Description Logics
  • 2007
In this paper we study conjunctive query answering in the description logics of the EL family [2, 3, 7, 6, 5], in particular we consider the DLs EL, ELH, EL, and EL. The EL family has been recentlyExpand
  • 137
  • 21
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 with very largeExpand
  • 182
  • 20