Chair of Automata Theory at the Institute of Theoretical Computer Science of the Faculty of Computer Science of the Technische Universit├Ąt Dresden

Technical Reports

The list of technical reports is also available as PDF document. There is also a list of our publications and theses.

2016

Claudia Carapelle and Anni-Yasmin Turhan: Decidability of ALCP(D) for concrete domains with the EHD-property. 16-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2016.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader and Oliver Fernández Gil: Extending Description Logic tEL(deg) with Acyclic TBoxes. 16-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2016. See http://lat.inf.tu-dresden.de/research/reports.html
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Pavlos Marantidis, and Alexander Okhotin: Approximately Solving Set Equations. 16-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2016. See http://lat.inf.tu-dresden.de/research/reports.html
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Pavlos Marantidis, and Alexander Okhotin: Approximate Unification in the Description Logic FL0. 16-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2016. See http://lat.inf.tu-dresden.de/research/reports.html
BibTeX entry  Abstract  Paper (PDF) 


2015

Francesco Kriegel: NextClosures – Parallel Exploration of Constrained Closure Operators. 15-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract 

Francesco Kriegel: Model-Based Most-Specific Concept Descriptions and Least Common Subsumers in ALEQN(Self). 15-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract 

Franz Baader, Stefan Borgwardt, and Barbara Morawska: Dismatching and Local Disunification in EL. 15-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stephan Böhme and Marcel Lippmann: Description Logics of Context with Rigid Roles Revisited. 15-04, Chair of Automata Theory, TU Dresden, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt, Marco Cerami, and Rafael Peñaloza: Subsumption in Finitely Valued Fuzzy EL. 15-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Veronika Thost: LTL over EL Axioms. 15-07, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Veronika Thost: Temporal Query Answering in EL. 15-08, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Gerhard Brewka, and Oliver Fernández Gil: Adding Threshold Concepts to the Description Logic EL. 15-09, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Benjamin Zarrieß and Jens Claßen: Verification of Knowledge-Based Programs over Description Logic Actions. 15-10, Chair of Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Rafael Peñaloza: Infinitely Valued Gödel Semantics for Expressive Description Logics. 15-11, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Veronika Thost, Jan Holste, and Özgür Özçep: On Implementing Temporal Query Answering in DL-Lite. 15-12, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2015.
BibTeX entry  Abstract  Paper (PDF) 

Daniel Borchmann, Felix Distel, and Francesco Kriegel: Axiomatization of General Concept Inclusions from Finite Interpretations. 15-13, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Francesco Kriegel: Learning General Concept Inclusions in Probabilistic Description Logics. 15-14, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2015. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Veronika Thost: Temporal Query Answering in DL-Lite with Negation. 15-16, Chair for Automata Theory, Technische Universität Dresden, Germany, 2015.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Stefan Borgwardt, and Marcel Lippmann: Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles. 15-17, Chair for Automata Theory, Technische Universität Dresden, Germany, 2015.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Rafael Peñaloza: A Tableau Algorithm for SROIQ under Infinitely Valued Gödel Semantics. 15-18, Chair for Automata Theory, Technische Universität Dresden, Germany, 2015.
BibTeX entry  Abstract  Paper (PDF) 

Benjamin Zarrieß and Jens Claßen: Decidable Verification of Golog Programs over Non-Local Effect Actions. 15-19, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2015. Extended version. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Marcel Lippmann: Multi-Sorted Conjunctive Queries with Concrete and Temporal Domains. 15-20, Chair of Automata Theory, Technische Universität Dresden, Germany, 2015.
BibTeX entry  Abstract  Paper (PDF) 


2014

Franz Baader and Marcel Lippmann: Runtime Verification Using a Temporal Description Logic Revisited. 14-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt: The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals. 14-02, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader and Barbara Morawska: Matching with respect to general concept inclusions in the Description Logic EL. 14-03, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Rafael Peñaloza, Veronika Thost, and Anni-Yasmin Turhan: Conjunctive Query Answering in Rough EL. 14-04, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Yue Ma and Rafael Peñaloza: Towards Parallel Repair Using Decompositions. 14-05, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt, Marcel Lippmann, and Veronika Thost: Reasoning with Temporal Properties over Axioms of DL-Lite. 14-06, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Michel Ludwig and Rafael Peñaloza: Error-Tolerant Reasoning in the Description Logic EL. 14-11, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2014. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2013

