Share This Author
Theory and Practice of Logic Programming
A powerful and flexible condition, called tameness, is proposed, which allows us to consolidate in an elegant and uniform way guardedness with stickiness.
Ontological queries: Rewriting and optimization
- G. Gottlob, G. Orsi, Andreas Pieris
- Computer ScienceIEEE 27th International Conference on Data…
- 11 April 2011
A new rewriting algorithm for rather general types of ontological constraints (description logics) and an effective new method that works for Linear Datalog±, a description logic that encompasses well-known description logics of the DL-Lite family are proposed.
Towards more expressive ontology languages: The query answering problem
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
- A. Calì, G. Gottlob, Thomas Lukasiewicz, Bruno Marnette, Andreas Pieris
- Computer Science25th Annual IEEE Symposium on Logic in Computer…
- 11 July 2010
This paper discusses three paradigms ensuring decidability: chase termination, guardedness, and stickiness, and extends plain Datalog by features such as existentially quantified rule heads and restricts the rule syntax so as to achieveDecidability and tractability.
Query Rewriting and Optimization for Ontological Databases
This article shows how a conjunctive query against a knowledge base, expressed using linear and sticky existential rules, that is, members of the recently introduced Datalog± family of ontology languages, can be compiled into a union of conj unctive queries (UCQ) against the underlying database.
Query Answering under Non-guarded Rules in Datalog+/-
The complexity of query answering under Datalog+/- class of decidable languages is investigated, and in addition the novel class of sticky-join sets of TGDs is presented, which generalizes both sticky sets ofTGDs and so-called linear TGDs, an extension of inclusion dependencies.
Advanced processing for ontological queries
A more expressive formalism that takes joins into account, while still enjoying the same low query-answering complexity is introduced, and a highly expressive and effective ontological modeling language that unifies and generalizes both classical database constraints and important features of the most widespread tractable description logics is obtained.
Ontological Queries: Rewriting and Optimization (Extended Version)
A new rewriting algorithm for rather general types of ontological constraints and an effective new method that works for linear Datalog+/-, a class of Datalogical rules that encompasses well-known description logics of the DL-Lite family are proposed.
Expressive Languages for Querying the Semantic Web
It is shown that every SPARQL query enriched with the above features can be naturally translated into a query expressed in a language that is based on an extension of Datalog, which allows for value invention and stratified negation.
From Classical to Consistent Query Answering under Existential Rules
- Thomas Lukasiewicz, Maria Vanina Martinez, Andreas Pieris, Gerardo I. Simari
- Computer ScienceAMW
- 25 January 2015
This work performs an in-depth analysis of the complexity of consistent query answering under the main decidable classes of existential rules enriched with negative constraints, and focuses on one of the most prominent inconsistency-tolerant semantics, namely, the AR semantics.