• 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,361
  • 256
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
  • 750
  • 83
ConGolog, a concurrent programming language based on the situation calculus
Abstract As an alternative to planning, an approach to high-level agent control based on concurrent program execution is considered. A formal definition in the situation calculus of such aExpand
  • 589
  • 56
Reasoning on UML class diagrams
UML is the de-facto standard formalism for software design and analysis. To support the design of large-scale industrial applications, sophisticated CASE tools are available on the market, thatExpand
  • 553
  • 50
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
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
  • 457
  • 39
Linear Temporal Logic and Linear Dynamic Logic on Finite Traces
In this paper we look into the assumption of interpreting LTL over finite traces. In particular we show that LTLf, i.e., LTL under this assumption, is less expressive than what might appear at firstExpand
  • 232
  • 38
Ontologies and Databases: The DL-Lite Approach
Ontologies provide a conceptualization of a domain of interest. Nowadays, they are typically represented in terms of Description Logics (DLs), and are seen as the key technology used to describe theExpand
  • 201
  • 27
Containment of Conjunctive Regular Path Queries with Inverse
Reasoning on queries is a basic problem both in knowledge representation and databases. A fundamental form of reasoning on queries is checking containment, i.e., verifying whether one query yieldsExpand
  • 177
  • 25
An Incremental Interpreter for High-Level Programs with Sensing
Like classical planning, the execution of high-level agent programs requires a reasoner to look all the way to a final goal state before even a single action can be taken in the world. This deferralExpand
  • 143
  • 24