Franz Baader, Stefan Borgwardt, and Marcel Lippmann: On the Complexity of Temporal Query Answering. 13-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Daniel Borchmann: A General Form of Attribute Exploration. 13-02, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Yue Ma and Felix Distel: Learning Formal Definitions for Snomed CT from Text. 13-03, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Daniel Borchmann: Exploration by Confidence. 13-04, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt, Marcel Lippmann, and Veronika Thost: Temporal Query Answering w.r.t. DL-Lite-Ontologies. 13-05, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2013. Revised version. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Benjamin Zarrieß and Anni-Yasmin Turhan: Most Specific Generalizations w.r.t. General EL-TBoxes. 13-06, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Oliver Fernández Gil, and Barbara Morawska: Hybrid Unification in the Description Logic EL. 13-07, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader and Benjamin Zarrieß: Verification of Golog Programs over Description Logic Actions. 13-08, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Paper (PDF) 

Stefan Borgwardt, Felix Distel, and Rafael Peñaloza: Goedel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property. 13-09, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Benjamin Zarrieß and Jens Claßen: On the Decidability of Verifying LTL Properties of Golog Programs. 13-10, Chair of Automata Theory, TU Dresden, Dresden, Germany, 2013. Extended version. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Daniel Borchmann: Model Exploration by Confidence with Completely Specified Counterexamples. 13-11, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Andreas Ecke and Anni-Yasmin Turhan: Similarity Measures for Computing Relaxed Instances w.r.t. General EL-TBoxes. 13-12, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2013. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2012

Franz Baader and Alexander Okhotin: Solving Language Equations and Disequations Using Looping Tree Automata with Colors. 12-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Stefan Borgwardt, and Barbara Morawska: SAT Encoding of Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. 12-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Stefan Borgwardt, and Barbara Morawska: Computing Minimal EL-Unifiers is Hard. 12-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Rafael Peñaloza: Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices. 12-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Stefan Borgwardt, and Barbara Morawska: A Goal-Oriented Algorithm for Unification in ELHR+ w.r.t. Cycle-Restricted Ontologies. 12-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Daniel Borchmann: On Confident GCIs of Finite Interpretations. 12-06, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2012. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2011

Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt, and Barbara Morawska: Unification in the Description Logic EL Without the Top Concept. 11-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Rafael Peñaloza: Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version. 11-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Rafael Peñaloza: Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm. 11-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Barbara Morawska: Finding Finite Herbrand Models. 11-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Stefan Borgwardt, and Barbara Morawska: Unification in the Description Logic EL w.r.t. Cycle-Restricted TBoxes. 11-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Stefan Borgwardt and Rafael Peñaloza: Undecidability of Fuzzy Description Logics. 11-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2011. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2010

Franz Baader, Marcel Lippmann, and Hongkai Liu: Adding Causal Relationships to DL-based Action Formalisms. 10-01, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2010. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader and Barbara Morawska: SAT Encoding of Unification in EL. 10-04, Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2010. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Rafael Peñaloza and Anni-Yasmin Turhan: Completion-based computation of least common subsumers with limited role-depth for EL and Prob-EL01. LTCS-10-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2010. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Rafael Peñaloza and Anni-Yasmin Turhan: Completion-based computation of most specific concepts with limited role-depth for EL and Prob-EL01. LTCS-10-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2010. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Stefan Borgwardt and Rafael Peñaloza: Complementation and Inclusion of Weighted Automata on Infinite Trees. LTCS-10-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2010. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2009

Conrad Drescher, Hongkai Liu, Franz Baader, Steffen Guhlemann, Uwe Petersohn, Peter Steinke, and Michael Thielscher: Putting ABox Updates into Action. 09-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2009. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Franz Baader, Martin Knechtel, and Rafael Peñaloza: Computing Boundaries for Reasoning in Sub-Ontologies. 09-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2009. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Rafael Peñaloza and Barış Sertkaya: On the Complexity of Axiom Pinpointing in Description Logics. 09-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2009. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader, Hongkai Liu, and Anees ul Mehdi: Integrate Action Formalisms into Linear Temporal Description Logics. LTCS-09-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2009. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2008

