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

Technical Reports

2012


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


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


Franz Baader, Stefan Borgwardt, and Barbara Morawska. Computing Minimal EL-Unifiers is Hard. LTCS-Report 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,
  author      = {Franz Baader and Stefan Borgwardt and Barbara Morawska},
  title       = {Computing Minimal {$\mathcal{EL}$}-Unifiers is Hard},
  institution = {Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit{\"a}t Dresden},
  year        = 2012,
  type        = {LTCS-Report},
  number      = {12-03},
  address     = {Dresden, 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.