Carsten Lutz
#158,249
Most Influential Person Now
German computer scientist
Carsten Lutz's AcademicInfluence.com Rankings
Carsten Lutzcomputer-science Degrees
Computer Science
#8875
World Rank
#9329
Historical Rank
Artificial Intelligence
#4066
World Rank
#4124
Historical Rank
Database
#5869
World Rank
#6087
Historical Rank

Download Badge
Computer Science
Why Is Carsten Lutz Influential?
(Suggest an Edit or Addition)Carsten Lutz's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- Pushing the EL Envelope (2005) (1265)
- An Introduction to Description Logic (2017) (337)
- Conjunctive Query Answering for the Description Logic SHIQ (2007) (308)
- Pushing the EL Envelope Further (2008) (274)
- E-connections of abstract description systems (2004) (266)
- Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics (2006) (246)
- CEL - A Polynomial-Time Reasoner for Life Science Ontologies (2006) (244)
- Conjunctive Query Answering in the Description Logic EL Using a Relational Database System (2009) (242)
- Temporal Description Logics: A Survey (2008) (232)
- Conservative Extensions in Expressive Description Logics (2007) (219)
- Description Logics with Concrete Domains-A Survey (2002) (208)
- Integrating Description Logics and Action Formalisms: First Results (2005) (207)
- The Combined Approach to Query Answering in DL-Lite (2010) (202)
- Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (2013) (184)
- The Combined Approach to Ontology-Based Data Access (2011) (164)
- Complexity and succinctness of public announcement logic (2006) (157)
- The Complexity of Conjunctive Query Answering in Expressive Description Logics (2008) (151)
- Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics (2011) (145)
- Deciding inseparability and conservative extensions in the description logic EL (2010) (145)
- Updating Description Logic ABoxes (2006) (139)
- Probabilistic Description Logics for Subjective Uncertainty (2010) (127)
- The Complexity of Circumscription in DLs (2009) (122)
- LTL over description logic axioms (2008) (112)
- A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes (2007) (111)
- Keys, Nominals, and Concrete Domains (2003) (110)
- The Complexity of Reasoning with Boolean Modal Logics (2001) (109)
- The Combined Approach to OBDA: Taming Role Hierarchies using Filters (2013) (107)
- Formal Properties of Modularisation (2009) (104)
- Semantic Modularity and Module Extraction in Description Logics (2008) (103)
- Foundations of Spatioterminological Reasoning with Description Logics (1998) (99)
- An Introduction to Description Logic by Franz Baader (2017) (98)
- Fusions of Description Logics and Abstract Description Systems (2011) (97)
- Description Logics with Circumscription (2006) (96)
- A Description Logic with Concrete Domains and a Role-forming Predicate Operator (1999) (95)
- Data Complexity in the EL Family of Description Logics (2007) (92)
- NEXPTIME-Complete Description Logics with Concrete Domains (2001) (92)
- Complexity of Terminological Reasoning Revisited (1999) (87)
- Model-theoretic inseparability and modularity of description logic ontologies (2013) (83)
- ATL Satisfiability is Indeed EXPTIME-complete (2006) (77)
- Is Tractable Reasoning in Extensions of the Description Logic EL Useful in Practice (2005) (77)
- Temporalising Tractable Description Logics (2007) (76)
- Non-Uniform Data Complexity of Query Answering in Description Logics (2012) (74)
- State of the Art Survey (2006) (74)
- Efficient Reasoning in EL+ (2006) (72)
- The complexity of finite model reasoning in description logics (2005) (71)
- Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability (2011) (71)
- Conservative Extensions in the Lightweight Description Logic EL (2007) (70)
- Query Answering in Description Logics with Transitive Roles (2009) (69)
- A Description Logic Based Approach to Reasoning about Web Services (2005) (69)
- An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL (2012) (68)
- The complexity of query containment in expressive fragments of XPath 2.0 (2007) (65)
- The Complexity of Enriched Mu-Calculi (2008) (63)
- Modal Logics of Topological Relations (2006) (62)
- NEXP TIME-complete description logics with concrete domains (2004) (62)
- The Complexity of Reasoning with Concrete Domains (1999) (62)
- Mary Likes all Cats (2000) (59)
- Description logic (2007) (59)
- Ontology-Based Data Access (2014) (59)
- Inverse Roles Make Conjunctive Queries Hard (2007) (58)
- From Tableaux to Automata for Description Logics (2003) (58)
- First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics (2016) (54)
- Ontology-Based Data Access with Closed Predicates is Inherently Intractable(Sometimes) (2013) (54)
- First-Order Rewritability of Atomic Queries in Horn Description Logics (2013) (53)
- Modal Logic and the Two-Variable Fragment (2001) (53)
- Ontology-Based Access to Probabilistic Data with OWL QL (2012) (52)
- The Complexity of Enriched µ-Calculi (2006) (52)
- Interval-based Temporal Reasoning with General TBoxes (2001) (50)
- Decomposing Description Logic Ontologies (2010) (48)
- Reasoning with Concrete Domains (1999) (45)
- Reasoning About Actions Using Description Logics with General TBoxes (2006) (44)
- Integrating Description Logics and Action Formalisms for Reasoning about Web Services (2004) (42)
- A Description Logic of Change (2007) (42)
- Adding Numbers to the SHIQ Description Logic: First Results (2002) (42)
- The complexity of description logics with concrete domains (2002) (41)
- Foundations of instance level updates in expressive description logics (2011) (41)
- Where is ...? Learning and Utilizing Motion Patterns of Persons with Mobile Robots (2003) (41)
- Ontology-Mediated Queries with Closed Predicates (2015) (40)
- E-connections of Description Logics (2003) (39)
- PDL with negation of atomic programs (2004) (39)
- Efficient Query Rewriting in the Description Logic EL and Beyond (2015) (38)
- Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk) (2017) (37)
- Exact Learning of Lightweight Description Logic Ontologies (2014) (37)
- A proposal for describing services with DLs (2002) (37)
- Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey (2016) (37)
- Query Containment in Description Logics Reconsidered (2012) (36)
- Combining interval-based temporal reasoning with general TBoxes (2004) (35)
- Learning Description Logic Concepts: When can Positive and Negative Examples be Separated? (Abstract) (2019) (34)
- Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes (2008) (34)
- PDL with intersection and converse: satisfiability and infinite-state model checking (2009) (33)
- Propositional dynamic logic with recursive programs (2006) (33)
- 2-Exp Time lower bounds for propositional dynamic logics with intersection (2005) (33)
- Description Logic, Theory Combination, and All That (2019) (33)
- A Suggestion for an n-ary Description Logic (1999) (32)
- Expressive Non-Monotonic Description Logics Based on Circumscription (2006) (32)
- A Tableau Decision Algorithm for Modalized ALC with Constant Domains (2002) (32)
- Query and Predicate Emptiness in Ontology-Based Data Access (2016) (30)
- A Tableau Algorithm for DLs with Concrete Domains and GCIs (2005) (29)
- Data Complexity in the EL family of DLs (2007) (28)
- Tableaux for Temporal Description Logic with Constant Domains (2001) (27)
- Finite Model Reasoning in Horn Description Logics (2014) (26)
- Enriching EL-Concepts with Greatest Fixpoints (2010) (26)
- Holding a Conference Online and Live due to Covid-19 (2020) (25)
- A Correspondence between Temporal Description Logics (2004) (25)
- The complexity of query containment in expressive fragments of XPath 2.0 (2009) (25)
- Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies (2002) (24)
- Ontology-Mediated Querying with the Description Logic EL: Trichotomy and Linear Datalog Rewritability (2017) (24)
- A Tableau Algorithm for Reasoning about Concepts and Similarity (2003) (24)
- Conservative extensions in modal logic (2006) (24)
- Small is Again Beautiful in Description Logics (2010) (24)
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment (2017) (23)
- Weighted model counting beyond two-variable logic (2018) (23)
- Description Logics and the Two-Variable Fragment (2001) (23)
- A Closer Look at the Probabilistic Description Logic Prob-EL (2011) (23)
- Query and Predicate Emptiness in Description Logics (2010) (23)
- Two Upper Bounds for Conjunctive Query Answering in SHIQ (2008) (23)
- PSpace Reasoning with the Description Logic ALCF(D) (2002) (23)
- The Data Complexity of Description Logic Ontologies (2016) (22)
- Defined Topological Relations in Description Logics (1997) (22)
- A Tableau Algorithm for Description Logics with Concrete Domains and GCIs (2005) (20)
- Temporalising Tableaux (2004) (20)
- Complexity of Branching Temporal Description Logics (2012) (19)
- Conjunctive Query Answering in EL using a Database System (2008) (19)
- On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems (2015) (18)
- Description Logics with Concrete Domains and Functional Dependencies (2004) (18)
- Quantitative temporal logics over the reals: PSpace and below (2007) (18)
- Logical Difference and Module Extraction with CEX and MEX (2008) (18)
- Logical Separability of Incomplete Data under Ontologies (2020) (17)
- Fusions of Description Logics (2000) (17)
- Reasoning Support for Ontology Design (2006) (16)
- Query Answering in Description Logics: The Knots Approach (2009) (16)
- A Concept Language with Role-Forming Predicate Restrictions (1998) (16)
- Schema.org as a Description Logic (2015) (16)
- CEX and MEX: Logical Diff and Logic-based Module Extraction in a Fragment of OWL (2008) (16)
- Status QIO: An Update (2011) (15)
- Query Inseparability for ALC Ontologies (2019) (15)
- Least General Generalizations in Description Logic: Verification and Existence (2020) (15)
- Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (2016) (15)
- The Data Complexity of Ontology-Mediated Queries with Closed Predicates (2018) (15)
- PDL with Intersection and Converse Is Decidable (2005) (15)
- Mathematical Logic for Life Science Ontologies (2009) (14)
- Quantitative temporal logics: PSpace and below (2005) (14)
- Mixing Open and Closed World Assumptionin Ontology-Based Data Access: Non-Uniform Data Complexity (2012) (13)
- Query-Based Entailment and Inseparability for ALC Ontologies (2016) (13)
- Query Expressibility and Verification in Ontology-Based Data Access (2020) (13)
- Combined FO Rewritability for Conjunctive Query Answering in DL-Lite (2009) (13)
- Conservative Extensions in Guarded and Two-Variable Fragments (2017) (13)
- On the Complexity of Terminological Reasoning (1999) (13)
- Deciding FO-Rewritability in EL (2012) (13)
- First-Order Rewritability of Frontier-Guarded Ontology-Mediated Queries (2018) (12)
- When is Ontology-Mediated Querying Efficient? (2019) (12)
- Conservative Rewritability of Description Logic TBoxes (2016) (11)
- Querying the Unary Negation Fragment with Regular Path Expressions (2018) (11)
- A new n-ary existential quantifier in description logics (2005) (11)
- A Tableau Calculus for Temporal Description Logic The Constant Domain Case (2001) (9)
- PDL with Intersection and Converse is 2EXP-complete (2007) (9)
- Frontiers and Exact Learning of ELI Queries under DL-Lite Ontologies (2022) (8)
- Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries (2017) (8)
- Query Conservative Extensions in Horn Description Logics with Inverse Roles (2017) (8)
- Description Logic Actions with general TBoxes: a Pragmatic Approach (2006) (8)
- The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs (2019) (8)
- Concrete domains and nominals united (2002) (8)
- CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of OWL (2008) (8)
- Query Answering in the Description Logic S (2010) (8)
- Mona as a DL Reasoner (2004) (7)
- A Basic Description Logic (2017) (7)
- TheComplexity of Reasoning with Concrete Domains (Revised Version) (1999) (7)
- Separating Data Examples by Description Logic Concepts with Restricted Signatures (2021) (7)
- Resasoning about Concepts and Similarity (2003) (6)
- EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers (2010) (6)
- Ontology Approximation in Horn Description Logics (2019) (6)
- Decidability of Circumscribed Description Logics Revisited (2014) (6)
- Conservative Extensions in Horn Description Logics with Inverse Roles (2020) (5)
- Complexity of Terminologi al Reasoning Revisited (5)
- Did I damage my Ontology (2006) (5)
- Ontology-Based Access to Probabilistic Data (2013) (5)
- Exact Learning of TBoxes in EL and DL-Lite (2013) (5)
- Actively Learning Concepts and Conjunctive Queries under ELr-Ontologies (2021) (5)
- Horn-Rewritability vs PTime Query Evaluation in Ontology-Mediated Querying (2018) (5)
- Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008) (4)
- Separating Positive and Negative Data Examples by Concepts and Formulas: The Case of Restricted Signatures (Abstract) (2020) (4)
- Actively Learning ELI Queries under DL-Lite Ontologies (2021) (4)
- The Projection Problem for EL Actions (2008) (4)
- On the Decidability of Expressive Description Logics with Transitive Closure and Regular Role Expressions (2020) (4)
- Logical separability of labeled data examples under ontologies (2020) (4)
- A Complete Classification of the Complexity and Rewritability of Ontology-Mediated Queries based on the Description Logic EL (2019) (4)
- Query Rewriting under EL TBoxes: Efficient Algorithms (2014) (4)
- Analyzing configuration systems with description logics: A case study (2005) (3)
- Formalisms for Representing Ontologies : State of the Art Survey Deliverable TONES-D 06 (2006) (3)
- Dichotomies in Ontology-Mediated Querying with the Guarded Fragment (2020) (3)
- KI 2014: Advances in Artificial Intelligence (2014) (3)
- Answer Counting under Guarded TGDs (2021) (3)
- From Conjunctive Queries to Instance Queries in Ontology-Mediated Querying (2018) (3)
- Proceedings of the 2001 Workshop on Applications of Description Logics (2001) (3)
- Query Answering over DL ABoxes: How to Pick the Relevant Symbols (2009) (3)
- Efficiently Enumerating Answers to Ontology-Mediated Queries (2022) (3)
- Query Answering in the Description Logic S Query Answering in the Description Logic S (2009) (2)
- Common Framework for Representing Ontologies Deliverable TONES-D 08 (2006) (2)
- How to Approximate Ontology-Mediated Queries (2021) (2)
- 1 Des ription Logi s with Con rete Domains | A Survey (2019) (2)
- Conservative Rewritability of Description Logic TBoxes: First Results (2015) (2)
- Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings (2008) (2)
- The Complexity of Probabilistic EL (2011) (2)
- DL Actions with GCIs: a Pragmatic Approach (2006) (2)
- Revised Ontology Task Handbook Deliverable TONES-D 07 (2006) (2)
- Decidability and Complexity of ALCOIF with Transitive Closure (and More) (2019) (2)
- NExpTime-omplete Des ription Logi s with Con rete Domains (2019) (2)
- Ontology-Mediated Querying with EL: Trichotomy and Linear Datalog Rewritability (2017) (2)
- Enriching [Escr ][Lscr ]-Concepts with Greatest Fixpoints (2010) (2)
- Expressiveness and Complexity of the Logic of Public Announcements (2004) (2)
- FO-Rewritability of Expressive Ontology-Mediated Queries (2016) (2)
- Software Tools for Ontology Design and Maintenance Deliverable TONES-D 15 (2007) (1)
- Extremal Fitting Problems for Conjunctive Queries (2022) (1)
- How to Approximate Ontology-Mediated Queries (Extended Abstract (2021) (1)
- Horn Rewritability vs PTime Query Answering for Description Logic TBoxes (2017) (1)
- Finite Model Reasoning in Horn-SHIQ (2013) (1)
- Reasoning with the Des ription Logi ALCF ( D ) (1)
- A Journey into Ontology Approximation: From Non-Horn to Horn (Abstract) (2020) (1)
- 23rd International Conference on Database Theory, ICDT 2020, March 30-April 2, 2020, Copenhagen, Denmark (2020) (1)
- Monodic Fragments of Probabilistic First-Order Logic (2014) (1)
- Reasoning in the EL Family of Description Logics (2017) (1)
- Conservative Extensions for Existential Rules (2022) (1)
- State of the Art Survey Deliverable D 01 (2005) (1)
- Conservative Extensions in Description Logics and Beyond ( Abstract of Invited Talk ) (2017) (0)
- Query Rewriting Beyond DL-Lite (2015) (0)
- Classifying the Complexity of Ontology-Mediated Queries in EL: From Atomic Queries to Conjunctive Queries (Extended Abstract) (2020) (0)
- A Little Bit of Model Theory (2017) (0)
- Reasoning about on epts and similarity (2019) (0)
- Issues published in the year 2004 1 st issue of Volume 76 The date of the publication : February 15 th , 2004 (2005) (0)
- Complexity Theory (0)
- Ontology Languages and Applications (2017) (0)
- Finite Model Reasoning in ALCQI is EXPTIME Logics (2003) (0)
- Modal Logic and the two-variable fragment ( Revised Version ) (2019) (0)
- A New n-ary Existential Quanti er in Des ription Logi s (2019) (0)
- International Masters Programme in Computational Logic Institute for Theoretical Computer Science Computer Science (2009) (0)
- From Tableaux to Automata for Des ription Logi s (2019) (0)
- Reasoning in DLs with Tableau Algorithms (2017) (0)
- On the non-efficient PAC learnability of acyclic conjunctive queries (2022) (0)
- Proceedings of the 10th International Symposium on Frontiers of Combining Systems - Volume 9322 (2015) (0)
- Frontiers of Combining Systems (2015) (0)
- Title, Program Committee, and Table of Contents (2003) (0)
- Tasks for Ontology Access , Processing , and Usage Deliverable TONES-D 10 (2006) (0)
- Finite Model Reasoning in ALCQI is ExpTime-omplete (2019) (0)
- 2 Formal Properties of Modularisation (0)
- PDL with Negation of Atomi Programs (2019) (0)
- Complete Approximations of Horn DL Ontologies (2018) (0)
- Is Tra table Reasoning in Extensions of the Des ription Logi EL Useful in Pra ti e ? (2019) (0)
- Horn rewritability vs PTime query evaluation for description logic TBoxes (2018) (0)
- The Complexity of Finite Model Reasoning in Des ription Logi s 1 (2019) (0)
- Analysis of Test-Results on Individual Test Ontologies Deliverable TONES-D 23 (2007) (0)
- A Proposal for Des ribing Servi es with DLs (2002) (0)
- Ontology-Mediated Querying on Databases of Bounded Cliquewidth (2022) (0)
- When is Query Inseparability for ALC Ontologies Decidable? (2016) (0)
- Enumerating Answers to Ontology-Mediated Queries: Partial Answers and Efficiency (Extended Abstract) (2021) (0)
- Proceedings of the 10th International Workshop on Knowledge Representation meets Databases (KRDB 2003), Hamburg, Germany, September 15-16, 2003 (2003) (0)
- Fusions of Des ription Logi s (2019) (0)
- Integrating Des ription Logi s and A tion Formalisms for Reasoning about Web (2019) (0)
- Exact Learning of ELIQs in the Presence of DL-Lite-Horn Ontologies (2022) (0)
- The Complexity of Reasoning with Concrete Domains Preliminary Version. the Complexity of Reasoning with Concrete Domains (1999) (0)
- Des ription Logi s with Con rete Domains and Fun tional Dependen ies (2019) (0)
- Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk) (2016) (0)
- A Tour of Franz Baader's Contributions to Knowledge Representation and Automated Deduction (2019) (0)
- Exact Learning of ELI Queries in the Presence of DL-Lite-Horn Ontologies (2022) (0)
- PTime Combined Complexity and FPT in Ontology-Mediated Querying (2019) (0)
- PDL with Interse tion and Converse is De idable (0)
- Chair for Automata Theory LTCS – Report Keys , Nominals , and Concrete Domains (2002) (0)
- Quantitative Temporal Logi s: PSpa e and below (2019) (0)
- From Conjunctive Queries to SPARQL Queries in Ontology-Mediated Querying (2018) (0)
- Efficient Answer Enumeration in Description Logics with Functional Roles - Extended Version (2022) (0)
- On the Description Logic SHOIF Extended with Transitive Closure and (Restricted Forms of) Regular Role Expressions (2020) (0)
- Tutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning (2010) (0)
- CEL — A Short System Demonstration ∗ (2006) (0)
- The Complexity of Answer Counting for Ontology-Mediated Queries Based on Guarded TGDs (Extended Abstract) (2020) (0)
- Proceedings of the 21st International Workshop on Description Logics (DL2008), Dresden, Germany, May 13-16, 2008 (2008) (0)
- Querying and Reasoning Under Expressive Constraints (Dagstuhl Seminar 14331) (2014) (0)
- TIME 2009, 16th International Symposium on Temporal Representation and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings (2009) (0)
This paper list is powered by the following services:
Other Resources About Carsten Lutz
What Schools Are Affiliated With Carsten Lutz?
Carsten Lutz is affiliated with the following schools: