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

Technical Reports

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-Report 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},
 title          = {A New Approach for Combining Decision Procedures for the Word Problem,
                   and Its Connection to the {Nelson-Oppen} Combination Method},
 institution    = {LuFg Theoretical Computer Science, RWTH Aachen},
 year           = 1996,
 type           = {LTCS-Report},
 number         = {LTCS-96-01},
 note           = {An abridged version has appeared in Proc.\ CADE'97, Springer LNAI 1249.},
 ccl            = {yes}
}


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


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


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

Bibtex Entry

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


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

Bibtex Entry

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


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.