Prof. Dr. Ralf Möller
Software, Technology and Systems Group (STS),
Hamburg University of Technology (TUHH)
Publications
2000
V. Haarslev and R. Möller.
Consistency Testing: The RACE Experience.
In Roy Dyckhoff, editor, Proc. of TABLEAUX'2000, International Conference,
Automated Reasoning with Analytic Tableaux and Related Methods, St. Andrews,
Scotland, UK, July 3-7, pages 57–61. Springer-Verlag, 2000.
Bibtex entry Paper (PDF)
Abstract
This paper presents the results of applying RACE, a description logic system for ALCNHR+, to modal logic SAT problems. Some aspects of the RACE architecture are discussed in detail: (i) techniques involving caching and (ii) techniques for dealing with individuals.
V. Haarslev and R. Möller.
Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and
Transitively Closed Roles.
In Fausto Giunchiglia and Bart Selman, editors, Proceedings of Seventh
International Conference on Principles of Knowledge Representation and
Reasoning (KR2000), Breckenridge, Colorado, USA, 12-15 April, pages
273–284. Morgan Kaufmann, 2000.
Bibtex entry Paper (PDF)
Abstract
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+. Prominent language features beyond ALC are number restrictions, role hierarchies, transitively closed roles, and generalized concept inclusions. The ABox description logic system RACE is based on the calculus for ALCNHR+.
V. Haarslev and R. Möller.
High Performance Reasoning with Very Large Knowledge Bases.
In Proceedings of the International Workshop in Description Logics 2000
(DL2000), Aachen, Germany, pages 143–152, 2000.
Bibtex entry Paper (PDF)
Abstract
In this contribution we present an empirical analysis of the performance of the ALCNHR+ description logic system RACE applied to TBoxes with a very large number of primitive concept definitions.A daptions previously known techniques as well as new optimization techniques efficiently dealing with these kinds of knowledge bases are discussed.
V. Haarslev and R. Möller.
Optimizing TBox and ABox Reasoning with Pseudo Models.
In Proceedings of the International Workshop in Description Logics 2000
(DL2000), Aachen, Germany, pages 153–162, 2000.
Bibtex entry Paper (PDF)
Abstract
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models. These techniques are applied to speed-up TBox and ABox reasoning for the description logic ALCNHR+. The advances are demonstrated by an empirical analysis using the description logic system RACE that implements TBox and ABox reasoning for ALCNHR+.
V. Haarslev, R. Möller, and M. Wessel.
The Description Logic ALCNHR+ Extended with Concrete Domains.
Technical Report FBI-HH-M-290/00, University of Hamburg, Computer Science
Department, 2000.
Bibtex entry Paper (PDF)
Abstract
The paper introduces the description logic ALCNHR+(D)- Prominent language features beyond ALC are number restrictions, role hierarchies, transitively closed roles, generalized concept inclusions and concrete domains. As in other languages based on concrete domains, e.g. ALC(D), a so-called predicate exists restriction concept constructor is provided. However, compared to ALC(D) only features and no feature chains are allowed in this operator. This results in a limited expressivity w.r.t. concrete domains but is required to ensure the decidability of the language. We show that the results can be exploited for building practical description logic systems for solving e.g. configuration problems.
M. Wessel, V. Haarslev, and R. Möller.
ALCRA – ALC with Role Axioms.
In Proceedings of the International Workshop in Description Logics 2000
(DL2000), Aachen, Germany, pages 267–276, 2000.
Bibtex entry Paper (PDF)
Abstract
This paper presents a tableaux calculus for deciding the concept satisability problem of the new description logic ALCRA and discusses some open problems. ALCRA augments the description logic ALC with role inclusion axioms of the form S o T inclused R1 or ... or Rn. Additionally, all roles are interpreted as disjoint.