Chair for Automata Theory of the Institute for Theoretical Computer Science, Faculty of Computer Science at TU Dresden

Technical Reports

2003


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


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


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


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


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


There is also a complete overview of our technical reports.
home Back to the homepage of the Chair for Automata Theory.
Generated at Tue Apr 24 10:46:19 CEST 2012.