The following pages link to Carsten Lutz (Q420807):
Displaying 50 items.
- Foundations of instance level updates in expressive description logics (Q420809) (← links)
- Combining interval-based temporal reasoning with general TBoxes (Q814545) (← links)
- \({\mathcal E}\)-connections of abstract description systems (Q814594) (← links)
- Quantitative temporal logics over the reals: PSpace and below (Q868030) (← links)
- A tableau algorithm for description logics with concrete domains and general TBoxes (Q877890) (← links)
- Deciding inseparability and conservative extensions in the description logic (Q1041590) (← links)
- Temporalising tableaux (Q1826368) (← links)
- A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains (Q1863829) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\) (Q2144172) (← links)
- A tour of Franz Baader's contributions to knowledge representation and automated deduction (Q2185456) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- Model-theoretic inseparability and modularity of description logic ontologies (Q2351041) (← links)
- The complexity of finite model reasoning in description logics (Q2486582) (← links)
- Propositional dynamic logic with recursive programs (Q2643333) (← links)
- Query and Predicate Emptiness in Ontology-Based Data Access (Q2805284) (← links)
- LTL over description logic axioms (Q2946670) (← links)
- Probabilistic Description Logics for Subjective Uncertainty (Q2953940) (← links)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (Q2970301) (← links)
- An Introduction to Description Logic (Q2974769) (← links)
- Enriching [Escr ][Lscr ]-Concepts with Greatest Fixpoints (Q2999103) (← links)
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). (Q3174890) (← links)
- (Q3408128) (← links)
- ATL Satisfiability is Indeed EXPTIME-complete (Q3431973) (← links)
- The complexity of query containment in expressive fragments of XPath 2.0 (Q3452227) (← links)
- (Q3457242) (← links)
- Data Complexity in the $\mathcal{EL}$ Family of Description Logics (Q3498478) (← links)
- (Q3509053) (← links)
- Reasoning About Actions Using Description Logics with General TBoxes (Q3533138) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- The Complexity of Conjunctive Query Answering in Expressive Description Logics (Q3541701) (← links)
- The Complexity of Enriched μ-Calculi (Q3591423) (← links)
- Conservative Extensions in the Lightweight Description Logic $\mathcal{EL}$ (Q3608766) (← links)
- PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
- Formal Properties of Modularisation (Q3631354) (← links)
- Query Answering in Description Logics: The Knots Approach (Q3638272) (← links)
- Mathematical Logic for Life Science Ontologies (Q3638273) (← links)
- A Correspondence between Temporal Description Logics (Q3643271) (← links)
- PDL with negation of atomic programs (Q3647227) (← links)
- The Complexity of Circumscription in DLs (Q3651476) (← links)
- A description logic with concrete domains and a role-forming predicate operator (Q4260086) (← links)
- (Q4430407) (← links)
- (Q4460678) (← links)
- (Q4533343) (← links)
- (Q4539597) (← links)
- (Q4539602) (← links)
- (Q4558528) (← links)
- (Q4596784) (← links)
- Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk) (Q4601853) (← links)
- (Q4783312) (← links)
