Lutz, Carsten - AG Theorie der künstlichen Intelligenz, Universität Bremen

• A Description Logic of Change Alessandro Artale University of Bolzano, IT artale@inf.unibz.it
• A tableau decision algorithm for modalized ALC with constant domains
• Temporal Description Logics: A Survey Carsten Lutz
• Deciding Inseparability and Conservative Extensions in the Description Logic EL
• Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability Carsten Lutz1
• Enriching EL-Concepts with Greatest Fixpoints Carsten Lutz1 and Robert Piro2 and Frank Wolter 2
• The Combined Approach to Query Answering in DL-Lite R. Kontchakov,1
• Mathematical Logic for Life Science Ontologies Carsten Lutz1
• Non-Uniform Data Complexity of Query Answering in Description Logics
• A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
• The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000
• I N F S Y S R E S E A R C H
• Conjunctive Query Answering in EL using a Database System
• Journal of Artificial Intelligence Research ? (2009) ?-? Submitted ?/??; published ?/?? The Complexity of Circumscription in Description Logic
• Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics
• Query Answering over DL ABoxes: How to Pick the Relevant Symbols
• EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers
• NExpTime-complete Description Logics with Concrete Domains
• Dresden University of Technology Institute for Theoretical Computer Science
• Fachbereich Informatik der Universitat Hamburg VogtKollnStr. 30 D22527 Hamburg / Germany
• A New n-ary Existential Quanti er in Description Logics
• Repr asentation topologischer Informationen in Beschreibungslogiken
• Defined Topological Relations in Description Logics Carsten Lutz and Ralf Moller
• A Partial Logical Reconstruction of PLAKON/KONWERK Carsten Schroder and Ralf Moller and Carsten Lutz
• Modal Logic and the twovariable fragment Carsten Lutz 1 , Ulrike Sattler 1 , and Frank Wolter 2
• LTCS{Report Aachen University of Technology
• Concrete Domains and Nominals United Carlos Areces Carsten Lutz
• Expressive Non-Monotonic Description Logics Based on Circumscription
• Acyclic TBoxes and Complexity following chapters, investigate complexity reasoning with various
• Complexity and Succinctness of Public Announcement Carsten Lutz
• Dresden University of Technology Institute for Theoretical Computer Science
• Concrete Domains and Nominals United Carlos Areces Carsten Lutz
• Dresden University of Technology Institute for Theoretical Computer Science
• Did I Damage my Ontology? A Case for Conservative Extensions in Description Logics
• Data Complexity in the EL family of Description Logics Adila Krisnadhi1
• Query Answering in Description Logics with Transitive Roles Thomas Eiter1
• LTL over Description Logic Axioms Franz Baader
• Query Answering in Description Logics: the Knots Approach
• Conjunctive Query Answering in the Description Logic EL using a Relational Database System
• The Complexity of Query Containment in Expressive Fragments of XPath 2.0
• July 22, 2008 THE COMPLEXITY OF ENRICHED -CALCULI
• Inverse Roles Make Conjunctive Queries Hard Carsten Lutz
• CEL--A Polynomial-time Reasoner for Life Science Ontologies
• Query Containment in Description Logics Reconsidered Meghyn Bienvenu
• The Complexity of Probabilistic EL Victor Gutierrez Basulto1
• Non-Uniform Data Complexity of Query Answering in Description Logics
• Status QIO: An Update Birte Glimm1