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.

2017

Maximilian Pensel and Anni-Yasmin Turhan: Making Quantification Relevant again—the case of Defeasible ELbot. 17-01, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2017. See http://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ PeTu-LTCS-17-01,
  address = {Dresden, Germany},
  author = {Maximilian {Pensel} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {17-01},
  title = {Making Quantification Relevant again---the case of Defeasible $\mathcal{EL}_{bot}$},
  type = {LTCS-Report},
  year = {2017},
}


Franz Baader: Concept Descriptions with Set Constraints and Cardinality Constraints. 17-02, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2017. See http://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Baad-LTCS-17-02,
  address = {Dresden, Germany},
  author = {Franz {Baader}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {17-02},
  title = {Concept Descriptions with Set Constraints and Cardinality Constraints},
  type = {LTCS-Report},
  year = {2017},
}


Franz Baader, Stefan Borgwardt, Patrick Koopmann, Ana Ozaki, and Veronika Thost: Metric Temporal Description Logics with Interval-Rigid Names (Extended Version). 17-03, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2017. see https://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBoKoOzTh-LTCS-17-03,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Patrick {Koopmann} and Ana {Ozaki} and Veronika {Thost}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {see \url{https://lat.inf.tu-dresden.de/research/reports.html}},
  number = {17-03},
  title = {Metric Temporal Description Logics with Interval-Rigid Names (Extended Version)},
  type = {LTCS-Report},
  year = {2017},
}


