@TechReport{ BaLiLi-LTCS-10-01,
author = {Franz Baader and Marcel Lippmann and Hongkai Liu},
title = {Adding Causal Relationships to {DL}-based Action Formalisms},
institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
year = 2010,
type = {LTCS-Report},
number = {10-01},
address = {Dresden, Germany},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
}
Rafael Peñaloza and Anni-Yasmin Turhan.
Completion-based computation of least common subsumers with limited
role-depth for EL and Prob-EL^01.
LTCS-Report 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 (PS) Paper (PDF)
@TechReport{PenTur-ltcs-10-02,
author = {Rafael Pe{\~n}aloza and Anni-Yasmin Turhan},
title = {Completion-based computation of least common subsumers with
limited role-depth for {${\mathcal{EL}$}} and
Prob-{${\mathcal{EL}^{01}}$}},
institution = {Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology},
year = 2010,
type = {LTCS-Report},
number = {LTCS-10-02},
address = {Germany},
note = {See
http://lat.inf.tu-dresden.de/research/reports.html.}
}
Rafael Peñaloza and Anni-Yasmin Turhan.
Completion-based computation of most specific concepts with limited
role-depth for EL and Prob-EL^01.
LTCS-Report 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 (PS) Paper (PDF)
@TechReport{PenTur-ltcs-10-03,
author = {Rafael Pe{\~n}aloza and Anni-Yasmin Turhan},
title = {Completion-based computation of most specific concepts with
limited role-depth for {${\mathcal{EL}$}} and
Prob-{${\mathcal{EL}^{01}}$}},
institution = {Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology},
year = 2010,
type = {LTCS-Report},
number = {LTCS-10-03},
address = {Germany},
note = {See
http://lat.inf.tu-dresden.de/research/reports.html.}
}
Franz Baader and Barbara Morawska.
SAT Encoding of Unification in EL.
LTCS-Report 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)
@TechReport{BaMo-LTCS-10-04,
author = {Franz Baader and Barbara Morawska},
title = {SAT Encoding of Unification in $\mathcal{EL}$},
institution = {Chair of Automata Theory, Institute of Theoretical Computer Science, Technische Universit{\"a}t Dresden},
year = 2010,
type = {LTCS-Report},
number = {10-04},
address = {Dresden, Germany},
note = {See http://lat.inf.tu-dresden.de/research/reports.html.},
}
Stefan Borgwardt and Rafael Peñaloza.
Complementation and Inclusion of Weighted Automata on Infinite Trees.
LTCS-Report 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)
@TechReport{BoPe-ltcs-10-05,
author = {Stefan Borgwardt and Rafael Pe{\~n}aloza},
title = {Complementation and Inclusion of Weighted Automata on Infinite Trees},
institution = {Chair for Automata Theory, Institute for Theoretical
Computer Science, Dresden University of Technology},
year = 2010,
type = {LTCS-Report},
number = {LTCS-10-05},
address = {Germany},
note = {See
http://lat.inf.tu-dresden.de/research/reports.html.}
}
Back to the homepage of the Chair for Automata Theory.