Publications
2013
Michael Benedikt, Stefan Göller, Stefan Kiefer, and Andrzej Murawski. Bisimilarity of Pushdown Automata is Nonelementary. In Orna Kupferman, editor, Proceedings of the Twenthy-Eighth Annual ACM/IEE Symposium on Logic in Computer Science (LICS 2013). ACM/IEEE, 2013.Bibtex entry Paper (PDF)
Meghyn Bienvenu, Carsten Lutz, and Frank Wolter.
First Order-Rewritability of Atomic Queries in Horn Description Logics.
In Proceedings of the 23rd International Joint Conference on Artificial
Intelligence (IJCAI-13), 2013.
Bibtex entry Paper (PDF)
Stanislav Böhm, Stefan Göller, and Petr Jancar.
Equivalence of deterministic one-counter automata is NL-complete.
In Joan Feigenbaum, editor, Proceedings of the 45th Symposium on Theory of
Computing (STOC 2013). ACM, 2013.
Bibtex entry Paper (PDF)
Frank Dylla, Till Mossakowski, Thomas Schneider, and Diedrich Wolter.
Algebraic Properties of Qualitative Spatio-Temporal Calculi.
In Proceedings of the 11th Conference On Spatial Information Theory
(COSIT), 2013.
Accepted for publication.
Bibtex entry
Alain Finkel, Stefan Göller, and Christoph Haase.
Reachability in Register Machines with Polynomial Updates.
In Krishnendu Chatterchee and Jiri Sgall, editors, Proceedings of the 38th
International Symposium on Mathematical Foundations of Computer Science (MFCS
2013). Springer, 2013.
Bibtex entry
Stefan Göller and Markus Lohrey.
Branching-time model checking of one-counter processes and timed
automata.
SIAM Journal of Computing, 2013.
to appear.
Bibtex entry
Victor Gutiérrez-Basulto, Yazmin Angélica
Ibáñez-Garcia, Roman Kontchakov, and Egor V. Kostylev.
Conjunctive Queries with Negation over DL-Lite: A Closer Look.
In Proceedings of the 7th International Conference on Web Reasoning and
Rule Systems (RR 2013), 2013.
Bibtex entry Paper (PDF)
Yazmín Ibañez-García, Carsten Lutz, and Thomas Schneider.
Finite model reasoning in Horn-SHIQ, 2013.
Submitted to DL 2013, extended version.
Bibtex entry
Szymon Klarman and Víctor Gutiérrez-Basulto.
Description Logics of Context.
Journal of Logic and Computation, 2013.
Bibtex entry Paper (PDF)
Boriv Konev, Carsten Lutz, Dirk Walther, and Frank Wolter.
Model-Theoretic Inseparability and Modularity of Description Logic
Ontologies.
Artificial Intelligence, 2013.
Bibtex entry Paper (PDF)
Carsten Lutz, Inanc Seylan, and Frank Wolter.
Ontology-Based Data Access with Closed Predicates is Inherently Intractable
(Sometimes).
In Proceedings of the 23rd International Joint Conference on Artificial
Intelligence (IJCAI-13), 2013.
Bibtex entry Paper (PDF)
Arne Meier and Thomas Schneider.
Generalized Satisfiability for the Description Logic ALC.
Theoretical Computer Science, 2013.
Accepted for publication, special issue on TAMC 2011.
Bibtex entry
2012
Franz Baader, Silvio Ghilardi, and Carsten Lutz. LTL over description logic axioms. ACM Trans. Comput. Log., 13(3):21, 2012.Bibtex entry Paper (PDF)
Meghyn Bienvenu, Carsten Lutz, and Frank Wolter.
Deciding FO-Rewritability in EL.
In Proceedings of the 25th International Workshop on Description Logics
(DL2012), CEUR-WS, 2012.
Bibtex entry Paper (PDF)
Meghyn Bienvenu, Carsten Lutz, and Frank Wolter.
Query Containment in Description Logics Reconsidered (With Appendix).
In Proceedings of the 13nd International Joint Conference on Principles of
Knowledge Representation and Reasoning (KR2012), 2012.
Bibtex entry Paper (PDF)
Romain Brenguier, Stefan Göller, and Ocan Sankur.
A Comparison of Succinctly Represented Finite-State Systems.
In Maciej Koutny and Irek Ulidowski, editors, Proceedings of the of the
23rd International Conference on Concurrency Theory (CONCUR 2012), pages
147–161. Springer, 2012.
Bibtex entry Paper (PDF)
Christopher Broadbent and Stefan Göller.
On Bisimilarity of Higher-Order Pushdown Automata: Undecidability at Order
Two.
In Deepak D' Souza, Jaikumar Radhakrishnan, and Kavitha Telikepalli, editors,
Proceedings of Foundations of Software Technology and Theoretical
Computer Science (FSTTCS 2012). Leibniz International Proceedings in
Informatics (LIPICS), 2012.
to appear.
Bibtex entry
Chiara Del Vescovo, Pavel Klinov, Bijan Parsia, Uli Sattler, Thomas
Schneider, and Dmitry Tsarkov.
Syntactic vs. Semantic Locality: How Good Is a Cheap Approximation?.
In Proceedings of the 6th Workshop on Modular Ontologies (WoMO-12),
volume 875. CEUR-WS.org, 2012.
Bibtex entry
Stefan Göller, Christoph Haase, Joël Ouaknine, and James Worrell.
Branching-Time Model Checking of Parametric One-Counter Automata.
In Lars Birkedal, editor, Proceedings of 15th International Conference on
Foundations of Software Science and Computation Structures (FoSSaCS
2012), pages 406–420. Springer, 2012.
Bibtex entry Paper (PDF)
Stefan Göller, Jean Christoph Jung, and Markus Lohrey.
The complexity of decomposing modal and first-order theories.
In Nachum Derschowitz, editor, Proceedings of the of the 27th ACM/IEEE
Symposium on Logic in Computer Science (LICS 2012), pages 325–334.
ACM/IEEE, 2012.
Bibtex entry Paper (PDF)
Stefan Göller and Anthony Widjaja Lin.
Concurrency Makes Simple Theories Hard.
In Christoph Dürr and Thomas Wilke, editors, Proceedings of the of the
29th International Symposium on Theoretical Aspects of Computer Science
(STACS 2012). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012.
to appear.
Bibtex entry Paper (PDF)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael
Thomas, and Felix Weiß.
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural
Numbers.
In Thomas Bolander, Torben Braüner, Silvio Ghilardi, and Lawrence Moss,
editors, Advances in Modal Logic (AiML-9), pages 261–278. College
Publications, 2012.
Bibtex entry Paper (PDF)
Victor Gutiérrez-Basulto, Yazmin Angélica
Ibáñez-Garcia, and Roman Kontchakov.
An Update on Query Answering with Restricted Forms of Negation.
In Proceedings of the 6th International Conference on Web Reasoning and
Rule Systems (RR 2012), volume 7497 of Lecture Notes in Computer
Science, pages 75–89. Springer, 2012.
Bibtex entry Paper (PDF)
Victor Gutierrez-Basulto, Jean Christoph Jung, and Carsten Lutz.
Complexity of Branching Temporal Description Logics (with Appendix).
In Proceedings of the 20th European Conference on Artificial Intelligence
(ECAI12). IOS Press, 2012.
Bibtex entry Paper (PDF)
Victor Gutiérrez-Basulto and Szymon Klarman.
Towards a Unifying Approach to Representing and Querying Temporal Data in
Description Logics.
In Proceedings of the 6th International Conference on Web Reasoning and
Rule Systems (RR 2012), volume 7497 of Lecture Notes in Computer
Science, pages 90–105. Springer, 2012.
Bibtex entry Paper (PDF)
Jean Christoph Jung and Carsten Lutz.
Ontology-Based Access to Probabilistic Data with OWL-QL (with
Appendix).
In Proceedings of the 11th International Semantic Web Conference (ISWC
2012). Springer, 2012.
Bibtex entry Paper (PDF)
Pavel Klinov, Chiara Del Vescovo, and Thomas Schneider.
Incrementally Updateable and Persistent Decomposition of OWL
Ontologies.
In Proceedings of the 9th OWL: Experiences and Directions Workshop
(OWLED), volume 749 of CEUR Workshop Proceedings. CEUR-WS.org,
2012.
Bibtex entry Paper (PDF)
Carsten Lutz, Inanc Seylan, David Toman, and Frank Wolter.
The Combined Approach to OBDA: Taming Role Hierarchies using Filters (With
Appendix).
In Proceedings of the Joint Workshop on Scalable and High-Performance
Semantic Web Systems (SSWS+HPCSW 2012), 2012.
Bibtex entry Paper (PDF)
Carsten Lutz, Inanc Seylan, and Frank Wolter.
An Automata-Theoretic Approach to Uniform Interpolation and Approximation
in the Description Logic EL (With Appendix).
In Proceedings of the 13nd International Joint Conference on Principles of
Knowledge Representation and Reasoning (KR2012), 2012.
Bibtex entry Paper (PDF)
Carsten Lutz, Inanc Seylan, and Frank Wolter.
Mixing Open and Closed World Assumption in Ontology-Based Data Access:
Non-Uniform Data Complexity.
In Proceedings of the 25th International Workshop on Description Logics
(DL2012), CEUR-WS, 2012.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Non-Uniform Data Complexity of Query Answering in Description Logics (With
Appendix).
In Proceedings of the 13nd International Joint Conference on Principles of
Knowledge Representation and Reasoning (KR2012), 2012.
Bibtex entry Paper (PDF)
Thomas Schneider and Dirk Walther, editors.
Proceedings of the 6th International Workshop on Modular Ontologies,
volume 875. CEUR-WS.org, 2012.
Bibtex entry
2011
Michael Bauland, Martin Mundhenk, Thomas Schneider, Henning Schnoor, Ilka Schnoor, and Heribert Vollmer. The tractability of model checking for LTL: The good, the bad, and the ugly fragments. ACM Transactions on Computational Logic, 12(2):13, 2011.Bibtex entry
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael
Thomas, and Heribert Vollmer.
Model Checking CTL is Almost Always Inherently Sequential.
Logical Methods in Computer Science, 7(2), 2011.
Bibtex entry Paper (PDF)
Stanislav Böhm and Stefan Göller.
Language equivalence of deterministic real-time one-counter automata is
NL-complete.
In Filip Murlak and Piotr Sankowski, editors, Proceedings of the of the
36th International Symposium on Mathematical Foundations of Computer Science
(MFCS 2011). Springer, 2011.
to appear.
Bibtex entry Paper (PDF)
Chiara Del Vescovo, Damian D.G. Gessler, Pavel Klinov, Bijan Parsia, Uli
Sattler, Thomas Schneider, and Andrew Winget.
Decomposition and Modular Structure of BioPortal Ontologies.
In Proceedings of the 10th International Semantic Web Conference
(ISWC-11), volume 7031 of LNCS, pages 130–145. Springer, 2011.
Bibtex entry Paper (PDF) ©Springer-Verlag
Chiara Del Vescovo, Bijan Parsia, Uli Sattler, and Thomas Schneider.
The Modular Structure of an Ontology: Atomic Decomposition.
In Proceedings of the 22nd International Joint Conference on Artificial
Intelligence (IJCAI-11), pages 2232–2237. AAAI Press, 2011.
Bibtex entry Paper (PDF)
Chiara Del Vescovo, Bijan Parsia, Uli Sattler, and Thomas Schneider.
The modular structure of an ontology: atomic decomposition and module
count.
In Proceedings of the 5th International Workshop on Modular Ontologies
(WoMO-11), volume 230 of Frontiers in Artificial Intelligence and
Applications, pages 25–39. IOS Press, 2011.
Bibtex entry Paper (PDF)
Enrico Franconi, Yazmin Angélica Ibáñez-Garcia, and Inanç
Seylan.
Query Answering with DBoxes is Hard.
Electr. Notes Theor. Comput. Sci., 278:71–84, 2011.
Bibtex entry Paper (PDF)
Birte Glimm, Yevgeny Kazakov, and Carsten Lutz.
Status QIO: An Update.
In Proceedings of the 24th International Workshop on Description Logics
(DL2011), volume 745 of CEUR-WS, 2011.
Bibtex entry Paper (PDF)
Stefan Göller and Anthony Widjaja Lin.
The Complexity of Verifying Ground Tree Rewrite Systems.
In Martin Grohe, editor, Proceedings of the of the 26th Annual IEEE
Symposium on Logic in Computer Science (LICS 2011). IEEE, 2011.
to appear.
Bibtex entry Paper (PDF)
Stefan Göller and Anthony Widjaja Lin.
Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite
Systems.
In Joost-Pieter Katoen and Barbara König, editors, Proceedings of the
of the 22nd International Conference on Concurrency Theory (CONCUR 2011).
Springer, 2011.
to appear.
Bibtex entry Paper (PDF)
Stefan Göller and Markus Lohrey.
The First-Order Theory of Ground-Tree Rewrite Systems.
In Supratik Chakraborty and Amit Kumar, editors, Proceedings of Foundations
of Software Technology and Theoretical Computer Science (FSTTCS 2011).
Leibniz International Proceedings in Informatics (LIPICS), 2011.
to appear.
Bibtex entry Paper (PDF)
Víctor Gutiérrez-Basulto, Jean Christoph Jung, Carsten Lutz, and Lutz
Schröder.
A Closer Look at the Probabilistic Description Logic
Prob-EL.
In Proceedings of Twenty-Fifth Conference on Artificial Intelligence
(AAAI-11), 2011.
Bibtex entry Paper (PDF)
Victor Gutierrez-Basulto, Jean Christoph Jung, Carsten Lutz, and Lutz
Schröder.
The Complexity of Probabilistic EL.
In Proceedings of the 24th International Workshop on Description Logics
(DL2011), volume 745 of CEUR-WS, 2011.
Bibtex entry Paper (PDF)
Mark Kaminski, Thomas Schneider, and Gert Smolka.
Correctness and Worst-Case Optimality of Pratt-Style Decision Procedures
for Modal and Hybrid Logics.
In K. Brünnler and G. Metcalfe, editors, Proceedings of the 20th
International Conference on Automated Reasoning with Analytic Tableaux and
Related Methods (TABLEAUX-11), volume 6793 of LNCS, pages
196–210. Springer, 2011.
Bibtex entry Paper (PDF) ©Springer-Verlag
Szymon Klarman and Víctor Gutiérrez-Basulto.
Two-Dimensional Description Logics for Context-Based Semantic
Interoperability.
In Proceedings of Twenty-Fifth Conference on Artificial Intelligence
(AAAI-11), 2011.
Bibtex entry Paper (PDF)
Szymon Klarman and Víctor Gutiérrez-Basulto.
Two-Dimensional Description Logics of Context.
In Proceedings of the 24th International Workshop on Description Logics
(DL2011), CEUR-WS, 2011.
Bibtex entry Paper (PDF)
Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter,
and Michael Zakharyaschev.
Conjunctive Query Inseparability of OWL 2 QL TBoxes.
In Proceedings of the Twenty-Fifth Conference on Artificial Intelligence
(AAAI-11), 2011.
To appear.
Bibtex entry Paper (PDF)
Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider, Frank Wolter,
and Michael Zakharyaschev.
Module Extraction via Query Inseparability in OWL 2 QL.
In Proceedings of the Twenty-Fourth International Workshop on Description
Logics (DL-11), volume 745 of CEUR Workshop Proceedings.
CEUR-WS.org, 2011.
Bibtex entry Paper (PDF)
Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael
Zakharyaschev.
The Combined Approach to Ontology-Based Data Access.
In Proceedings of the 22nd International Joint Conference on Artificial
Intelligence (IJCAI-11), 2011.
Bibtex entry Paper (PDF)
Oliver Kutz and Thomas Schneider, editors.
Modular Ontologies – Proceedings of the Fifth International Workshop,
volume 230 of Frontiers in Artificial Intelligence and Applications.
IOS Press, 2011.
Bibtex entry
Hongkai Liu, Carsten Lutz, Maja Milicic, and Frank Wolter.
Foundations of instance level updates in expressive description logics.
Artificial Intelligence, 175(18):2170–2197, 2011.
Bibtex entry Paper (PDF)
Carsten Lutz, Robert Piro, and Frank Wolter.
Description Logic TBoxes: Model-theoretic Characterizations and
Rewritability.
In Proceedings of the 22nd International Joint Conference on Artificial
Intelligence (IJCAI-11), 2011.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Foundations for Uniform Interpolation and Forgetting in Expressive
Description Logics.
In Proceedings of the 22nd International Joint Conference on Artificial
Intelligence (IJCAI-11), 2011.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Non-Uniform Data Complexity of Query Answering in Description Logics (With
Appendix).
In Proceedings of the 24th International Workshop on Description Logics
(DL2011), volume 745 of CEUR-WS, 2011.
Bibtex entry Paper (PDF)
Arne Meier and Thomas Schneider.
Generalized Satisfiability for the Description Logic ALC (Extended
Abstract).
In M. Ogihara and J. Tarui, editors, Proceedings of the 8th Annual
Conference on Theory and Applications of Models of Computation (TAMC-11),
volume 6648 of Lecture Notes in Computer Science, pages 552–562.
Springer, 2011.
Bibtex entry Paper (PDF) ©Springer-Verlag
Alan L. Rector, Sam Brandt, and Thomas Schneider.
Getting the foot out of the pelvis: modeling problems affecting use of
SNOMED CT hierarchies in practical applications.
JAMIA, 18(4):432–440, 2011.
Bibtex entry
Balder ten Cate, Enrico Franconi, and Inanç Seylan.
Beth Definability in Expressive Description Logics.
In Proceedings of the 22nd International Joint Conference on Artificial
Intelligence (IJCAI-11), 2011.
to appear.
Bibtex entry Paper (PDF)
2010
Franz Baader, Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. Query and Predicate Emptiness in Description Logics. In Fangzhen Lin and Ulrike Sattler, editors, Proceedings of the 12th International Conference on Principles of Knowledge Representation and Reasoning (KR2010). AAAI Press, 2010.Bibtex entry Paper (PDF)
Meghyn Bienvenu, Thomas Eiter, Carsten Lutz, Magdalena Ortiz, and Mantas
Simkus.
Query answering in the Description Logic S.
In Proceedings of the 23rd International Workshop on Description Logics
(DL2010), CEUR-WS, 2010.
Bibtex entry Paper (PDF)
Meghyn Bienvenu, Hélène Fargier, and Pierre Marquis.
Knowledge Compilation in the Modal Logic S5.
In Proceedings of the Twenty-Fifth Conference on Artificial Intelligence
(AAAI-10), 2008.
Bibtex entry Paper (PDF)
Meghyn Bienvenu, Jérôme Lang, and Nic Wilson.
From preference logics to preference languages, and back.
In Fangzhen Lin and Ulrike Sattler, editors, Proceedings of the 12th
International Conference on Principles of Knowledge Representation and
Reasoning (KR2010). AAAI Press, 2010.
Bibtex entry Paper (PDF)
Stanislav Böhm, Stefan Göller, and Petr Jancar.
Bisimilarity of One-Counter Processes is PSPACE-complete.
In Paul Gastin and Francois Laroussinie, editors, Proceedings of the 21st
International Conference on Concurrency Theory (CONCUR 2010). Springer,
2010.
Bibtex entry Paper (PDF)
Stefan Göller, Christoph Haase, Joël Ouaknine, and James Worrell.
Model Checking Succinct and Parametric One-Counter Automata.
In Samson Abramsky, editor, Proceedings of the 37th International
Colloquium on Automata, Languages and Programming (ICALP 2010).
Springer, 2010.
Bibtex entry Paper (PDF)
Stefan Göller and Markus Lohrey.
Branching-time Model Checking of One-counter Processes.
In Jean-Yves Marion and Thomas Schwentick, editors, Proceedings of the 27th
International Symposium of Theoretical Aspects of Computer Science (STACS
2010). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2010.
Bibtex entry Paper (PDF)
Szymon Klarman and Victor Gutierrez-Basulto.
ALC_ALC: a Context Description Logic.
In Proceedings of the 12th European Conference on Logics in Artificial
Intelligence (JELIA 2010), 2010.
Bibtex entry Paper (PDF)
Boris Konev, Carsten Lutz, Denis Ponomaryov, and Frank Wolter.
Decomposing Description Logic Ontologies.
In Fangzhen Lin and Ulrike Sattler, editors, Proceedings of the 12th
International Conference on Principles of Knowledge Representation and
Reasoning (KR2010). AAAI Press, 2010.
Bibtex entry Paper (PDF)
Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael
Zakharyaschev.
The Combined Approach to Query Answering in DL-Lite.
In Fangzhen Lin and Ulrike Sattler, editors, Proceedings of the 12th
International Conference on Principles of Knowledge Representation and
Reasoning (KR2010). AAAI Press, 2010.
Bibtex entry Paper (PDF)
Carsten Lutz, Robert Piro, and Frank Wolter.
Enriching EL-Concepts with Greatest Fixpoints.
In Proceedings of the 19th European Conference on Artificial Intell igence
(ECAI10). IOS Press, 2010.
Bibtex entry Paper (PDF)
Carsten Lutz, Robert Piro, and Frank Wolter.
EL-concepts go Second Order: Greatest Fixpoints and Simulation
Quantifiers.
In Proceedings of the 23rd International Workshop on Description Logics
(DL2010), CEUR-WS, 2010.
Bibtex entry Paper (PDF)
Carsten Lutz and Lutz Schröder.
Probabilistic Description Logics for Subjective Uncertainty.
In Fangzhen Lin and Ulrike Sattler, editors, Proceedings of the 12th
International Conference on Principles of Knowledge Representation and
Reasoning (KR2010). AAAI Press, 2010.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Deciding inseparability and conservative extensions in the description
logic EL.
Journal of Symbolic Computation, 45(2):194–228, 2010.
Bibtex entry Paper (PDF)
2009
Franz Baader, Meghyn Bienvenu, Carsten Lutz, and Frank Wolter. Query Answering over DL ABoxes: How to Pick the Relevant Symbols. In Proceedings of the 22nd International Workshop on Description Logics (DL2009), volume 477 of CEUR-WS, 2009.Bibtex entry Paper (PDF)
Meghyn Bienvenu.
Prime Implicates and Prime Implicants: From Propositional to Modal
Logic.
Journal of Artificial Intelligence Research, 36:71–128, 2009.
Bibtex entry Paper (PDF)
Piero Bonatti, Carsten Lutz, and Frank Wolter.
The Complexity of Circumscription in Description Logic.
Journal of Artificial Intelligence Research (JAIR), 35:717–775,
2009.
Bibtex entry Paper (PDF)
Balder ten Cate and Carsten Lutz.
The complexity of query containment in expressive fragments of XPath
2.0.
Journal of the ACM, 56(6), 2009.
Bibtex entry Paper (PDF)
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, and Mantas Simkus.
Query Answering in Description Logics: The Knots Approach.
In Hiroakira Ono, Makoto Kanazawa, and Ruy J. G. B. de Queiroz, editors,
Proceedings of the 16th International Workshop on Logic, Language,
Information and Computation (WoLLIC 2009), volume 5514 of LNCS,
pages 26–36. Springer, 2009.
Bibtex entry Paper (PDF)
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, and Mantas Simkus.
Query Answering in Description Logics with Transitive Roles.
In Proceedings of the 21st International Joint Conference on Artificial
Intelligence (IJCAI09). AAAI Press, 2009.
Bibtex entry Paper (PDF)
Stefan Göller, Markus Lohrey, and Carsten Lutz.
PDL with Intersection and Converse: Satisfiability and Infinite-State
Model Checking.
Journal of Symbolic Logic, 74(1):279–314, 2009.
Bibtex entry Paper (PDF)
Stefan Göller, Richard Mayr, and Anthony Widjaja To.
On the Computational Complexity of Verifying One-Counter Processes.
In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer
Science (LICS09). IEEE Computer Society, 2009.
Bibtex entry Paper (PDF)
Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter.
Formal properties of modularization.
In Heiner Stuckenschmidt, Christine Parent, and Stefano Spaccapietra, editors,
Modular Ontologies: Concepts, Theories and Techniques for Knowledge
Modularization, volume 5445 of Lecture Notes in Computer Science,
pages 25–66. Springer, 2009.
Bibtex entry Paper (PDF)
Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael
Zakharyaschev.
Combined FO Rewritability for Conjunctive Query Answering in DL-Lite.
In Proceedings of the 22nd International Workshop on Description Logics
(DL2009), volume 477 of CEUR-WS, 2009.
Bibtex entry Paper (PDF)
Carsten Lutz, David Toman, and Frank Wolter.
Conjunctive Query Answering in the Description Logic EL using a
Relational Database System.
In Proceedings of the 21st International Joint Conference on Artificial
Intelligence (IJCAI09). AAAI Press, 2009.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Mathematical Logic for Life Science Ontologies.
In Hiroakira Ono, Makoto Kanazawa, and Ruy J. G. B. de Queiroz, editors,
Proceedings of the 16th International Workshop on Logic, Language,
Information and Computation (WoLLIC 2009), volume 5514 of LNCS,
pages 37–47. Springer, 2009.
Bibtex entry Paper (PDF)
2008
Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL Envelope Further. In Kendall Clark and Peter F. Patel-Schneider, editors, In Proceedings of the OWLED 2008 DC Workshop on OWL: Experiences and Directions, 2008.Bibtex entry Paper (PDF)
Franz Baader, Silvio Ghilardi, and Carsten Lutz.
LTL over Description Logic Axioms.
In Gerhard Brewka and Jérôme Lang, editors, Proceedings of the 11th
International Conference on Principles of Knowledge Representation and
Reasoning (KR2008), pages 684–694. AAAI Press, 2008.
Bibtex entry Paper (PDF)
Franz Baader, Silvio Ghilardi, and Carsten Lutz.
LTL over Description Logic Axioms.
In Proceedings of the 21st International Workshop on Description Lo gics
(DL2008), volume 353 of CEUR-WS, 2008.
Bibtex entry Paper (PDF)
Meghyn Bienvenu.
Complexity of Abduction in the EL Family of Lightweight Description
Logics.
In Gerhard Brewka and Jérôme Lang, editors, Proceedings of the
Eleventh International Conference on Principles of Knowledge Representation
and Reasoning (KR08), pages 220–230. AAAI Press, 2008.
Bibtex entry Paper (PDF)
Meghyn Bienvenu.
Prime Implicate Normal Form for ALC Concepts.
In Proceedings of the Twenty-Third Conference on Artificial Intelligence
(AAAI-08), pages 412–417. AAAI Press, 2008.
Bibtex entry Paper (PDF)
P. Bonatti, C. Lutz, A. Murano, and M. Vardi.
The Complexity of Enriched mu-Calculi.
Logical Methods in Computer Science, 4(3), 2008.
Bibtex entry Paper (PDF)
Birte Glimm, Carsten Lutz, Ian Horrocks, and Ulrike Sattler.
Answering conjunctive queries in the SHIQ description
logic.
Journal of Artificial Intelligence Research, 31:150–197, 2008.
Bibtex entry Paper (PDF)
Christoph Haase and Carsten Lutz.
Complexity of Subsumption in the EL Family of Description Logics: Acyclic
and Cyclic TBoxes.
In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fakotakis, and Nikos
Avouris, editors, Proceedings of the 18th European Conference on
Artificial Intelligence (ECAI08), volume 178 of Frontiers in
Artificial Intelligence and Applications, pages 25–29. IOS Press, 2008.
Bibtex entry Paper (PDF)
Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolte r.
Logical Difference and Module Extraction with CEX and MEX.
In Proceedings of the 21st International Workshop on Description Lo gics
(DL2008), volume 353 of CEUR-WS, 2008.
Bibtex entry Paper (PDF)
Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter.
CEX and MEX: Logical Diff and Semantic Module Extraction in a Fragment of
OWL.
In Kendall Clark and Peter F. Patel-Schneider, editors, In Proceedings of
the OWLED 2008 DC Workshop on OWL: Experiences and Directions, 2008.
Bibtex entry Paper (PDF)
Boris Konev, Carsten Lutz, Dirk Walther, and Frank Wolter.
Semantic Modularity and Module Extraction in Description Logics.
In Malik Ghallab, Constantine D. Spyropoulos, Nikos Fakotakis, and Nikos
Avouris, editors, Proceedings of the 18th European Conference on
Artificial Intelligence (ECAI08), volume 178 of Frontiers in
Artificial Intelligence and Applications, pages 55–59. IOS Press, 2008.
Bibtex entry Paper (PDF)
Hongkai Liu, Carsten Lutz, and Maja Milicic.
The Projection Problem for EL Actions.
In Proceedings of the 2008 International Workshop on Description Logics
(DL2008), volume 353 of CEUR-WS, 2008.
Bibtex entry Paper (PDF)
Carsten Lutz.
The Complexity of Conjunctive Query Answering in Expressive Description
Logics.
In Alessandro Armando, Peter Baumgartner, and Gilles Dowek, editors,
Proceedings of the 4th International Joint Conference on Automated Reasoning
(IJCAR2008), number 5195 in LNAI, pages 179–193. Springer, 2008.
Bibtex entry Paper (PDF)
Carsten Lutz.
Two Upper Bounds for Conjunctive Query Answering in SHIQ.
In Proceedings of the 21st International Workshop on Description Logics
(DL2008), volume 353 of CEUR-WS, 2008.
Bibtex entry Paper (PDF)
Carsten Lutz, Frank Wolter, and Michael Zakharyaschev.
Temporal Description Logics: A Survey.
In Proceedings of the Fifteenth International Symposium on Temporal
Representation and Reasoning. IEEE Computer Society Press, 2008.
Bibtex entry Paper (PDF)
2007
Alessandro Artale, Roman Kontchakov, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. Temporalising Tractable Description Logics. In Proceedings of the Fourteenth International Symposium on Temporal Representation and Reasoning. IEEE Computer Society Press, 2007.Bibtex entry Paper (PDF)
Alessandro Artale, Carsten Lutz, and David Toman.
A Description Logic of Change.
In Manuela Veloso, editor, Proceedings of the Twentieth International Joint
Conference on Artificial Intelligence (IJCAI'07), pages 218–223. AAAI
Press, 2007.
Bibtex entry Paper (PDF)
Franz Baader, Carsten Lutz, and Boontawee Suntisrivaraporn.
Is Tractable Reasoning in Extensions of the Description Logic
EL Useful in Practice?.
In Journal of Logic, Language and Information, Special Issue on Method for
Modality (M4M), 2007.
To appear.
Bibtex entry Paper (PS) Paper (PDF)
Birte Glimm, Carsten Lutz, Ian Horrocks, and Ulrike Sattler.
Answering conjunctive queries in the SHIQ description
logic.
In Manuela Veloso, editor, Proceedings of the Twentieth International Joint
Conference on Artificial Intelligence (IJCAI'07), pages 299–404. AAAI
Press, 2007.
Bibtex entry Paper (PDF)
Stefan Göller, Markus Lohrey, and Carsten Lutz.
PDL with Intersection and Converse is 2EXP-complete.
In Helmut Seidl, editor, Proceedings of the Tenth International Conference
on Foundations of Software Science and Computation Structures
(FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science,
pages 198–212. Springer-Verlag, 2007.
Bibtex entry Paper (PDF)
Adila Krisnadhi and Carsten Lutz.
Data Complexity in the EL family of Description Logics.
In Nachum Dershowitz and Andrei Voronkov, editors, Proceedings of the 14th
International Conference on Logic for Programming, Artificial Intelligence,
and Reasoning (LPAR2007), volume 4790 of Lecture Notes in
Artificial Intelligence, pages 333–347. Springer-Verlag, 2007.
Bibtex entry Paper (PDF)
Adila Krisnadhi and Carsten Lutz.
Data Complexity in the EL family of DLs.
In Proceedings of the 2007 International Workshop on Description Logics
(DL2007), volume 250 of CEUR-WS, 2007.
Bibtex entry Paper (PDF)
Cristoph Löding, Carsten Lutz, and Olivier Serre.
Propositional Dynamic Logic with Recursive Programs.
Journal of Logic and Algebraic Programming, 73:51–69, 2007.
Bibtex entry Paper (PDF)
Carsten Lutz.
Inverse Roles Make Conjunctive Queries Hard.
In Proceedings of the 2007 International Workshop on Description Logics
(DL2007), volume 250 of CEUR-WS, 2007.
Bibtex entry Paper (PDF)
Carsten Lutz and Maja Milicic.
A Tableau Algorithm for DLs with Concrete Domains and GCIs.
Journal of Automated Reasoning, 38(1–3):227–259, 2007.
Bibtex entry Paper (PDF)
Carsten Lutz, Dirk Walther, and Frank Wolter.
Conservative Extensions in Expressive Description Logics.
In Manuela Veloso, editor, Proceedings of the Twentieth International Joint
Conference on Artificial Intelligence (IJCAI'07), pages 453–458. AAAI
Press, 2007.
Bibtex entry Paper (PDF)
Carsten Lutz and Frank Wolter.
Conservative Extensions in the Lightweight Description Logic
EL.
In Frank Pfenning, editor, Proceedings of the 21th Conference on Automated
Deduction (CADE-21), volume 4603 of Lecture Notes in Artificial
Intelligence, pages 84–99. Springer-Verlag, 2007.
Bibtex entry Paper (PDF) ©Springer-Verlag
Balder ten Cate and Carsten Lutz.
Query Containment in Very Expressive XPath dialects.
In Leonid Libkin, editor, 26th ACM Symposium on Principles of Database
Systems (PODS'07), pages 73–82. ACM Press, 2007.
Bibtex entry Paper (PDF)
2006
F. Baader and C. Lutz. Description Logic. In Patrick Blackburn, Johan van Benthem, and Frank Wolter, editors, The Handbook of Modal Logic, pages 757–820. Elsevier, 2006.Bibtex entry Paper (PS)
F. Baader, C. Lutz, and B. Suntisrivaraporn.
CEL—A Polynomial-time Reasoner for Life Science
Ontologies.
In U. Furbach and N. Shankar, editors, Proceedings of the 3rd International
Joint Conference on Automated Reasoning (IJCAR'06), volume 4130 of
Lecture Notes in Artificial Intelligence, pages 287–291.
Springer-Verlag, 2006.
Bibtex entry Paper (PS) Paper (PDF) ©Springer-Verlag
F. Baader, C. Lutz, and B. Suntisrivaraporn.
Efficient Reasoning in EL+.
In Proceedings of the 2006 International Workshop on Description Logics
(DL'06), volume 189 of CEUR-WS, 2006.
Bibtex entry Paper (PS) Paper (PDF)
P. Bonatti, C. Lutz, A. Murano, and M. Vardi.
The Complexity of Enriched µ-Calculi.
In Michele Bugliesi, Bart Preneel, Vladimiro Sassone, and Ingo Wegener,
editors, Proccedings of the 33rd International Colloquium on Automata,
Languages and Programming, Part II (ICALP'06), volume 4052 of
Lecture Notes in Computer Science, pages 540–551. Springer-Verlag, 2006.
Bibtex entry Paper (PDF) ©Springer-Verlag
P. Bonatti, C. Lutz, and F. Wolter.
Expressive Non-Monotonic Description Logics Based on Circumscription.
In Patrick Doherty, John Mylopoulos, and Christopher Welty, editors,
Proceedings of the Tenth International Conference on Principles of Knowledge
Representation and Reasoning (KR'06), pages 400–410. AAAI Press, 2006.
Bibtex entry Paper (PDF)
S. Ghilardi, C. Lutz, and F. Wolter.
Did I Damage my Ontology? A Case for Conservative Extensions in
Description Logics.
In Patrick Doherty, John Mylopoulos, and Christopher Welty, editors,
Proceedings of the Tenth International Conference on Principles of Knowledge
Representation and Reasoning (KR'06), pages 187–197. AAAI Press, 2006.
Bibtex entry Paper (PDF)
S. Ghilardi, C. Lutz, F. Wolter, and M. Zakharyaschev.
Conservative Extensions in Modal Logics.
In Guido Governatori, Ian Hodkinson, and Yde Venema, editors, Advances in
Modal Logics Volume 6, pages 187–207. College Publications, 2006.
Bibtex entry Paper (PDF)
H. Liu, C. Lutz, M. Milicic, and F. Wolter.
Description Logic Actions with general TBoxes: a Pragmatic
Approach.
In Proceedings of the 2006 International Workshop on Description Logics
(DL2006), 2006.
Bibtex entry Paper (PDF)
H. Liu, C. Lutz, M. Milicic, and F. Wolter.
Reasoning about Actions using Description Logics with general TBoxes.
In Michael Fisher, Wiebe van der Hoek, Boris Konev, and Alexei Lisitsa,
editors, Proceedings of the 10th European Conference on Logics in
Artificial Intelligence (JELIA 2006), volume 4160 of Lecture Notes
in Artificial Intelligence, pages 266–279. Springer-Verlag, 2006.
Bibtex entry Paper (PDF)
H. Liu, C. Lutz, M. Milicic, and F. Wolter.
Updating Description Logic ABoxes.
In Patrick Doherty, John Mylopoulos, and Christopher Welty, editors,
Proceedings of the Tenth International Conference on Principles of Knowledge
Representation and Reasoning (KR'06), pages 46–56. AAAI Press, 2006.
Bibtex entry Paper (PDF)
C. Lutz.
Complexity and Succinctness of Public Announcement Logic.
In Peter Stone and Gerhard Weiss, editors, Proceedings of the Fifth
International Joint Conference on Autonomous Agents and Multiagent Systems
(AAMAS'06), pages 137–144. Association for Computing Machinery (ACM),
2006.
Bibtex entry Paper (PDF)
C. Lutz and M. Milicic.
A Tableau Algorithm for DLs with Concrete Domains and GCIs.
Journal of Automated Reasoning, 38(1–3):227–259, 2007.
Bibtex entry Paper (PDF)
C. Lutz, D. Walther, and F. Wolter.
Quantitative Temporal Logics: PSpace and below.
Information and Computation, 205(1):99–123, 2006.
Bibtex entry Paper (PS)
C. Lutz and F. Wolter.
Modal Logics of Topological Relations.
Logical Methods in Computer Science, 2(2), 2006.
Bibtex entry Paper (PS)
Carsten Lutz, Franz Baader, Enrico Franconi, Domenico Lembo, Ralf Möller,
Riccardo Rosati, Ulrike Sattler, Boontawee Suntisrivaraporn, and Sergio
Tessaris.
Reasoning Support for Ontology Design.
In Proceedings of the 2006 Workshop on OWL: Experiences and
Directions, 2006.
Bibtex entry Paper (PDF)
D. Walther, C. Lutz, F. Wolter, and M. Wooldridge.
ATL is Indeed ExpTime-complete.
Journal of Logic and Computation, 16(6):765–787, 2006.
Bibtex entry Paper (PDF)
2005
F. Baader, S. Brandt, and C. Lutz. Pushing the EL Envelope. In Leslie Pack Kaelbling and Alessandro Saffiotti, editors, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence IJCAI-05, pages 364–369. Morgan-Kaufmann Publishers, 2005.Bibtex entry Paper (PDF)
F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter.
A Description Logic Based Approach to Reasoning about Web Services.
In Proceedings of the WWW 2005 Workshop on Web Service Semantics
(WSS2005), Chiba City, Japan, 2005.
Bibtex entry Paper (PDF)
F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter.
Integrating Description Logics and Action Formalisms: First Results.
In Manuela M. Veloso and Subbarao Kambhampati, editors, Proceedings of the
Twentieth National Conference on Artificial Intelligence (AAAI-05),
pages 572–577. AAAI Press, 2005.
Bibtex entry Paper (PDF)
F. Baader, C. Lutz, M. Milicic, U. Sattler, and F. Wolter.
Integrating Description Logics and Action Formalisms: First Results.
In Proceedings of the 2005 International Workshop on Description Logics
(DL2005), number 147 in CEUR-WS, 2005.
Bibtex entry Paper (PDF)
F. Baader, C. Lutz, and B. Suntisrivaraporn.
Is Tractable Reasoning in Extensions of the Description Logic
EL Useful in Practice?.
In Proceedings of the Methods for Modalities Workshop (M4M-05), Berlin,
Germany, 2005.
Bibtex entry Paper (PS) Paper (PDF)
Franz Baader, Carsten Lutz, Eldar Karabaev, and Manfred Theißen.
A new -ary existential quantifier in description logics.
In Ulrich Furbach, editor, Proceedings of the 28th Annual German Conference
on Artificial Intelligence (KI'05), volume 3698 of Lecture Notes in
Computer Science, pages 18–33. Springer, 2005.
Bibtex entry Paper (PS)
Franz Baader, Carsten Lutz, Eldar Karabaev, and Manfred Theißen.
A New n-ary Existential Quantifier in Description Logics.
In Proceedings of the 2005 International Workshop on Description Logics
(DL2005), number 147 in CEUR-WS, 2005.
Bibtex entry Paper (PS) Paper (PDF)
M. Lange and C. Lutz.
2-ExpTime lower bounds for Propositional Dynamic Logics with
intersection.
Journal of Symbolic Logic, 70(5):1072–1086, 2005.
Bibtex entry Paper (PS)
C. Lutz.
PDL with Intersection and Converse is Decidable.
In C.-H. Luke Ong, editor, Computer Science Logic (CSL'05), volume 3634
of Lecture Notes in Computer Science, pages 413–427.
Springer-Verlag, 2005.
Bibtex entry Paper (PS)
C. Lutz, C. Areces, I. Horrocks, and U. Sattler.
Keys, Nominals, and Concrete Domains.
Journal of Artificial Intelligence Research, 23:667–726, 2005.
Bibtex entry Paper (PS)
C. Lutz and M. Milicic.
A Tableau Algorithm for Description Logics with Concrete Domains and
GCIs.
In Bernhard Beckert, editor, Proceedings of the 14th International
Conference on Automated Reasoning with Analytic Tableaux and Related Methods
TABLEAUX 2005, volume 3702 of LNAI, pages 201–216, Koblenz,
Germany, 2005. Springer.
Bibtex entry Paper (PDF)
C. Lutz and M. Milicic.
A Tableau Algorithm for DLs with Concrete Domains and GCIs.
In Proceedings of the 2005 International Workshop on Description Logics
(DL2005), number 147 in CEUR-WS, 2005.
Bibtex entry Paper (PDF)
C. Lutz, U. Sattler, and L. Tendera.
The Complexity of Finite Model Reasoning in Description Logics.
Information and Computation, 199:132–171, 2005.
Bibtex entry Paper (PS)
C. Lutz and D. Walther.
PDL with Negation of Atomic Programs.
Journal of Applied Non-Classical Logic, 15(2):189–214, 2005.
Bibtex entry Paper (PS)
C. Lutz, D. Walther, and F. Wolter.
Quantitative Temporal Logics: PSpace and below.
In Proceedings of the Twelfth International Symposium on Temporal
Representation and Reasoning, pages 138–146. IEEE Computer Society
Press, 2005.
Bibtex entry Paper (PDF)
2004
A. Artale and C. Lutz. A Correspondence between Temporal Description Logics. Journal of Applied Non-Classical Logic, 14(1–2):209–233, 2004.Bibtex entry Paper (PS)
E. Karabaev and C. Lutz.
Mona as a DL Reasoner.
In Proceedings of the 2004 International Workshop on Description Logics
(DL2004), CEUR-WS, 2004.
Bibtex entry Paper (PS)
R. Kontchakov, C. Lutz, F. Wolter, and M. Zakharyaschev.
Temporal Tableaux.
Studia Logica, 76(1):91–134, 2004.
Bibtex entry Paper (PS)
O. Kutz, C. Lutz, F. Wolter, and M. Zakharyaschev.
E-Connections of Abstract Description Systems.
Artificial Intelligence, 156(1):1–73, 2004.
Bibtex entry Paper (PS)
C. Lutz.
Combining Interval-based Temporal Reasoning with General TBoxes.
Artificial Intelligence, 152(2):235–274, 2004.
Bibtex entry Paper (PS)
C. Lutz and M. Milicic.
Description Logics with Concrete Domains and Functional Dependencies.
In Ramon López de Mántaras and Lorenza Saitta, editors, Proceedings of
the 16th International Conference on Artificial Intelligence (ECAI'04),
pages 378–382. IOS Press, 2004.
Bibtex entry Paper (PS)
C. Lutz and D. Walther.
PDL with Negation of Atomic Programs.
In David Basin and Michael Rusinowitch, editors, Proceedings of the 2nd
International Joint Conference on Automated Reasoning (IJCAR'04),
volume 3097 of Lecture Notes in Artificial Intelligence, pages
259–273. Springer Verlag, 2004.
Bibtex entry Paper (PS)
C. Lutz and F. Wolter.
Modal Logics of Topological Relations.
In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds, and Heinrich Wansing,
editors, Proceedings of the 2004 Confernce on Advances in Modal Logic
(AiML'04), pages 249–263. King's College Publications, 2004.
Bibtex entry Paper (PS)
Carsten Lutz.
NExpTime-complete Description Logics with Concrete Domains.
ACM Transactions on Computational Logic, 5(4):669–705, 2004.
Bibtex entry
2003
F. Baader, J. Hladik, C. Lutz, and F. Wolter. From Tableaux to Automata for Description Logics. In Moshe Vardi and Andrei Voronkov, editors, Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2003), volume 2850 of Lecture Notes in Computer Science, pages 1–32. Springer, 2003.Bibtex entry Paper (PS) ©Springer-Verlag
Franz Baader, Jan Hladik, Carsten Lutz, and Frank Wolter.
From Tableaux to Automata for Description Logics.
Fundamenta Informaticae, 57:1–33, 2003.
Bibtex entry Paper (PS)
O. Kutz, C. Lutz, F. Wolter, and M. Zakharyaschev.
E-connections of Description Logics.
In Proceedings of the 2003 International Workshop on Description Logics
(DL2003), CEUR-WS, 2003.
Bibtex entry Paper (PS)
C. Lutz.
Description Logics with Concrete Domains—A Survey.
In Philippe Balbiani, Nobu-Yuki Suzuki, Frank Wolter, and Michael
Zakharyaschev, editors, Advances in Modal Logics Volume 4, pages
265–296. King's College Publications, 2003.
Bibtex entry Paper (PS)
C. Lutz, C. Areces, I. Horrocks, and U. Sattler.
Keys, Nominals, and Concrete Domains.
In Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence (IJCAI'03), pages 349–354. Morgan-Kaufmann
Publishers, 2003.
Bibtex entry Paper (PS)
C. Lutz, U. Sattler, and L. Tendera.
The Complexity of Finite Model Reasoning in Description Logics.
In Proceedings of the 19th Conference on Automated Deduction (CADE-19),
Lecture Notes in Artificial Intelligence, pages 60–74. Springer Verlag,
2003.
Bibtex entry Paper (PS)
C. Lutz, U.Sattler, and L. Tendera.
Finite Model reasoning in ALCQI is ExpTime-complete.
In Proceedings of the 2003 International Workshop on Description Logics
(DL2003), CEUR-WS, 2003.
Bibtex entry Paper (PS)
C. Lutz, F. Wolter, and M. Zakharyaschev.
Reasoning about concepts and similarity.
In Proceedings of the 2003 International Workshop on Description Logics
(DL2003), CEUR-WS, 2003.
Bibtex entry Paper (PS)
C. Lutz, F. Wolter, and M. Zakharyaschev.
A Tableau Algorithm for Reasoning about Concepts and Similarity.
In Proceedings of the 2003 International Conference on Automated Reasoning
with Analytic Tableaux and Related Methods (TABLEAUX'03), volume 2796
of Lecture Notes in Artificial Intelligence, pages 134–149. Springer
Verlag, 2003.
Bibtex entry Paper (PS)
2002
C. Areces and C. Lutz. Concrete Domains and Nominals United.. In Carlos Areces, Patrick Blackburn, Maarten Marx, and Ulrike Sattler, editors, Proceedings of the fourth Workshop on Hybrid Logics (HyLo'02), 2002.Bibtex entry Paper (PS)
F. Baader, C. Lutz, H. Sturm, and F. Wolter.
Fusions of Description Logics and Abstract Description Systems.
Journal of Artificial Intelligence Research (JAIR), 16:1–58, 2002.
Bibtex entry Paper (PS)
C. Lutz.
Adding Numbers to the SHIQ Description Logic—First
Results.
In Proceedings of the Eighth International Conference on Principles of
Knowledge Representation and Reasoning (KR'02), pages 191–202. Morgan
Kaufman, 2002.
Bibtex entry Paper (PS)
C. Lutz.
Description Logics with Concrete Domains—A Survey.
In Advances in Modal Logic 2002 (AiML 2002), Toulouse, France, 2002.
Final version appeared in Advanced in Modal Logic Volume 4, 2003.
Bibtex entry Paper (PS)
C. Lutz.
PSpace Reasoning with the Description Logic
ALCF(D).
Logic Journal of the IGPL, 10(5):535–568, 2002.
Bibtex entry Paper (PS)
C. Lutz.
Reasoning about Entity Relationship Diagrams with Complex Attribute
Dependencies.
In I. Horrocks and S. Tessaris, editors, Proceedings of the 2002
International Workshop on Description Logics (DL'02), 2002.
Bibtex entry Paper (PS)
C. Lutz and U. Sattler.
A Proposal for Describing Services with DLs.
In I. Horrocks and S. Tessaris, editors, Proceedings of the 2002
International Workshop on Description Logics (DL'02), 2002.
Bibtex entry Paper (PS)
C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev.
A Tableau Decision Algorithm for Modalized ALC with Constant
Domains.
Studia Logica, 72(2):199–232, 2002.
Bibtex entry Paper (PDF)
2001
C. Lutz. Interval-based Temporal Reasoning with General TBoxes. In Bernhard Nebel, editor, Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence IJCAI-01, pages 89–94, Seattle, Washington, USA, 2001. Morgan-Kaufmann Publishers.Bibtex entry Paper (PS)
C. Lutz.
NExpTime-complete Description Logics with Concrete Domains.
In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors,
Proceedings of the International Joint Conference on Automated Reasoning,
number 2083 in Lecture Notes in Artifical Intelligence, pages 45–60, Siena,
Italy, 2001. Springer Verlag.
Bibtex entry Paper (PS)
C. Lutz and U. Sattler.
The Complexity of Reasoning with Boolean Modal Logics.
In Frank Wolter, Heinrich Wansing, Maarten de Rijke, and Michael Zakharyaschev,
editors, Advances in Modal Logics Volume 3. CSLI Publications,
Stanford, 2001.
Bibtex entry Paper (PS)
C. Lutz, U. Sattler, and F. Wolter.
Description Logics and the Two-Variable Fragment.
In D.L. McGuiness, P.F. Pater-Schneider, C. Goble, and R. Möller, editors,
Proceedings of the 2001 International Workshop in Description Logics
(DL-2001), pages 66–75, Stanford, California, USA, 2001.
Proceedings online available from
http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/.
Bibtex entry Paper (PS)
C. Lutz, U. Sattler, and F. Wolter.
Modal Logic and the two-variable fragment.
In Laurent Fribourg, editor, Computer Science Logic (CSL'01), volume
2142 of Lecture Notes in Computer Science, pages 247–261.
Springer-Verlag, 2001.
Bibtex entry Paper (PS)
C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev.
Tableaux for Temporal Description Logic with Constant Domain.
In Rajeev Goré, Alexander Leitsch, and Tobias Nipkow, editors,
Proceedings of the International Joint Conference on Automated Reasoning,
number 2083 in Lecture Notes in Artifical Intelligence, pages 121–136,
Siena, Italy, 2001. Springer Verlag.
Bibtex entry Paper (PS)
2000
F. Baader, C. Lutz, H. Sturm, and F. Wolter. Fusions of Description Logics. In F. Baader and U. Sattler, editors, Proceedings of the International Workshop in Description Logics 2000 (DL2000), number 33 in CEUR-WS, pages 21–30, Aachen, Germany, August 2000. RWTH Aachen. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-33/.Bibtex entry Paper (PS)
C. Lutz.
NExpTime-Complete Description Logics with Concrete Domains.
In C. Pilière, editor, Proceedings of the ESSLLI-2000 Student
Session, University of Birmingham, August 2000.
Bibtex entry Paper (PS)
C. Lutz and U. Sattler.
The Complexity of Reasoning with Boolean Modal Logic.
In Advances in Modal Logic 2000 (AiML 2000), Leipzig, Germany, 2000.
Final version appeared in Advanced in Modal Logic Volume 3, 2001.
Bibtex entry
C. Lutz and U. Sattler.
Mary likes all Cats.
In F. Baader and U. Sattler, editors, Proceedings of the 2000 International
Workshop in Description Logics (DL2000), number 33 in CEUR-WS, pages
213–226, Aachen, Germany, August 2000. RWTH Aachen.
Proceedings online available from
http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-33/.
Bibtex entry Paper (PS)
1999 and older
A. Artale and C. Lutz. A Correspondance between Temporal Description Logics. In Patrick Lambrix, Alex Borgida, Maurizio Lenzerini, Ralf Möller, and Peter Patel-Schneider, editors, Proceedings of the International Workshop on Description Logics (DL'99), number 22 in CEUR-WS, pages 145–149, Linkoeping, Sweden, July 30 – August 1 1999. Linköping University. Proceedings online available from http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/.Bibtex entry Paper (PS)
V. Haarslev, C. Lutz, and R. Möller.
A Description Logic with Concrete Domains and Role-forming Predicates.
Journal of Logic and Computation, 9(3):351–384, 1999.
Bibtex entry Paper (PS)
Volker Haarslev, Carsten Lutz, and Ralf Möller.
Foundations of Spatioterminological Reasoning with Description Logics.
In Anthony G. Cohn, L.K. Schubert, and S.C. Shapiro, editors, Principles of
Knowledge Representation and Reasoning: Proceedings of the Sixth
International Conference (KR'98), pages 112–124. Morgan-Kaufmann
Publishers, 1998.
Bibtex entry Paper (PS)
C. Lutz.
Complexity of Terminological Reasoning Revisited.
In Proceedings of the 6th International Conference on Logic for Programming
and Automated Reasoning LPAR'99, Lecture Notes in Artificial
Intelligence, pages 181–200. Springer-Verlag, September 6 – 10, 1999.
Bibtex entry Paper (PS) ©Springer-Verlag
C. Lutz.
Reasoning with Concrete Domains.
In Thomas Dean, editor, Proceedings of the Sixteenth International Joint
Conference on Artificial Intelligence IJCAI-99, pages 90–95, Stockholm,
Sweden, July 31 – August 6, 1999. Morgan-Kaufmann Publishers.
Bibtex entry Paper (PS)
C. Lutz, U. Sattler, and S. Tobies.
A Proposal for an n-ary Description Logic.
In Patrick Lambrix, Alex Borgida, Maurizio Lenzerini, Ralf Möller, and
Peter Patel-Schneider, editors, Proceedings of the International Workshop
on Description Logics, number 22 in CEUR-WS, pages 81–85, Linkoeping,
Sweden, July 30 – August 1 1999. Linköping University.
Proceedings online available from
http://SunSITE.Informatik.RWTH-Aachen.DE/Publications/CEUR-WS/Vol-22/.
Bibtex entry Paper (PS)
Carsten Lutz and Ralf Möller.
Defined Topological Relations in Description Logics.
In Marie-Christine Rousset, Ron Brachman, Francesco Donini, Enrico Franconi,
Ian Horrocks, and Alon Levy, editors, Proceedings of the International
Workshop on Description Logics, pages 15–19, Gif sur Yvette (Paris),
France, 1997. Université Paris-Sud, Centre d'Orsay.
Bibtex entry Paper (PS)