@TechReport{Lutz-LTCS-00-01,
author = {C. Lutz},
title = {NExpTime-complete Description Logics with Concrete Domains},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {LTCS-00-01},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
C. Lutz and U. Sattler.
The Complexity of Reasoning with Boolean Modal Logics (Extended
Version).
LTCS-Report 00-02, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Abstract Paper (PS)
@TechReport{Lutz-Sattler-LTCS-00-02,
author = {C. Lutz and U. Sattler},
title = {The Complexity of Reasoning with Boolean Modal Logics (Extended Version)},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {LTCS-00-02},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
C. Hirsch and S. Tobies.
A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary
Version.
LTCS-Report 00-03, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Paper (PS)
@TechReport{Hirsch-Tobies-LTCS-00-03,
author = {C.~Hirsch and S.~Tobies},
title = {A Tableaux Algorithm for the Clique Guarded Fragment, Preliminary Version},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {LTCS-00-03},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
F. Baader, R. Küsters, and R. Molitor.
Rewriting Concepts Using Terminologies – Revisited.
LTCS-Report 00-04, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Abstract Paper (PS)
@TechReport{BaaderKuestersMolitor-LTCS-00-04,
author = {F.~Baader and R.~K{\"u}sters and R.~Molitor},
title = {Rewriting Concepts Using Terminologies -- Revisited},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {00-04},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
R. Küsters and R. Molitor.
Computing Most Specific Concepts in Description Logics with Existential
Restrictions.
LTCS-Report 00-05, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
Abstract Paper (PS)
@TechReport{KuestersMolitor-LTCS-00-05,
author = {R.~K{\"u}sters and R.~Molitor},
title = {Computing Most Specific Concepts in Description Logics with Existential Restrictions},
institution = {LuFG Theoretical Computer Science},
year = 2000,
type = {LTCS-Report},
number = {00-05},
address = {RWTH Aachen, Germany}
}
C. Lutz.
Interval-based Temporal Reasoning with General TBoxes.
LTCS-Report 00-06, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Abstract Paper (PS)
@TechReport{Lutz-LTCS-00-06,
author = {C. Lutz},
title = {Interval-based Temporal Reasoning with General TBoxes},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {LTCS-00-06},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
R. Küsters and R. Molitor.
Computing Least Common Subsumers in ALEN.
LTCS-Report 00-07, LuFG Theoretical Computer Science, RWTH Aachen, Germany,
2000.
See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.
Abstract Paper (PS)
@TechReport{KuestersMolitor-LTCS-00-07,
author = {R.~K{\"u}sters and R.~Molitor},
title = {Computing Least Common Subsumers in ALEN},
institution = {LuFG Theoretical Computer Science, RWTH Aachen},
year = 2000,
type = {LTCS-Report},
number = {00-07},
address = {Germany},
note = {See http://www-lti.informatik.rwth-aachen.de/Forschung/Reports.html.}
}
Back to the homepage of the Chair for Automata Theory.