Pages that link to "Item:Q646515"
From MaRDI portal
The following pages link to On rules with existential variables: walking the decidability line (Q646515):
Displaying 22 items.
- Knowledge base exchange: the case of OWL 2 QL (Q309909) (← links)
- Towards more expressive ontology languages: the query answering problem (Q359987) (← links)
- Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin (Q1653439) (← links)
- Logic-based argumentation with existential rules (Q1678415) (← links)
- Semi-oblivious chase termination: the sticky case (Q2035470) (← links)
- A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
- First-order rewritability of ontology-mediated queries in linear temporal logic (Q2238711) (← links)
- The price of query rewriting in ontology-based data access (Q2453744) (← links)
- Inconsistency-Tolerant Query Answering: Rationality Properties and Computational Complexity Analysis (Q2835863) (← links)
- Recent Advances in Datalog$$^\pm $$ (Q2970309) (← links)
- Preserving Constraints with the Stable Chase (Q3305357) (← links)
- Querying the Unary Negation Fragment with Regular Path Expressions. (Q3305361) (← links)
- (Q5091112) (← links)
- Datalog: Bag Semantics via Set Semantics (Q5091129) (← links)
- (Q5091130) (← links)
- A Single Approach to Decide Chase Termination on Linear Existential Rules (Q5091131) (← links)
- Reasoning on anonymity in Datalog (Q5240228) (← links)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries (Q5870513) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
- Polynomial combined first-order rewritings for linear and guarded existential rules (Q6108762) (← links)
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic (Q6135954) (← links)
- Uniform Restricted Chase Termination (Q6156026) (← links)