Franz Baader, Silvio Ghilardi, and Carsten Lutz: LTL over Description Logic Axioms. 08-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Felix Distel: Model-based Most Specific Concepts in Description Logics with Value Restrictions. 08-04, Institute for theoretical computer science, TU Dresden, Dresden, Germany, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader and Felix Distel: Exploring finite models in the Description Logic EL\mathrmgfp. 08-05, Institute for Theoretical Computer Science, TU Dresden, Dresden, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader and Rafael Peñaloza: Blocking and Pinpointing in Forest Tableaux. LTCS-08-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader and Rafael Peñaloza: Pinpointing in Terminating Forest Tableaux. LTCS-08-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Barış Sertkaya: Some Computational Problems Related to Pseudo-intents. LTCS-08-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2008. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 


2007

Franz Baader and Felix Distel: A finite basis for the set of EL-implications holding in a finite model. 07-02, Inst. für Theoretische Informatik, TU Dresden, Dresden, Germany, 2007.
BibTeX entry  Abstract  Paper (PDF) 

Boontawee Suntisrivaraporn: Module Extraction and Incremental Classification: A Pragmatic Approach for EL+ Ontologies. LTCS-07-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2007. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 


2006

Franz Baader and Alexander Okhotin: On Language Equations with One-sided Concatenation. LTCS-06-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader, Bernhard Ganter, Ulrike Sattler, and Baris Sertkaya: Completing Description Logic Knowledge Bases using Formal Concept Analysis. LTCS-06-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

H. Liu, C. Lutz, M. Milicic, and F. Wolter: Description Logic Actions with general TBoxes: a Pragmatic Approach. LTCS-06-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

F. Baader, J. Hladik, and R. Penaloza: PSPACE Automata with Blocking for Description Logics. LTCS-06-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

Rafael Penaloza: Pinpointing in Tableaus. LTCS-06-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

Franz Baader and Rafael Penaloza: Axiom Pinpointing in General Tableaux. LTCS-07-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2006. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 


2005

F. Baader, S. Brandt, and C. Lutz: Pushing the EL Envelope. LTCS-05-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader, M. Milicic, C. Lutz, U. Sattler, and F. Wolter: Integrating Description Logics and Action Formalisms for Reasoning about Web Services. LTCS-05-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz, D. Walther, and F. Wolter: Quantitative Temporal Logics: PSpace and below. LTCS-05-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

Franz Baader and Silvio Ghilardi: Connecting Many-Sorted Theories. LTCS-05-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: PDL with Intersection and Converse is Decidable. LTCS-05-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

P. Bonatti, C. Lutz, and F. Wolter: Expressive Non-Monotonic Description Logics Based on Circumscription. LTCS-05-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz and M. Milicic: A Tableau Algorithm for DLs with Concrete Domains and GCIs. LTCS-05-07, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

Franz Baader, Carsten Lutz, Eldar Karabaev, and Manfred Theißen: A New n-ary Existential Quantifier in Description Logics. LTCS-05-08, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

C. Lutz: Complexity and Succinctness of Public Announcement Logic. LTCS-05-09, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

H. Liu, C. Lutz, M. Milicic, and F. Wolter: Updating Description Logic ABoxes. LTCS-05-10, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2005. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 


2004

B. Morawska: A nice Cycle Rule for Goal-Directed E-Unification. LTCS-04-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. LTCS-04-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

S. Brandt: Reasoning in ELH w.r.t. General Concept Inclusion Axioms. LTCS-04-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 

S. Brandt: Subsumption and Instance Problem in ELH w.r.t. General TBoxes. LTCS-04-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF) 

C. Lutz and F. Wolter: Modal Logics of Topological Relations. LTCS-04-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz and M. Milicic: Description Logics with Concrete Domains and Functional Dependencies. LTCS-04-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2004. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PDF)  Paper (PS) 


2003

S. Brandt, A.-Y. Turhan, and R. Küsters: Foundations of non-standard Inferences for Description Logics with transitive Roles and Role Hierarchies. 03-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2003.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics. LTCS-03-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2003. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

B. Morawska: Completness of E-unification with eager Variable Elimination. LTCS-03-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2003. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz and D. Walther: PDL with Negation of Atomic Programs. LTCS-03-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2003. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader, Silvio Ghilardi, and Cesare Tinelli: A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics. LTCS-03-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2003. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 


2002

