The following pages link to Magdalena Ortiz (Q414846):
Displaying 20 items.
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- Pebble-intervals automata and \(\text{FO}^2\) with two orders (Q782576) (← links)
- Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
- Actions over core-closed knowledge bases (Q2104517) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Polynomial rewritings from expressive description logics with closed predicates to variants of Datalog (Q2302291) (← links)
- Reasoning about explanations for negative query answers in \textit{DL-Lite} (Q2865013) (← links)
- Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms (Q2941737) (← links)
- Ontology-Mediated Query Answering with Data-Tractable Description Logics (Q2970310) (← links)
- Rewriting guarded existential rules into small Datalog programs (Q3305347) (← links)
- Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$ (Q3532465) (← links)
- Extending Carin to the Description Logics of the $\mathcal{SH}$ Family (Q3532476) (← links)
- Query Answering in Description Logics: The Knots Approach (Q3638272) (← links)
- Managing Change in Graph-Structured Data Using Description Logics (Q4608716) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- (Q4999276) (← links)
- (Q5276195) (← links)
- Strong Negation and Equivalence in the Safe Belief Semantics (Q5431610) (← links)
- Reasoning Using Knots (Q5505568) (← links)
- Datalog rewritability and data complexity of \(\mathcal{ALCHOIQ}\) with closed predicates (Q6566618) (← links)
