A
Andreas Pieris
Researcher at University of Edinburgh
Publications - 105
Citations - 2281
Andreas Pieris is an academic researcher from University of Edinburgh. The author has contributed to research in topics: Conjunctive query & Datalog. The author has an hindex of 24, co-authored 95 publications receiving 2025 citations. Previous affiliations of Andreas Pieris include University of Oxford & Vienna University of Technology.
Papers
More filters
Journal ArticleDOI
Towards more expressive ontology languages: The query answering problem
TL;DR: This paper studies novel relevant classes of ontological theories for which query answering is both decidable and of tractable data complexity, that is, the complexity with respect to the size of the data only, and obtains highly expressive and effective ontology languages that unify and generalize both classical database constraints and important features of the most widespread tractable description logics.
Proceedings ArticleDOI
Ontological queries: Rewriting and optimization
TL;DR: 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.
Proceedings ArticleDOI
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
TL;DR: 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.
Journal ArticleDOI
Advanced processing for ontological queries
TL;DR: 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.
Book ChapterDOI
Query answering under non-guarded rules in datalog+/-
TL;DR: 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.