S. Brandt and A.-Y. Turhan: An Approach for Optimizing ALE-Approximation of ALC-Concepts. 02-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies. LTCS-02-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2002. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: Terminological Cycles in a Description Logic with Existential Restrictions. LTCS-02-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz, C. Areces, I. Horrocks, and U. Sattler: Keys, Nominals, and Concrete Domains. LTCS-02-04, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz, U. Sattler, and L. Tendera: The Complexity of Finite Model Reasoning in Description Logics. LTCS-02-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks and U. Sattler: Decidability of SHIQ with Complex Role Inclusion Axioms. LTCS-02-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: Least Common Subsumers, Most Specific Concepts, and Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles. LTCS-02-07, Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology, Germany, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
BibTeX entry  Abstract  Paper (PS) 


2001

F. Baader, S. Brandt, and R. Küsters: Matching under Side Conditions in Description Logics. 01-02, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and S. Tobies: The Inverse Method Implements the Automata Approach for Modal Satisfiability. 01-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and R. Küsters: Unification in a Description Logic with Transitive Closure of Roles. 01-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

S. Brandt, R. Küsters, and A.-Y. Turhan: Approximation and Difference in Description Logics. 01-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz, H. Sturm, F. Wolter, and M. Zakharyaschev: A Tableau Calculus for Temporal Description Logic: The Constant Domain Case. LTCS-01-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz, U. Sattler, and F. Wolter: Modal Logic and the two-variable fragment. LTCS-01-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: Adding Numbers to the SHIQ Description Logic—First Results. LTCS-01-07, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks and U. Sattler: Optimised Reasoning for SHIQ. LTCS-01-08, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2001. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 


2000

F. Baader, R. Küsters, and R. Molitor: Rewriting Concepts Using Terminologies – Revisited. 00-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

R. Küsters and R. Molitor: Computing Most Specific Concepts in Description Logics with Existential Restrictions. 00-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000.
BibTeX entry  Abstract  Paper (PS) 

R. Küsters and R. Molitor: Computing Least Common Subsumers in ALEN. 00-07, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: NExpTime-complete Description Logics with Concrete Domains. LTCS-00-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz and U. Sattler: The Complexity of Reasoning with Boolean Modal Logics (Extended Version). LTCS-00-02, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

C. Hirsch and S. Tobies: A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary Version. LTCS-00-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Paper (PS) 

C. Lutz: Interval-based Temporal Reasoning with General TBoxes. LTCS-00-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 2000. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 


1999

F. Baader, R. Küsters, and R. Molitor: Rewriting Concepts Using Terminologies – Revisited. 99-12, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. Please refer to the revised version LTCS-Report 00-04.
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: The Complexity of Reasoning with Concrete Domains (Revised Version). LTCS-99-01, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
BibTeX entry  Abstract  Paper (PS) 

M.-S.  Hacid and C. Rigotti: Representing and Reasoning on Conceptual Queries Over Image Databases. LTCS-99-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html
BibTeX entry  Abstract  Paper (PS) 

C. Decleir, M.-S. Hacid, and J. Kouloumdjian: A Database Approach for Modeling and Querying Video Data. LTCS-99-03, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html
BibTeX entry  Abstract  Paper (PS) 

C. Lutz: On the Complexity of Terminological Reasoning. LTCS-99-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. This report is superceded by the LTCS-00-01 technical report and my LPAR'99 paper.
BibTeX entry  Abstract 

S. Tobies: A NEXPTIME-complete Description Logic Strictly Contained in C2. LTCS-99-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. An abriged version appeared at CSL-99.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and R. Molitor: Rewriting Concepts using Terminologies. LTCS-99-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
BibTeX entry  Abstract  Paper (PS) 

F. Baader and R. Küsters: Matching in Description Logics with Existential Restrictions. LTCS-99-07, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks, U. Sattler, and S. Tobies: A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions. LTCS-99-08, LuFG Theoretical Computer Science, RWTH Aachen, 1999. Revised version. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
BibTeX entry  Abstract  Paper (PS) 

S. Tobies: A PSpace-algorithm for ALCQI-satisfiability. LTCS-99-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
BibTeX entry  Abstract  Paper (PS) 

S. Tobies: PSpace Reasoning for DLs with Qualifying Number Restrictions. LTCS-99-11, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and R. Küsters: Matching Concept Descriptions with Existential Restrictions Revisited. LTCS-99-13, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks and S. Tobies: Optimisation of Terminological Reasoning. LTCS-99-14, LuFG Theoretical Computer Science, RWTH Aachen, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks, U. Sattler, S. Tessaris, and S. Tobies: Query Containment Using a DLR ABox. LTCS-99-15, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1999. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS) 


