The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Lutz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Franz Baader, Carsten Lutz, Maja Milicic, Ulrike Sattler, Frank Wolter
    Integrating Description Logics and Action Formalisms: First Results. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:572-577 [Conf]
  2. Carsten Lutz, Ulrike Sattler
    The Complexity of Reasoning with Boolean Modal Logics. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2000, pp:329-348 [Conf]
  3. Silvio Ghilardi, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    Conservative extensions in modal logic. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2006, pp:187-207 [Conf]
  4. Carsten Lutz
    Description Logics with Concrete Domains-A Survey. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2002, pp:265-296 [Conf]
  5. Carsten Lutz
    Complexity and succinctness of public announcement logic. [Citation Graph (0, 0)][DBLP]
    AAMAS, 2006, pp:137-143 [Conf]
  6. Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
    CEL - A Polynomial-Time Reasoner for Life Science Ontologies. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:287-291 [Conf]
  7. Carsten Lutz
    NEXPTIME-Complete Description Logics with Concrete Domains. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:45-60 [Conf]
  8. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    The Complexity of Finite Model Reasoning in Description Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 2003, pp:60-74 [Conf]
  9. Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyaschev
    Tableaux for Temporal Description Logic with Constant Domains. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2001, pp:121-136 [Conf]
  10. Carsten Lutz, Dirk Walther
    PDL with Negation of Atomic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2004, pp:259-273 [Conf]
  11. Carsten Lutz
    PDL with Intersection and Converse Is Decidable. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:413-427 [Conf]
  12. Carsten Lutz, Ulrike Sattler, Frank Wolter
    Modal Logic and the Two-Variable Fragment. [Citation Graph (0, 0)][DBLP]
    CSL, 2001, pp:247-261 [Conf]
  13. Alessandro Artale, Carsten Lutz
    A Correspondence between Temporal Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1999, pp:- [Conf]
  14. Franz Baader, Carsten Lutz, Eldar Karabaev, Manfred Theißen
    A new n-ary existential quantifier in description logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2005, pp:- [Conf]
  15. Franz Baader, Carsten Lutz, Holger Sturm, Frank Wolter
    Fusions of Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2000, pp:21-30 [Conf]
  16. Franz Baader, Maja Milicic, Carsten Lutz, Ulrike Sattler, Frank Wolter
    Integrating Description Logics and Action Formalisms: First Results. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2005, pp:- [Conf]
  17. Eldar Karabaev, Carsten Lutz
    Mona as a DL Reasoner. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2004, pp:- [Conf]
  18. Oliver Kutz, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    E-connections of Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2003, pp:- [Conf]
  19. Carsten Lutz, Maja Milicic
    A Tableau Algorithm for DLs with Concrete Domains and GCIs. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2005, pp:- [Conf]
  20. Carsten Lutz, Ralf Möller
    Defined Topological Relations in Description Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1997, pp:- [Conf]
  21. Carsten Lutz, Ulrike Sattler
    Mary Likes all Cats. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2000, pp:213-226 [Conf]
  22. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    Finite Model Reasoning in ALCQI is EXPTIME Logics. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2003, pp:- [Conf]
  23. Carsten Lutz, Ulrike Sattler, Stephan Tobies
    A Suggestion for an n-ary Description Logic. [Citation Graph (0, 0)][DBLP]
    Description Logics, 1999, pp:- [Conf]
  24. Carsten Lutz, Ulrike Sattler, Frank Wolter
    Description Logics and the Two-Variable Fragment. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2001, pp:- [Conf]
  25. Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    Resasoning about Concepts and Similarity. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2003, pp:- [Conf]
  26. Carsten Lutz, Maja Milicic
    Description Logics with Concrete Domains and Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:378-382 [Conf]
  27. Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
    The Complexity of Enriched µ-Calculi. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:540-551 [Conf]
  28. Franz Baader, Sebastian Brandt, Carsten Lutz
    Pushing the EL Envelope. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:364-369 [Conf]
  29. Carsten Lutz
    Interval-based Temporal Reasoning with General TBoxes. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:89-96 [Conf]
  30. Carsten Lutz
    Reasoning with Concrete Domains. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:90-95 [Conf]
  31. Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike Sattler
    Keys, Nominals, and Concrete Domains. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:349-354 [Conf]
  32. Carsten Lutz, Dirk Walther, Frank Wolter
    Conservative Extensions in Expressive Description Logics. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:453-458 [Conf]
  33. Birte Glimm, Ian Horrocks, Carsten Lutz, Ulrike Sattler
    Conjunctive Query Answering for the Description Logic SHIQ. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:399-404 [Conf]
  34. Alessandro Artale, Carsten Lutz, David Toman
    A Description Logic of Change. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:218-223 [Conf]
  35. Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter
    Reasoning About Actions Using Description Logics with General TBoxes. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:266-279 [Conf]
  36. Franz Baader, Eldar Karabaev, Carsten Lutz, Manfred Theißen
    A New n-Ary Existential Quantifier in Description Logics. [Citation Graph (0, 0)][DBLP]
    KI, 2005, pp:18-33 [Conf]
  37. Piero A. Bonatti, Carsten Lutz, Frank Wolter
    Description Logics with Circumscription. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:400-410 [Conf]
  38. Volker Haarslev, Carsten Lutz, Ralf Möller
    Foundations of Spatioterminological Reasoning with Description Logics. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:112-123 [Conf]
  39. Silvio Ghilardi, Carsten Lutz, Frank Wolter
    Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:187-197 [Conf]
  40. Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter
    Updating Description Logic ABoxes. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:46-56 [Conf]
  41. Carsten Lutz
    Adding Numbers to the SHIQ Description Logic: First Results. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:191-202 [Conf]
  42. Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter
    From Tableaux to Automata for Description Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:1-32 [Conf]
  43. Carsten Lutz
    Complexity of Terminological Reasoning Revisited. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:181-200 [Conf]
  44. Carsten Lutz, Maja Milicic
    A Tableau Algorithm for Description Logics with Concrete Domains and GCIs. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2005, pp:201-216 [Conf]
  45. Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    A Tableau Algorithm for Reasoning about Concepts and Similarity. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2003, pp:134-149 [Conf]
  46. Carsten Lutz, Dirk Walther, Frank Wolter
    Quantitative Temporal Logics: PSPACE and Below. [Citation Graph (0, 0)][DBLP]
    TIME, 2005, pp:138-146 [Conf]
  47. Oliver Kutz, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    E-connections of abstract description systems. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:156, n:1, pp:1-73 [Journal]
  48. Carsten Lutz
    Combining interval-based temporal reasoning with general TBoxes. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:152, n:2, pp:235-274 [Journal]
  49. Franz Baader, Jan Hladik, Carsten Lutz, Frank Wolter
    From Tableaux to Automata for Description Logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:57, n:2-4, pp:247-279 [Journal]
  50. Carsten Lutz, Ulrike Sattler, Lidia Tendera
    The complexity of finite model reasoning in description logics. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:199, n:1-2, pp:132-171 [Journal]
  51. Carsten Lutz, Dirk Walther, Frank Wolter
    Quantitative temporal logics over the reals: PSpace and below. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:1, pp:99-123 [Journal]
  52. Carsten Lutz
    PSpace Reasoning with the Description Logic ALCF(D). [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:5, pp:535-568 [Journal]
  53. Franz Baader, Carsten Lutz, Holger Sturm, Frank Wolter
    Fusions of Description Logics and Abstract Description Systems. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2002, v:16, n:, pp:1-58 [Journal]
  54. Alessandro Artale, Carsten Lutz
    A Correspondence between Temporal Description Logics. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2004, v:14, n:1-2, pp:209-233 [Journal]
  55. Carsten Lutz, Dirk Walther
    PDL with Negation of Atomic Programs. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2005, v:15, n:2, pp:189-213 [Journal]
  56. Carsten Lutz, Frank Wolter
    Modal Logics of Topological Relations. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:2, pp:- [Journal]
  57. Volker Haarslev, Carsten Lutz, Ralf Möller
    A Description Logic with Concrete Domains and a Role-forming Predicate Operator. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1999, v:9, n:3, pp:351-384 [Journal]
  58. Dirk Walther, Carsten Lutz, Frank Wolter, Michael Wooldridge
    ATL Satisfiability is Indeed EXPTIME-complete. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:6, pp:765-787 [Journal]
  59. Roman Kontchakov, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    Temporalising Tableaux. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2004, v:76, n:1, pp:91-134 [Journal]
  60. Carsten Lutz, Holger Sturm, Frank Wolter, Michael Zakharyaschev
    A Tableau Decision Algorithm for Modalized ALC with Constant Domains. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2002, v:72, n:2, pp:199-232 [Journal]
  61. Carsten Lutz
    NEXP TIME-complete description logics with concrete domains. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2004, v:5, n:4, pp:669-705 [Journal]
  62. Carsten Lutz, Frank Wolter
    Conservative Extensions in the Lightweight Description Logic EL. [Citation Graph (0, 0)][DBLP]
    CADE, 2007, pp:84-99 [Conf]
  63. Alessandro Artale, Carsten Lutz, David Toman
    A Description Logic of Change. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2006, pp:- [Conf]
  64. Franz Baader, Carsten Lutz, Boontawee Suntisrivaraporn
    Efficient Reasoning in EL+. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2006, pp:- [Conf]
  65. Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wolter
    DL Actions with GCIs: a Pragmatic Approach. [Citation Graph (0, 0)][DBLP]
    Description Logics, 2006, pp:- [Conf]
  66. Stefan Göller, Markus Lohrey, Carsten Lutz
    PDL with Intersection and Converse Is 2 EXP-Complete. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2007, pp:198-212 [Conf]
  67. Adila Krisnadhi, Carsten Lutz
    Data Complexity in the EL Family of Description Logics. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:333-347 [Conf]
  68. Balder ten Cate, Carsten Lutz
    The complexity of query containment in expressive fragments of XPath 2.0. [Citation Graph (0, 0)][DBLP]
    PODS, 2007, pp:73-82 [Conf]
  69. Alessandro Artale, Roman Kontchakov, Carsten Lutz, Frank Wolter, Michael Zakharyaschev
    Temporalising Tractable Description Logics. [Citation Graph (0, 0)][DBLP]
    TIME, 2007, pp:11-22 [Conf]
  70. Carsten Lutz, Frank Wolter
    Modal Logics of Topological Relations [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  71. Carsten Lutz, Carlos Areces, Ian Horrocks, Ulrike Sattler
    Keys, Nominals, and Concrete Domains. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2005, v:23, n:, pp:667-726 [Journal]
  72. Carsten Lutz, Maja Milicic
    A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2007, v:38, n:1-3, pp:227-259 [Journal]
  73. Christof Löding, Carsten Lutz, Olivier Serre
    Propositional dynamic logic with recursive programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:51-69 [Journal]

  74. The Complexity of Conjunctive Query Answering in Expressive Description Logics. [Citation Graph (, )][DBLP]


  75. PDL with Intersection and Converse is 2EXP-complete. [Citation Graph (, )][DBLP]


  76. Data Complexity in the EL family of DLs. [Citation Graph (, )][DBLP]


  77. Inverse Roles Make Conjunctive Queries Hard. [Citation Graph (, )][DBLP]


  78. Two Upper Bounds for Conjunctive Query Answering in SHIQ. [Citation Graph (, )][DBLP]


  79. LTL over Description Logic Axioms. [Citation Graph (, )][DBLP]


  80. The Projection Problem for EL Actions. [Citation Graph (, )][DBLP]


  81. Logical Difference and Module Extraction with CEX and MEX. [Citation Graph (, )][DBLP]


  82. Query Answering over DL ABoxes: How to Pick the Relevant Symbols. [Citation Graph (, )][DBLP]


  83. Combined FO Rewritability for Conjunctive Query Answering in DL-Lite. [Citation Graph (, )][DBLP]


  84. Semantic Modularity and Module Extraction in Description Logics. [Citation Graph (, )][DBLP]


  85. Complexity of Subsumption in the [Escr ][Lscr ] Family of Description Logics: Acyclic and Cyclic TBoxes. [Citation Graph (, )][DBLP]


  86. Enriching [Escr ][Lscr ]-Concepts with Greatest Fixpoints. [Citation Graph (, )][DBLP]


  87. Conjunctive Query Answering in the Description Logic EL Using a Relational Database System. [Citation Graph (, )][DBLP]


  88. Query Answering in Description Logics with Transitive Roles. [Citation Graph (, )][DBLP]


  89. LTL over Description Logic Axioms. [Citation Graph (, )][DBLP]


  90. Tutorial Presentations at the Twelfth International Conference on Principles of Knowledge Representation and Reasoning. [Citation Graph (, )][DBLP]


  91. Decomposing Description Logic Ontologies. [Citation Graph (, )][DBLP]


  92. Probabilistic Description Logics for Subjective Uncertainty. [Citation Graph (, )][DBLP]


  93. The Combined Approach to Query Answering in DL-Lite. [Citation Graph (, )][DBLP]


  94. Query and Predicate Emptiness in Description Logics. [Citation Graph (, )][DBLP]


  95. Temporal Description Logics: A Survey. [Citation Graph (, )][DBLP]


  96. Mathematical Logic for Life Science Ontologies. [Citation Graph (, )][DBLP]


  97. Query Answering in Description Logics: The Knots Approach. [Citation Graph (, )][DBLP]


  98. Conjunctive Query Answering in EL using a Database System. [Citation Graph (, )][DBLP]


  99. Reasoning Support for Ontology Design. [Citation Graph (, )][DBLP]


  100. The Complexity of Enriched Mu-Calculi [Citation Graph (, )][DBLP]


Search in 0.041secs, Finished in 0.048secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002