Franz Baader, Stefan Borgwardt, and Marcel Lippmann: Query Rewriting for DL-Lite with n-ary Concrete Domains (Extended Version). 17-04, Chair for Automata Theory, Technische Universität Dresden, Germany, 2017. see https://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBL-LTCS-17-04,
  address = {Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Marcel {Lippmann}},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t Dresden},
  note = {see \url{https://lat.inf.tu-dresden.de/research/reports.html}},
  number = {17-04},
  title = {Query Rewriting for \textit{{DL-Lite}} with {$n$}-ary Concrete Domains (Extended Version)},
  type = {LTCS-Report},
  year = {2017},
}


Franz Baader, Patrick Koopmann, and Anni-Yasmin Turhan: Using Ontologies to Query Probabilistic Numerical Data (Extended Version). 17-05, Chair for Automata Theory, Technische Universität Dresden, Germany, 2017. See https://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaKoTu-LTCS-17-05,
  address = {Germany},
  author = {Franz {Baader} and Patrick {Koopmann} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t Dresden},
  note = {See \url{https://lat.inf.tu-dresden.de/research/reports.html}},
  number = {17-05},
  title = {Using Ontologies to Query Probabilistic Numerical Data (Extended Version)},
  type = {LTCS-Report},
  year = {2017},
}


Camille Bourgaux and Anni-Yasmin Turhan: Temporal Query Answering in DL-Lite over Inconsistent Data. 17-06, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, Dresden, Germany, 2017. see http://lat.inf.tu-dresden.de/research/reports.html
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoTu-LTCS-17-06,
  address = {Dresden, Germany},
  author = {Camille {Bourgaux} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {see \url{http://lat.inf.tu-dresden.de/research/reports.html}},
  number = {17-06},
  title = {Temporal Query Answering in {DL-Lite} over Inconsistent Data},
  type = {LTCS-Report},
  year = {2017},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ CaTu-LTCS-16-01,
  address = {Dresden, Germany},
  author = {Claudia {Carapelle} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  number = {16-01},
  title = {Decidability of $\mathcal{ALC}^P\!(\mathcal{D})$ for concrete domains with the EHD-property},
  type = {LTCS-Report},
  year = {2016},
}


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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaFe-LTCS-16-02,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Oliver {Fern{\'a}ndez Gil}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {16-02},
  title = {Extending Description Logic {$t\mathcal{E\!L}(\mathit{deg})$} with Acyclic TBoxes},
  type = {LTCS-Report},
  year = {2016},
}


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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaMaOk-LTCS-16-03,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Pavlos {Marantidis} and Alexander {Okhotin}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {16-03},
  title = {Approximately Solving Set Equations},
  type = {LTCS-Report},
  year = {2016},
}


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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaMaOk-LTCS-16-04,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Pavlos {Marantidis} and Alexander {Okhotin}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {16-04},
  title = {Approximate Unification in the Description Logic {$\mathcal{FL}_0$}},
  type = {LTCS-Report},
  year = {2016},
}


Franz Baader and Oliver Fernández Gil: Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. 16-07, 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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaFe-LTCS-16-07,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Oliver {Fern{\'a}ndez Gil}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {16-07},
  title = {Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures},
  type = {LTCS-Report},
  year = {2016},
}


Franz Baader, Oliver Fernández Gil, and Pavlos Marantidis: Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in FL0. 16-08, 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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaFM-LTCS-16-08,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Oliver {Fern{\'a}ndez Gil} and Pavlos {Marantidis}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {16-08},
  title = {Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $\mathcal{FL}_0$},
  type = {LTCS-Report},
  year = {2016},
}



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.
Abstract 

BibTeX entry:

@techreport{ Kr-LTCS-15-01,
  address = {Dresden, Germany},
  author = {Francesco {Kriegel}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {15-01},
  title = {NextClosures -- Parallel Exploration of Constrained Closure Operators},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract 

BibTeX entry:

@techreport{ Kr-LTCS-15-02,
  address = {Dresden, Germany},
  author = {Francesco {Kriegel}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {15-02},
  title = {Model-Based Most-Specific Concept Descriptions and Least Common Subsumers in ALEQN(Self)},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBM-LTCS-15-03,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-03},
  title = {Dismatching and Local Disunification in {$\mathcal{EL}$}},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoLi-LTCS-15-04,
  author = {Stephan {B{\"o}hme} and Marcel {Lippmann}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {15-04},
  title = {Description Logics of Context with Rigid Roles Revisited},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoCP-LTCS-15-06,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Marco {Cerami} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-06},
  title = {Subsumption in Finitely Valued Fuzzy {$\mathcal{EL}$}},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoTh-LTCS-15-07,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Veronika {Thost}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-07},
  title = {{LTL} over {$\mathcal{EL}$} Axioms},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoTh-LTCS-15-08,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Veronika {Thost}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-08},
  title = {Temporal Query Answering in {$\mathcal{EL}$}},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBrF-LTCS-15-09,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Gerhard {Brewka} and Oliver Fern{\'a}ndez {Gil}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-09},
  title = {Adding Threshold Concepts to the Description Logic $\mathcal{E\!L}$},
  type = {LTCS-Report},
  year = {2015},
}


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
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ ZaCl-LTCS-15-10,
  address = {Dresden, Germany},
  author = {Benjamin {Zarrie{\ss}} and Jens {Cla{\ss}en}},
  institution = {Chair of Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html},
  number = {15-10},
  title = {Verification of Knowledge-Based Programs over Description Logic Actions},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-LTCS-15-11,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-11},
  title = {Infinitely Valued G{\"o}del Semantics for Expressive Description Logics},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ THOe-LTCS-15-12,
  address = {Dresden, Germany},
  author = {Veronika {Thost} and Jan {Holste} and \"Ozg\"ur {\"Oz\c{c}ep}},
  institution = {Chair of Automata Theory, TU Dresden},
  number = {15-12},
  title = {On Implementing Temporal Query Answering in {\textit{DL-Lite}}},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoDiKr-LTCS-15-13,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann} and Felix {Distel} and Francesco {Kriegel}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {15-13},
  title = {{Axiomatization of General Concept Inclusions from Finite Interpretations}},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Kr-LTCS-15-14,
  address = {Dresden, Germany},
  author = {Francesco {Kriegel}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {15-14},
  title = {Learning General Concept Inclusions in Probabilistic Description Logics},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoTh-LTCS-15-16,
  address = {Germany},
  author = {Stefan {Borgwardt} and Veronika {Thost}},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t Dresden},
  number = {15-16},
  title = {Temporal Query Answering in {{\textit{DL-Lite}}} with Negation},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBL-LTCS-15-17,
  address = {Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Marcel {Lippmann}},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t Dresden},
  number = {15-17},
  title = {Temporal Conjunctive Queries in Expressive {DLs} with Non-simple Roles},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-LTCS-15-18,
  address = {Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Technische Universit{\"a}t Dresden},
  number = {15-18},
  title = {A Tableau Algorithm for {$\mathcal{SROIQ}$} under Infinitely Valued {G}{\"o}del Semantics},
  type = {LTCS-Report},
  year = {2015},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ ZaCla-LTCS-15-19,
  address = {Dresden, Germany},
  author = {Benjamin {Zarrie{\ss}} and Jens {Cla{\ss}en}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {Extended version. See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {15-19},
  title = {Decidable Verification of Golog Programs over Non-Local Effect Actions},
  type = {LTCS-Report},
  year = {2015},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaLi-LTCS-14-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Marcel {Lippmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {14-01},
  title = {Runtime Verification Using a Temporal Description Logic Revisited},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Borg-LTCS-14-02,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {14-02},
  title = {The Complexity of Fuzzy Description Logics over Finite Lattices with Nominals},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaMo-LTCS-14-3,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Barbara {Morawska}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {14-03},
  title = {Matching with respect to general concept inclusions in the Description Logic $\mathcal{EL}$},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ PeTT-LTCS-14-04,
  address = {Dresden, Germany},
  author = {Rafael {Pe{\~n}aloza} and Veronika {Thost} and Anni-Yasmin {Turhan}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {14-04},
  title = {Conjunctive Query Answering in Rough EL},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ MaPe-LTCS-14-05,
  address = {Dresden, Germany},
  author = {Yue {Ma} and Rafael {Pe{\~n}aloza}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {14-05},
  title = {Towards Parallel Repair Using Decompositions},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoLT-LTCS-13-05,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Marcel {Lippmann} and Veronika {Thost}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {14-06},
  title = {Reasoning with Temporal Properties over Axioms of \textit{DL-Lite}},
  type = {LTCS-Report},
  year = {2014},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ LuPe-LTCS-14-11,
  address = {Dresden, Germany},
  author = {Michel {Ludwig} and Rafael {Pe{\~n}aloza}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {14-11},
  title = {Error-Tolerant Reasoning in the Description Logic EL},
  type = {LTCS-Report},
  year = {2014},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBoLi-LTCS-13-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Marcel {Lippmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {13-01},
  title = {On the Complexity of Temporal Query Answering},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Borc-LTCS-13-02,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-02},
  title = {{A General Form of Attribute Exploration}},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ MaDi-LTCS-13-03,
  address = {Dresden, Germany},
  author = {Yue {Ma} and Felix {Distel}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-03},
  title = {{Learning Formal Definitions for Snomed CT from Text}},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Borch-LTCS-13-04,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-04},
  title = {{Exploration by Confidence}},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoLT-LTCS-13-05,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Marcel {Lippmann} and Veronika {Thost}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {Revised version. See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-05},
  title = {Temporal Query Answering w.r.t.\ \textit{DL-Lite}-Ontologies},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ ZaTu-LTCS-13-06,
  address = {Dresden, Germany},
  author = {Benjamin {Zarrie{\"s}} and Anni-Yasmin {Turhan}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {13-06},
  title = {Most Specific Generalizations w.r.t.\ General $\mathcal{EL}$-TBoxes},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaFM-LTCS-13-07,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Oliver {Fern\'{a}ndez Gil} and Barbara {Morawska}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {13-07},
  title = {Hybrid Unification in the Description Logic EL},
  type = {LTCS-Report},
  year = {2013},
}


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.
Paper (PDF) 

BibTeX entry:

@techreport{ BaZa-LTCS-13-08,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Benjamin {Zarrie{\"s}}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-08},
  title = {Verification of Golog Programs over Description Logic Actions},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoDP-LTCS-13-09,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Felix {Distel} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-09},
  title = {Goedel Description Logics: Decidability in the Absence of the Finitely-Valued Model Property},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ ZaCla-LTCS-13-10,
  address = {Dresden, Germany},
  author = {Benjamin {Zarrie{\ss}} and Jens {Cla{\ss}en}},
  institution = {Chair of Automata Theory, TU Dresden},
  note = {Extended version. See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-10},
  title = {On the Decidability of Verifying LTL Properties of Golog Programs},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Borc-LTCS-13-11,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {13-11},
  title = {{Model Exploration by Confidence with Completely Specified Counterexamples}},
  type = {LTCS-Report},
  year = {2013},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ EcTu-TR-13,
  address = {Dresden, Germany},
  author = {Andreas {Ecke} and Anni-Yasmin {Turhan}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See \url{http://lat.inf.tu-dresden.de/research/reports.html}.},
  number = {13-12},
  title = {Similarity Measures for Computing Relaxed Instances w.r.t.\ General $\mathcal{EL}$-{TBoxes}},
  type = {LTCS-Report},
  year = {2013},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaOk-LTCS-12-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Alexander {Okhotin}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-01},
  title = {Solving Language Equations and Disequations Using Looping Tree Automata with Colors},
  type = {LTCS-Report},
  year = {2012},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBM-LTCS-12-02,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-02},
  title = {{SAT} Encoding of Unification in {$\mathcal{ELH}_{R^+}$} w.r.t. Cycle-Restricted Ontologies},
  type = {LTCS-Report},
  year = {2012},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBM-LTCS-12-03,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-03},
  title = {Computing Minimal {$\mathcal{EL}$}-Unifiers is Hard},
  type = {LTCS-Report},
  year = {2012},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-LTCS-12-04,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-04},
  title = {Consistency in Fuzzy Description Logics over Residuated De Morgan Lattices},
  type = {LTCS-Report},
  year = {2012},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBM-LTCS-12-05,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-05},
  title = {A Goal-Oriented Algorithm for Unification in {$\mathcal{ELH}_{R^+}$} w.r.t. Cycle-Restricted Ontologies},
  type = {LTCS-Report},
  year = {2012},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Borc-LTCS-12-06,
  address = {Dresden, Germany},
  author = {Daniel {Borchmann}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {12-06},
  title = {On Confident GCIs of Finite Interpretations},
  type = {LTCS-Report},
  year = {2012},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BBBM-LTCS-11-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Nguyen Thanh {Binh} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-01},
  title = {Unification in the Description Logic {$\mathcal{EL}$} Without the Top Concept},
  type = {LTCS-Report},
  year = {2011},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-LTCS-11-02,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-02},
  title = {Complementation and Inclusion of Weighted Automata on Infinite Trees: Revised Version},
  type = {LTCS-Report},
  year = {2011},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Pena-LTCS-11-03,
  address = {Dresden, Germany},
  author = {Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-03},
  title = {Towards a Tableau Algorithm for Fuzzy ALC with Product T-norm},
  type = {LTCS-Report},
  year = {2011},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoMo-LTCS-11-04,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-04},
  title = {Finding Finite {H}erbrand Models},
  type = {LTCS-Report},
  year = {2011},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaBM-LTCS-11-05,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Stefan {Borgwardt} and Barbara {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-05},
  title = {Unification in the Description Logic {$\mathcal{EL}$} w.r.t.\ Cycle-Restricted {TB}oxes},
  type = {LTCS-Report},
  year = {2011},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-LTCS-11-06,
  address = {Dresden, Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {11-06},
  title = {Undecidability of Fuzzy Description Logics},
  type = {LTCS-Report},
  year = {2011},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaLiLi-LTCS-10-01,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Marcel {Lippmann} and Hongkai {Liu}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {10-01},
  title = {Adding Causal Relationships to {DL}-based Action Formalisms},
  type = {LTCS-Report},
  year = {2010},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaMo-LTCS-10-04,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Barbara {Morawska}},
  institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {10-04},
  title = {SAT Encoding of Unification in $\mathcal{EL}$},
  type = {LTCS-Report},
  year = {2010},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ PenTur-ltcs-10-02,
  address = {Germany},
  author = {Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-10-02},
  title = {Completion-based computation of least common subsumers with limited role-depth for {${\mathcal{EL}}$} and Prob-{${\mathcal{EL}^{01}}$}},
  type = {LTCS-Report},
  year = {2010},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ PenTur-ltcs-10-03,
  address = {Germany},
  author = {Rafael {Pe{\~n}aloza} and Anni-Yasmin {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-10-03},
  title = {Completion-based computation of most specific concepts with limited role-depth for {${\mathcal{EL}}$} and Prob-{${\mathcal{EL}^{01}}$}},
  type = {LTCS-Report},
  year = {2010},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BoPe-ltcs-10-05,
  address = {Germany},
  author = {Stefan {Borgwardt} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-10-05},
  title = {Complementation and Inclusion of Weighted Automata on Infinite Trees},
  type = {LTCS-Report},
  year = {2010},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ LTCS-Report09-01,
  address = {Germany},
  author = {Conrad {Drescher} and Hongkai {Liu} and Franz {Baader} and Steffen {Guhlemann} and Uwe {Petersohn} and Peter {Steinke} and Michael {Thielscher}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {09-01},
  title = {Putting ABox Updates into Action},
  type = {LTCS-Report},
  year = {2009},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaKP-LTCS-09,
  address = {Germany},
  author = {Franz {Baader} and Martin {Knechtel} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {09-02},
  title = {Computing Boundaries for Reasoning in Sub-Ontologies},
  type = {LTCS-Report},
  year = {2009},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ PeSe-LTCS-09-04,
  address = {Germany},
  author = {Rafael {Pe{\~n}aloza} and Bar\i{}\c{s} {Sertkaya}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {09-04},
  title = {On the Complexity of Axiom Pinpointing in Description Logics},
  type = {LTCS-Report},
  year = {2009},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BMLSW-LTCS-09-03,
  address = {Germany},
  author = {Franz {Baader} and Hongkai {Liu} and Anees ul {Mehdi}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-09-03},
  title = {{I}ntegrate {A}ction {F}ormalisms into {L}inear {T}emporal {D}escription {L}ogics},
  type = {LTCS-Report},
  year = {2009},
}



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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ LTCS-Report08-01,
  address = {Germany},
  author = {Franz {Baader} and Silvio {Ghilardi} and Carsten {Lutz}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {08-01},
  title = {{LTL} over Description Logic Axioms},
  type = {LTCS-Report},
  year = {2008},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ Dist08,
  address = {Dresden, Germany},
  author = {Felix {Distel}},
  institution = {Institute for theoretical computer science, TU Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {08-04},
  title = {Model-based Most Specific Concepts in Description Logics with Value Restrictions},
  year = {2008},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaaDi08,
  address = {Dresden},
  author = {Franz {Baader} and Felix {Distel}},
  institution = {Institute for Theoretical Computer Science, TU Dresden},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {08-05},
  title = {Exploring finite models in the Description Logic {$\mathcal{EL}_\mathrm{gfp}$}},
  type = {LTCS-Report},
  year = {2008},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaPe-LTCS-07-01,
  address = {Germany},
  author = {Franz {Baader} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-08-02},
  title = {Blocking and Pinpointing in Forest Tableaux},
  type = {LTCS-Report},
  year = {2008},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaPe-LTCS-08-03,
  address = {Germany},
  author = {Franz {Baader} and Rafael {Pe{\~n}aloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-08-03},
  title = {Pinpointing in Terminating Forest Tableaux},
  type = {LTCS-Report},
  year = {2008},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ sert-08-06,
  address = {Germany},
  author = {Bar{\i}{\c{s}} {Sertkaya}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-08-06},
  title = {Some Computational Problems Related to Pseudo-intents},
  type = {LTCS-Report},
  year = {2008},
}



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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Dist07,
  address = {Dresden, Germany},
  author = {Franz {Baader} and Felix {Distel}},
  institution = {Inst.\ f{\"u}r Theoretische Informatik, TU Dresden},
  number = {07-02},
  title = {A finite basis for the set of {EL}-implications holding in a finite model},
  year = {2007},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Sun-07-LTCS,
  address = {Germany},
  author = {Boontawee {Suntisrivaraporn}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-07-03},
  title = {Module Extraction and Incremental Classification: A Pragmatic Approach for EL+ Ontologies},
  type = {LTCS-Report},
  year = {2007},
}



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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaaderOkhotin-LTCS-06-01,
  address = {Germany},
  author = {Franz {Baader} and Alexander {Okhotin}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-06-01},
  title = {On Language Equations with One-sided Concatenation},
  type = {LTCS-Report},
  year = {2006},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BGSS-LTCS-06-02,
  address = {Germany},
  author = {Franz {Baader} and Bernhard {Ganter} and Ulrike {Sattler} and Baris {Sertkaya}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-06-02},
  title = {Completing Description Logic Knowledge Bases using Formal Concept Analysis},
  type = {LTCS-Report},
  year = {2006},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ LiLuMiWo-LTCS-06-03,
  address = {Germany},
  author = {H. {Liu} and C. {Lutz} and M. {Milicic} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-06-03},
  title = {Description Logic Actions with general {T}{B}oxes: a Pragmatic Approach},
  type = {LTCS-Report},
  year = {2006},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ BaaHlaPen-LTCS-06,
  address = {Germany},
  author = {F. {Baader} and J. {Hladik} and R. {Penaloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-06-04},
  title = {{PSPACE} Automata with Blocking for Description Logics},
  type = {LTCS-Report},
  year = {2006},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ Penaloza-LTCS-06-05,
  address = {Germany},
  author = {Rafael {Penaloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-06-05},
  title = {Pinpointing in Tableaus},
  type = {LTCS-Report},
  year = {2006},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaaderPenaloza-LTCS-07-01,
  address = {Germany},
  author = {Franz {Baader} and Rafael {Penaloza}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-07-01},
  title = {Axiom Pinpointing in General Tableaux},
  type = {LTCS-Report},
  year = {2006},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderBrandtLutz-LTCS-05-01,
  address = {Germany},
  author = {F. {Baader} and S. {Brandt} and C. {Lutz}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-01},
  title = {Pushing the EL Envelope},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BMLSW-LTCS-05-02,
  address = {Germany},
  author = {F. {Baader} and M. {Milicic} and C. {Lutz} and U. {Sattler} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-02},
  title = {Integrating Description Logics and Action Formalisms for Reasoning about Web Services},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutzWaltherWolter-LTCS-05-03,
  address = {Germany},
  author = {C. {Lutz} and D. {Walther} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-03},
  title = {Quantitative Temporal Logics: PSpace and below},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderGhilardiLTCS-05-04,
  address = {Germany},
  author = {Franz {Baader} and Silvio {Ghilardi}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-04},
  title = {Connecting Many-Sorted Theories},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-05-05,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-05},
  title = {PDL with Intersection and Converse is Decidable},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BonattiLutzWolter-LTCS-05-06,
  address = {Germany},
  author = {P. {Bonatti} and C. {Lutz} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-06},
  title = {Expressive Non-Monotonic Description Logics Based on Circumscription},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutzMilicic-LTCS-05-07,
  address = {Germany},
  author = {C. {Lutz} and M. {Milicic}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-07},
  title = {A Tableau Algorithm for DLs with Concrete Domains and GCIs},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ BaaderEtAll-LTCS-05-08,
  address = {Germany},
  author = {Franz {Baader} and Carsten {Lutz} and Eldar {Karabaev} and Manfred {Thei{\ss}en}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-08},
  title = {A New $n$-ary Existential Quantifier in Description Logics},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-05-09,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-09},
  title = {Complexity and Succinctness of Public Announcement Logic},
  type = {LTCS-Report},
  year = {2005},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LiLuMiWo-LTCS-05-10,
  address = {Germany},
  author = {H. {Liu} and C. {Lutz} and M. {Milicic} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-05-10},
  title = {Updating Description Logic ABoxes},
  type = {LTCS-Report},
  year = {2005},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Morawska-LTCS-04-01,
  address = {Germany},
  author = {B. {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-01},
  title = {A nice Cycle Rule for Goal-Directed $E$-Unification},
  type = {LTCS-Report},
  year = {2004},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-LTCS-04-02,
  address = {Germany},
  author = {F. {Baader}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-02},
  title = {A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL},
  type = {LTCS-Report},
  year = {2004},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ Brandt-LTCS-04-03,
  address = {Germany},
  author = {S. {Brandt}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-03},
  title = {Reasoning in $\mathcal{ELH}$ w.r.t.\ General Concept Inclusion Axioms},
  type = {LTCS-Report},
  year = {2004},
}


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.
Abstract  Paper (PDF) 

BibTeX entry:

@techreport{ Brandt-LTCS-04-04,
  address = {Germany},
  author = {S. {Brandt}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-04},
  title = {Subsumption and Instance Problem in $\mathcal{ELH}$ w.r.t.\ General TBoxes},
  type = {LTCS-Report},
  year = {2004},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutzWolter-LTCS-04-05,
  address = {Germany},
  author = {C. {Lutz} and F. {Wolter}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-05},
  title = {Modal Logics of Topological Relations},
  type = {LTCS-Report},
  year = {2004},
}


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.
Abstract  Paper (PDF)  Paper (PS) 

BibTeX entry:

@techreport{ LutzMilicic-LTCS-04-06,
  address = {Germany},
  author = {C. {Lutz} and M. {Milicic}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-04-06},
  title = {Description Logics with Concrete Domains and Functional Dependencies},
  type = {LTCS-Report},
  year = {2004},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BrTuKu-LTCS-03-02,
  address = {Germany},
  author = {S. {Brandt} and A.-Y. {Turhan} and R. {K{\"u}sters}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  number = {03-02},
  title = {Foundations of non-standard Inferences for Description Logics with transitive Roles and Role Hierarchies},
  type = {LTCS-Report},
  year = {2003},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-LTCS-03-01,
  address = {Germany},
  author = {F. {Baader}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-03-01},
  title = {The Instance Problem and the Most Specific Concept in the Description Logic {$\mathcal{EL}$} w.r.t.\ Terminological Cycles with Descriptive Semantics},
  type = {LTCS-Report},
  year = {2003},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Morawska-LTCS-03-03,
  address = {Germany},
  author = {B. {Morawska}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-03-03},
  title = {Completness of $E$-unification with eager Variable Elimination},
  type = {LTCS-Report},
  year = {2003},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LuWa-LTCS-03-04,
  address = {Germany},
  author = {C. {Lutz} and D. {Walther}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-03-04},
  title = {PDL with Negation of Atomic Programs},
  type = {LTCS-Report},
  year = {2003},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaGiTiLTCS-03-05,
  address = {Germany},
  author = {F. {Baader} and Silvio {Ghilardi} and Cesare {Tinelli}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-03-05},
  title = {A New Combination Procedure for the Word Problem that Generalizes Fusion Decidability Results in Modal Logics},
  type = {LTCS-Report},
  year = {2003},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BrTu-LTCS-02,
  address = {Germany},
  author = {S. {Brandt} and A.-Y. {Turhan}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {02-03},
  title = {An Approach for Optimizing {ALE}-Approximation of {ALC}-Concepts},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-02-01,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-02-01},
  title = {Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-LTCS-02-02,
  address = {Germany},
  author = {F. {Baader}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-02-02},
  title = {Terminological Cycles in a Description Logic with Existential Restrictions},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutAreHorSat-LTCS-02-04,
  address = {Germany},
  author = {C. {Lutz} and C. {Areces} and I. {Horrocks} and U. {Sattler}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-02-04},
  title = {Keys, Nominals, and Concrete Domains},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutzSattlerTendera-LTCS-02-05,
  address = {Germany},
  author = {C. {Lutz} and U. {Sattler} and L. {Tendera}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-02-05},
  title = {The Complexity of Finite Model Reasoning in Description Logics},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ HorrocksSattler-LTCS-02-06,
  address = {Germany},
  author = {I. {Horrocks} and U. {Sattler}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-02-06},
  title = {Decidability of {SHIQ} with Complex Role Inclusion Axioms},
  type = {LTCS-Report},
  year = {2002},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-LTCS-02-07,
  address = {Germany},
  author = {F. {Baader}},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Dresden University of Technology},
  note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
  number = {LTCS-02-07},
  title = {Least Common Subsumers, Most Specific Concepts, and Role-Value-Maps in a Description Logic with Existential Restrictions and Terminological Cycles},
  type = {LTCS-Report},
  year = {2002},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderBrandt+-LTCS-01-02,
  address = {Germany},
  author = {F. {Baader} and S. {Brandt} and R. {K{\"u}sters}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {01-02},
  title = {Matching under Side Conditions in Description Logics},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderTobies-LTCS-01-03,
  address = {Germany},
  author = {F. {Baader} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {01-03},
  title = {The Inverse Method Implements the Automata Approach for Modal Satisfiability},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuesters-LTCS-01-05,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {01-05},
  title = {Unification in a Description Logic with Transitive Closure of Roles},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BrandtKuesters+-LTCS-01-06,
  address = {Germany},
  author = {S. {Brandt} and R. {K{\"u}sters} and A.-Y. {Turhan}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  number = {01-06},
  title = {Approximation and Difference in Description Logics},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LuStuWoZa-LTCS-01-01,
  address = {Germany},
  author = {C. {Lutz} and H. {Sturm} and F. {Wolter} and M. {Zakharyaschev}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-01-01},
  title = {A Tableau Calculus for Temporal Description Logic: The Constant Domain Case},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ LutzSattlerWolter-LTCS-01-04,
  address = {Germany},
  author = {C. {Lutz} and U. {Sattler} and F. {Wolter}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-01-04},
  title = {Modal Logic and the two-variable fragment},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-01-07,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-01-07},
  title = {Adding Numbers to the ${\cal SHIQ}$ Description Logic---First Results},
  type = {LTCS-Report},
  year = {2001},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ HorrocksSattler-LTCS-01-08,
  address = {Germany},
  author = {I. {Horrocks} and U. {Sattler}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-01-08},
  title = {Optimised Reasoning for SHIQ},
  type = {LTCS-Report},
  year = {2001},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuestersMolitor-LTCS-00-04,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {00-04},
  title = {Rewriting Concepts Using Terminologies -- Revisited},
  type = {LTCS-Report},
  year = {2000},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ KuestersMolitor-LTCS-00-05,
  address = {RWTH Aachen, Germany},
  author = {R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science},
  number = {00-05},
  title = {Computing Most Specific Concepts in Description Logics with Existential Restrictions},
  type = {LTCS-Report},
  year = {2000},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ KuestersMolitor-LTCS-00-07,
  address = {Germany},
  author = {R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {00-07},
  title = {Computing Least Common Subsumers in ALEN},
  type = {LTCS-Report},
  year = {2000},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-00-01,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-00-01},
  title = {NExpTime-complete Description Logics with Concrete Domains},
  type = {LTCS-Report},
  year = {2000},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-Sattler-LTCS-00-02,
  address = {Germany},
  author = {C. {Lutz} and U. {Sattler}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-00-02},
  title = {The Complexity of Reasoning with Boolean Modal Logics (Extended Version)},
  type = {LTCS-Report},
  year = {2000},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ Hirsch-Tobies-LTCS-00-03,
  address = {Germany},
  author = {C. {Hirsch} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-00-03},
  title = {A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary Version},
  type = {LTCS-Report},
  year = {2000},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-00-06,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-00-06},
  title = {Interval-based Temporal Reasoning with General TBoxes},
  type = {LTCS-Report},
  year = {2000},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuestersMolitor-LTCS-99-12,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {Please refer to the revised version LTCS-Report 00-04.},
  number = {99-12},
  title = {Rewriting Concepts Using Terminologies -- Revisited},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Lutz-LTCS-99-01,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.},
  number = {LTCS-99-01},
  title = {The Complexity of Reasoning with Concrete Domains (Revised Version)},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Hacid-Rigotti-LTCS-99,
  address = {Germany},
  author = {M.-S. {~Hacid} and C. {Rigotti}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
  number = {LTCS-99-02},
  title = {{R}epresenting and {R}easoning on {C}onceptual {Q}ueries {O}ver {I}mage {D}atabases},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Decleir-Hacid-Kouloumdjian-LTCS-99,
  address = {Germany},
  author = {C. {Decleir} and M.-S. {Hacid} and J. {Kouloumdjian}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
  number = {LTCS-99-03},
  title = {{A} {D}atabase {A}pproach for {M}odeling and {Q}uerying {V}ideo {D}ata},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract 

BibTeX entry:

@techreport{ Lutz-LTCS-99-04,
  address = {Germany},
  author = {C. {Lutz}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {This report is superceded by the LTCS-00-01 technical report and my LPAR'99 paper.},
  number = {LTCS-99-04},
  title = {On the Complexity of Terminological Reasoning},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Tobies-LTCS-99-05,
  address = {Germany},
  author = {S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {An abriged version appeared at CSL-99.},
  number = {LTCS-99-05},
  title = {A NEXPTIME-complete Description Logic Strictly Contained in {$C^2$}},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderMolitor-LTCS-99-06,
  address = {Germany},
  author = {F. {Baader} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-99-06},
  title = {Rewriting Concepts using Terminologies},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuesters-LTCS-99-07-1999,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-99-07},
  title = {Matching in Description Logics with Existential Restrictions},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ HoSatTob-LTCS-99-08,
  author = {I. {Horrocks} and U. {Sattler} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {Revised version. See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-99-08},
  title = {A Description Logic with Transitive and Converse Roles, Role Hierarchies and Qualifying Number Restrictions},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Tobies-LTCS-99-09,
  address = {Germany},
  author = {S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.},
  number = {LTCS-99-09},
  title = {A {PSpace}-algorithm for {ALCQI}-satisfiability},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Tobies-LTCS-99-11,
  address = {Germany},
  author = {S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.},
  number = {LTCS-99-11},
  title = {{PSpace} Reasoning for {DLs} with Qualifying Number Restrictions},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuesters-LTCS-99-13-1999,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-99-13},
  title = {Matching Concept Descriptions with Existential Restrictions Revisited},
  type = {LTCS-Report},
  year = {1999},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ HorrocksTobies-LTCS-99-14,
  author = {I. {Horrocks} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-99-14},
  title = {Optimisation of Terminological Reasoning},
  type = {LTCS-Report},
  year = {1999},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ HorrocksSattler+-LTCS-99-15,
  address = {Germany},
  author = {I. {Horrocks} and U. {Sattler} and S. {Tessaris} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-99-15},
  title = {Query Containment Using a {DLR} {ABox}},
  type = {LTCS-Report},
  year = {1999},
}



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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ TrespMolitor-LTCS-98-01,
  address = {Germany},
  author = {C.B. {Tresp} and R. {Molitor}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html},
  number = {LTCS-98-01},
  title = {A Description Logic for Vague Knowledge},
  type = {LTCS-Report},
  year = {1998},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ BaSat98,
  author = {F. {Baader} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-98-02},
  title = {Description Logics with Aggregates and Concrete Domains, Part II (extended)},
  type = {LTCS-Report},
  year = {1998},
}


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

BibTeX entry:

@techreport{ Molitor-LTCS-98-03,
  author = {R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-98-03},
  title = {Structural {S}ubsumption for {$\cal A\!L\!N$}},
  type = {LTCS-Report},
  year = {1998},
}


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.
Abstract  Paper (PS)  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuestersMolitor-LTCS-98-04,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-98-04},
  title = {Structural Subsumption Considered from an Automata Theoretic Point of View},
  type = {LTCS-Report},
  year = {1998},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ HoSat98,
  author = {I. {Horrocks} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-98-05},
  title = {A Description Logic with Transitive and Converse Roles and Role Hierarchies},
  type = {LTCS-Report},
  year = {1998},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuesters-LTCS-98-06-1998,
  author = {F. {Baader} and R. {K{\"u}sters}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-98-06},
  title = {Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions},
  type = {LTCS-Report},
  year = {1998},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-Narendran-LTCS-98,
  author = {F. {Baader} and P. {Narendran}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-98-07},
  title = {Unification of Concept Terms in Description Logics: Revised Version},
  type = {LTCS-Report},
  year = {1998},
}


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

BibTeX entry:

@techreport{ HoSatTob98,
  author = {I. {Horrocks} and U. {Sattler} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  number = {LTCS-98-08},
  title = {A PSpace-algorithm for deciding {$\mathcal{ALCNI}_{R^+}$}-satisfiability},
  type = {LTCS-Report},
  year = {1998},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaaderKuesters+-LTCS-98-09,
  address = {Germany},
  author = {F. {Baader} and R. {K{\"u}sters} and R. {Molitor}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.},
  number = {LTCS-98-09},
  title = {Computing Least Common Subsumers in Description Logics with Existential Restrictions},
  type = {LTCS-Report},
  year = {1998},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-Molitor-Tobies-LTCS-98a,
  address = {Germany},
  author = {F. {Baader} and R. {Molitor} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html},
  number = {LTCS-98-10},
  title = {The Guarded Fragment of Conceptual Graphs},
  type = {LTCS-Report},
  year = {1998},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ BaaderMolitorTobies-LTCS-98-11,
  address = {Germany},
  author = {F. {Baader} and R. {Molitor} and S. {Tobies}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.},
  number = {LTCS-98-11},
  title = {On the Relation between Descripion Logics and Conceptual Graphs},
  type = {LTCS-Report},
  year = {1998},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ BaSat97,
  author = {F. {Baader} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  note = {An abridged version has appeared in the Proceedings of the International Workshop on Description Logics 97.},
  number = {LTCS-97-01},
  title = {Description Logics with Aggregates and Concrete Domains},
  type = {LTCS-Report},
  year = {1997},
}


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

BibTeX entry:

@techreport{ Baader-Narendran-LTCS-97,
  author = {F. {Baader} and P. {Narendran}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-97-02},
  title = {Unification of Concept Terms in Description Logics},
  type = {LTCS-Report},
  year = {1997},
}


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

BibTeX entry:

@techreport{ Baader-LTCS-97-03,
  author = {F. {Baader}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-97-03},
  title = {On the Complexity of Boolean Unification},
  type = {LTCS-Report},
  year = {1997},
}


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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Kuesters-LTCS-97-04,
  author = {R. {K{\"u}sters}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-97-04},
  title = {Characterizing the semantics of terminological cycles in {$\mathcal{ALN}$} using finite automata},
  type = {LTCS-Report},
  year = {1997},
}


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
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Hacid&al97a,
  author = {M. S. {Hacid} and P. {Marcel} and C. {Rigotti}},
  booktitle = {Proc. of the 5th Intl. Conf. on Deductive and Object-Oriented Databases (DOOD'97)},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {A short version has appeared in the Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases (DOOD'97), Montreux, Switzerland},
  number = {LTCS-97-05},
  publisher = {SPRINGER},
  series = {LNCS},
  title = {A rule based data manipulation language for {OLAP} systems},
  type = {LTCS-Report},
  year = {1997},
}



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.
Abstract  Paper (PS) 

BibTeX entry:

@techreport{ Baader-Tinelli-LTCS-96,
  author = {F. {Baader} and C. {Tinelli}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {An abridged version has appeared in Proc.\ CADE'97, Springer LNAI 1249.},
  number = {LTCS-96-01},
  title = {A New Approach for Combining Decision Procedures for the Word Problem, and Its Connection to the {Nelson-Oppen} Combination Method},
  type = {LTCS-Report},
  year = {1996},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ BaaderSattler-LTCS-96-02,
  author = {F. {Baader} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {An abridged version has appeared in the Proceedings of the Fifth International Conference on Knowledge Representation and Reasoning, 1996, Cambridge, Massachusetts.},
  number = {LTCS-96-02},
  title = {Number Restrictions on Complex Roles in Description Logics},
  year = {1996},
}


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.
Paper (PS) 

BibTeX entry:

@techreport{ BaaderSattler-LTCS-96-03,
  author = {F. {Baader} and U. {Sattler}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen},
  note = {An abridged version has appeared in the Proceedings of the 12th European Conference on Artificial Intelligence, 1996, Budapest, Hungary.},
  number = {LTCS-96-03},
  title = {Description Logics with Symbolic Number Restrictions},
  year = {1996},
}


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

BibTeX entry:

@techreport{ KepserRichts-LTCS-96-04,
  address = {Germany},
  author = {S. {Kepser} and J. {Richts}},
  institution = {LuFG Theoretical Computer Science, RWTH Aachen},
  number = {LTCS-96-04},
  title = {Optimisation Techniques for Combining Constraint Solvers},
  type = {LTCS-Report},
  year = {1996},
}


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

BibTeX entry:

@techreport{ Baader-LTCS-96,
  author = {F. {Baader}},
  institution = {LuFg Theoretical Computer Science, RWTH Aachen, Germany},
  number = {LTCS-96-05},
  title = {Combination of Compatible Reduction Orderings that are Total on Ground Terms},
  type = {LTCS-Report},
  year = {1996},
}



Back to the hompage of the Chair of Automata Theory.
Generated Mon Jan 15 13:51:23 2018.