Fast query answering over existential rules
From MaRDI portal
Recommendations
- Finite model reasoning over existential rules
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Combining decidability paradigms for existential rules
- Towards more expressive ontology languages: the query answering problem
- Rewriting guarded existential rules into small Datalog programs
Cited in
(20)- Intelligent query answering in rule based systems
- Efficient model construction for Horn logic with VLog (system description)
- Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
- Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
- Dyadic existential rules
- Combining decidability paradigms for existential rules
- On rules with existential variables: walking the decidability line
- Semi-oblivious chase termination: the sticky case
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin
- Answer counting under guarded TGDs
- Answer Counting under Guarded TGDs
- Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets
- The impact of active domain predicates on guarded existential rules
- Rewriting guarded existential rules into small Datalog programs
- Mixing materialization and query rewriting for existential rules
- The impact of active domain predicates on guarded existential rules
- DaRLing: a Datalog rewriter for OWL 2 RL ontological reasoning under SPARQL queries
- Polynomial combined first-order rewritings for linear and guarded existential rules
- Preference-based inconsistency-tolerant query answering under existential rules
- Finite model reasoning over existential rules
This page was built for publication: Fast query answering over existential rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222877)
