activity
20102021
most citedRewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

23 citations · 29 across the 8 of their papers we have counts for

collaborators
Showing cs.LOShow all

5 papers · 1 filter

cs.LO2021

Characterising Fixed Parameter Tractability of Query Evaluation over Guarded TGDs

Cristina Feier

We study the parameterized complexity of evaluating Ontology Mediated Queries (OMQs) based on Guarded TGDs (GTGDs) and Unions of Conjunctive Queries (UCQs), in the case where relat…

cs.LO2018★ 3 cited

A Practical Acyclicity Notion for Query Answering over Horn-SRIQ Ontologies

David Carral, Cristina Feier, Pascal Hitzler

Conjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the cha…

cs.LO2017★ 23 cited

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Cristina Feier, Antti Kuusisto, Carsten Lutz

We study rewritability of monadic disjunctive Datalog programs, (the complements of) MMSNP sentences, and ontology-mediated queries (OMQs) based on expressive description logics of…

cs.LO2011

Reasoning with Forest Logic Programs and f-hybrid Knowledge Bases

Cristina Feier, Stijn Heymans

Open Answer Set Programming (OASP) is an undecidable framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin…

cs.LO2010★ 1 cited

An Optimization for Reasoning with Forest Logic Programs

Cristina Feier, Stijn Heymans

Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg…