| Optimal ABox Repair w.r.t. Static $$\mathcal {EL}$$ TBoxes: From Quantified ABoxes Back to ABoxes | 0 | 0.34 | 2022 |
| Description Logics That Count, and What They Can and Cannot Count (Extended Abstract). | 0 | 0.34 | 2020 |
| Deciding the Word Problem for Ground Identities with Commutative and Extensional Symbols. | 0 | 0.34 | 2020 |
| First Results on How to Certify Subsumptions Computed by the EL Reasoner ELK Using the Logical Framework with Side Conditions. | 0 | 0.34 | 2020 |
| Description Logics with Concrete Domains and General Concept Inclusions Revisited (Extended Abstract). | 0 | 0.34 | 2020 |
| Metric Temporal Description Logics with Interval-Rigid Names | 0 | 0.34 | 2020 |
| Extensions of unification modulo ACUI. | 0 | 0.34 | 2020 |
| Role-Value Maps And General Concept Inclusions In The Minimal Description Logic With Value Restrictions Or Revisiting Old Skeletons In The Dl Cupboard | 0 | 0.34 | 2020 |
| Automatic Translation of Clinical Trial Eligibility Criteria into Formal Queries. | 0 | 0.34 | 2019 |
| Satisfiability Checking and Conjunctive Query Answering in Description Logics with Global and Local Cardinality Constraints. | 0 | 0.34 | 2019 |
| Towards Privacy-Preserving Ontology Publishing. | 0 | 0.34 | 2018 |
| Standard and Non-Standard Inferences in the Description Logic FL0 Using Tree Automata. | 0 | 0.34 | 2018 |
| The Data Complexity of Answering Instance Queries in FL0. | 0 | 0.34 | 2018 |
| Extending the Description Logic ALC with More Expressive Cardinality Constraints on Concepts. | 0 | 0.34 | 2017 |
| Using Ontologies to Query Probabilistic Numerical Data. | 1 | 0.35 | 2017 |
| Decidability and Complexity of Fuzzy Description Logics. | 2 | 0.37 | 2017 |
| Query Rewriting for DL-Lite with n-ary Concrete Domains. | 1 | 0.35 | 2017 |
| A New Description Logic with Set Constraints and Cardinality Constraints on Role Successors. | 0 | 0.34 | 2017 |
| Decidability and complexity of threshold description logics induced by concept similarity measures. | 0 | 0.34 | 2017 |
| Extending the Description Logic with Acyclic TBoxes. | 0 | 0.34 | 2016 |
| Approximate Unification in the Description Logic FL_0. | 0 | 0.34 | 2016 |
| Query and Predicate Emptiness in Ontology-Based Data Access. | 5 | 0.41 | 2016 |
| Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification. | 1 | 0.35 | 2016 |
| Formalizing biomedical concepts from textual definitions. | 3 | 0.40 | 2015 |
| On the Decidability Status of Fuzzy ALC with General Concept Inclusions. | 0 | 0.34 | 2015 |
| Runtime verification using the temporal description logic ALC-LTL revisited. | 1 | 0.35 | 2014 |
| Ontology-Based Monitoring of Dynamic Systems. | 1 | 0.36 | 2014 |
| Verification of Golog Programs over Description Logic Actions. | 8 | 0.52 | 2013 |
| Experimental Results on Solving the Projection Problem in Action Formalisms Based on Description Logics. | 5 | 0.50 | 2012 |
| Solving language equations and disequations with applications to disunification in description logics and monadic set constraints | 2 | 0.36 | 2012 |
| Extending Unification in EL Towards General TBoxes. | 5 | 0.69 | 2012 |
| UEL: Unification Solver for EL. | 2 | 0.44 | 2012 |
| Unification in modal and description logics | 21 | 1.03 | 2011 |
| Query and Predicate Emptiness in Description Logics | 16 | 0.81 | 2010 |
| Unification in the Description Logic EL | 0 | 0.34 | 2010 |
| Deduktion: von der Theorie zur Anwendung | 1 | 0.36 | 2010 |
| Description Logics. | 11 | 0.73 | 2009 |
| Runtime verification using a temporal description logic | 18 | 0.78 | 2009 |
| A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms | 22 | 0.97 | 2009 |
| A Novel Architecture for Situation Awareness Systems | 26 | 1.05 | 2009 |
| Putting ABox Updates into Action | 7 | 0.49 | 2009 |
| A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes | 0 | 0.34 | 2008 |
| LTL over description logic axioms | 24 | 0.94 | 2008 |
| 07401 Abstracts Collection -- Deduction and Decision Procedures | 0 | 0.34 | 2007 |
| Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators | 20 | 1.37 | 2007 |
| Blocking Automata for PSPACE DLs | 0 | 0.34 | 2007 |
| CEL: a polynomial-time reasoner for life science ontologies | 80 | 5.07 | 2006 |
| Deduction and Applications, 23.-28. October 2005 | 6 | 2.92 | 2006 |
| Reasoning Support for Ontology Design | 5 | 0.97 | 2006 |
| Description Logics as Ontology Languages for the Semantic Web | 185 | 11.01 | 2005 |
