The following pages link to Carsten Lutz (Q420807):
Displaying 24 items.
- PSpace Reasoning with the Description Logic ALCF(D) (Q4795881) (← links)
- (Q4938425) (← links)
- Ontology-Based Data Access (Q5012511) (← links)
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment (Q5121271) (← links)
- Weighted model counting beyond two-variable logic (Q5145338) (← links)
- Monodic Fragments of Probabilistic First-Order Logic (Q5167843) (← links)
- Decidability of Circumscribed Description Logics Revisited (Q5172610) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5187864) (← links)
- (Q5232905) (← links)
- NEXP TIME-complete description logics with concrete domains (Q5277711) (← links)
- Automated Reasoning (Q5307064) (← links)
- Modal Logics of Topological Relations (Q5310658) (← links)
- (Q5377468) (← links)
- Computer Science Logic (Q5394592) (← links)
- (Q5465445) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479278) (← links)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (Q5486241) (← links)
- On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems (Q5738945) (← links)
- PDL with Intersection and Converse Is 2EXP-Complete (Q5758037) (← links)
- KI 2005: Advances in Artificial Intelligence (Q5897738) (← links)
- Automated Deduction – CADE-19 (Q5900710) (← links)
- On the non-efficient PAC learnability of conjunctive queries (Q6072217) (← links)
- Answer Counting under Guarded TGDs (Q6076172) (← links)
- When is ontology-mediated querying efficient? (Q6654518) (← links)