1998

C.B. Tresp and R. Molitor: A Description Logic for Vague Knowledge. LTCS-98-01, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html
BibTeX entry  Abstract  Paper (PS) 

F. Baader and U. Sattler: Description Logics with Aggregates and Concrete Domains, Part II (extended). LTCS-98-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998.
BibTeX entry  Paper (PS) 

R. Molitor: Structural Subsumption for ALN. LTCS-98-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998.
BibTeX entry  Paper (PS) 

F. Baader, R. Küsters, and R. Molitor: Structural Subsumption Considered from an Automata Theoretic Point of View. LTCS-98-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Abstract  Paper (PS)  Paper (PS) 

I. Horrocks and U. Sattler: A Description Logic with Transitive and Converse Roles and Role Hierarchies. LTCS-98-05, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998.
BibTeX entry  Paper (PS) 

F. Baader and R. Küsters: Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. LTCS-98-06, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and P. Narendran: Unification of Concept Terms in Description Logics: Revised Version. LTCS-98-07, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1998.
BibTeX entry  Abstract  Paper (PS) 

I. Horrocks, U. Sattler, and S. Tobies: A PSpace-algorithm for deciding ALCNIR+-satisfiability. LTCS-98-08, LuFG Theoretical Computer Science, RWTH Aachen, 1998.
BibTeX entry  Abstract  Paper (PS) 

F. Baader, R. Küsters, and R. Molitor: Computing Least Common Subsumers in Description Logics with Existential Restrictions. LTCS-98-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
BibTeX entry  Abstract  Paper (PS) 

F. Baader, R. Molitor, and S. Tobies: The Guarded Fragment of Conceptual Graphs. LTCS-98-10, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html
BibTeX entry  Abstract  Paper (PS) 

F. Baader, R. Molitor, and S. Tobies: On the Relation between Descripion Logics and Conceptual Graphs. LTCS-98-11, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
BibTeX entry  Paper (PS) 


1997

F. Baader and U. Sattler: Description Logics with Aggregates and Concrete Domains. LTCS-97-01, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1997. An abridged version has appeared in the Proceedings of the International Workshop on Description Logics 97.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and P. Narendran: Unification of Concept Terms in Description Logics. LTCS-97-02, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1997.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: On the Complexity of Boolean Unification. LTCS-97-03, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1997.
BibTeX entry  Abstract  Paper (PS) 

R. Küsters: Characterizing the semantics of terminological cycles in ALN using finite automata. LTCS-97-04, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1997.
BibTeX entry  Abstract  Paper (PS) 

M. S. Hacid, P. Marcel, and C. Rigotti: A rule based data manipulation language for OLAP systems. LTCS-97-05, LuFg Theoretical Computer Science, RWTH Aachen, 1997. A short version has appeared in the Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases (DOOD'97), Montreux, Switzerland
BibTeX entry  Abstract  Paper (PS) 


1996

F. Baader and C. Tinelli: A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method. LTCS-96-01, LuFg Theoretical Computer Science, RWTH Aachen, 1996. An abridged version has appeared in Proc. CADE'97, Springer LNAI 1249.
BibTeX entry  Abstract  Paper (PS) 

F. Baader and U. Sattler: Number Restrictions on Complex Roles in Description Logics. LTCS-96-02, LuFg Theoretical Computer Science, RWTH Aachen, 1996. An abridged version has appeared in the Proceedings of the Fifth International Conference on Knowledge Representation and Reasoning, 1996, Cambridge, Massachusetts.
BibTeX entry  Paper (PS) 

F. Baader and U. Sattler: Description Logics with Symbolic Number Restrictions. LTCS-96-03, LuFg Theoretical Computer Science, RWTH Aachen, 1996. An abridged version has appeared in the Proceedings of the 12th European Conference on Artificial Intelligence, 1996, Budapest, Hungary.
BibTeX entry  Paper (PS) 

S. Kepser and J. Richts: Optimisation Techniques for Combining Constraint Solvers. LTCS-96-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1996.
BibTeX entry  Abstract  Paper (PS) 

F. Baader: Combination of Compatible Reduction Orderings that are Total on Ground Terms. LTCS-96-05, LuFg Theoretical Computer Science, RWTH Aachen, Germany, 1996.
BibTeX entry  Abstract  Paper (PS) 


Back to the hompage of the Chair of Automata Theory.
Generated Wed Jul 6 15:53:28 2016.