Search Results - "Pieris, Andreas"

Towards more expressive ontology languages: The query answering problem by Cali`, Andrea, Gottlob, Georg, Pieris, Andreas

“…Ontology reasoning finds a relevant application in the so-called ontology-based data access, where a classical extensional database (EDB) is enhanced by an…”
Get full text

Polynomial combined first-order rewritings for linear and guarded existential rules by Gottlob, Georg, Manna, Marco, Pieris, Andreas

“…We consider the problem of ontological query answering, that is, the problem of answering a database query (typically a conjunctive query) in the presence of…”
Get full text

Semi-Oblivious Chase Termination: The Sticky Case by Calautti, Marco, Pieris, Andreas

“…The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is…”
Get full text

Inconsistency-tolerant query answering for existential rules by Lukasiewicz, Thomas, Malizia, Enrico, Martinez, Maria Vanina, Molinaro, Cristian, Pieris, Andreas, Simari, Gerardo I.

“…Querying inconsistent knowledge bases is an intriguing problem that gave rise to a flourishing research activity in the knowledge representation and reasoning…”
Get full text

When is Ontology-Mediated Querying Efficient? by Barcelo, Pablo, Feier, Cristina, Lutz, Carsten, Pieris, Andreas

“…In ontology-mediated querying, description logic (DL) ontologies are used to enrich incomplete data with domain knowledge which results in more complete…”
Get full text

Ontological queries: Rewriting and optimization by Gottlob, G, Orsi, G, Pieris, A

“…Ontological queries are evaluated against an enterprise ontology rather than directly on a database. The evaluation and optimization of such queries is an…”
Get full text

Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications by Calì, Andrea, Gottlob, Georg, Lukasiewicz, Thomas, Marnette, Bruno, Pieris, Andreas

“…This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology…”
Get full text

Ontological query answering under expressive Entity–Relationship schemata by Calì, Andrea, Gottlob, Georg, Pieris, Andreas

“…The Entity–Relationship (ER) model is a fundamental tool for database design, recently extended and employed in knowledge representation and reasoning due to…”
Get full text

Characterizing Data Dependencies Then and Now by Kolaitis, Phokion G, Pieris, Andreas

“…Data dependencies are integrity constraints that the data of interest must obey. During the 1980s, Janos Makowsky made a number of contributions to the study…”
Get full text

Absolute Expressiveness of Subgraph-based Centrality Measures by Pieris, Andreas, Salas, Jorge

“…In graph-based applications, a common task is to pinpoint the most important or ``central'' vertex in a (directed or undirected) graph, or rank the vertices of…”
Get full text

Semi-Oblivious Chase Termination for Linear Existential Rules: An Experimental Study by Calautti, Marco, Milani, Mostafa, Pieris, Andreas

“…The chase procedure is a fundamental algorithmic tool in databases that allows us to reason with constraints, such as existential rules, with a plethora of…”
Get full text

Facets of the Fully Mixed Nash Equilibrium Conjecture by Feldmann, Rainer, Mavronicolas, Marios, Pieris, Andreas

“…In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture , henceforth abbreviated as the Conjecture , in selfish…”
Get full text

Non-Uniformly Terminating Chase: Size and Complexity by Calautti, Marco, Gottlob, Georg, Pieris, Andreas

“…The chase procedure, originally introduced for checking implication of database constraints, and later on used for computing data exchange solutions, has…”
Get full text

Combined Approximations for Uniform Operational Consistent Query Answering by Calautti, Marco, Livshits, Ester, Pieris, Andreas, Schneider, Markus

“…Operational consistent query answering (CQA) is a recent framework for CQA based on revised definitions of repairs, which are built by applying a sequence of…”
Get full text

The Complexity of Why-Provenance for Datalog Queries by Calautti, Marco, Livshits, Ester, Pieris, Andreas, Schneider, Markus

“…Explaining why a database query result is obtained is an essential task towards the goal of Explainable AI, especially nowadays where expressive database query…”
Get full text

Generative Datalog with Stable Negation by Alviano, Mario, Lanzinger, Matthias, Morak, Michael, Pieris, Andreas

“…Extending programming languages with stochastic behaviour such as probabilistic choices or random sampling has a long tradition in computer science. A recent…”
Get full text

Uniform Operational Consistent Query Answering by Calautti, Marco, Livshits, Ester, Pieris, Andreas, Schneider, Markus

“…Operational consistent query answering (CQA) is a recent framework for CQA, based on revised definitions of repairs and consistent answers, which opens up the…”
Get full text

Exact and Approximate Counting of Database Repairs by Calautti, Marco, Livshits, Ester, Pieris, Andreas, Schneider, Markus

“…A key task in the context of consistent query answering is to count the number of repairs that entail the query, with the ultimate goal being a precise data…”
Get full text

First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries by Barcelo, Pablo, Berger, Gerald, Lutz, Carsten, Pieris, Andreas

“…We focus on ontology-mediated queries (OMQs) based on (frontier-)guarded existential rules and (unions of) conjunctive queries, and we investigate the problem…”
Get full text

All-Instances Restricted Chase Termination by Gogacz, Tomasz, Marcinkowski, Jerzy, Pieris, Andreas

“…The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is…”
Get full text