Description of the RACER System and its Applications

RACER implements a TBox and ABox reasoner for the logic SHIQ. RACER was the first full-fledged ABox description logic system for a very expressive logic and is based on optimized sound and complete algorithms.

[1]  Ian Horrocks.  Benchmark Analysis with FaCT , 2000, TABLEAUX.

[2]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[3]  Volker Haarslev,et al.  The Description Logic ALCN H R + Extended with Concrete Domains: Revised Version , 2000 .

[4]  Jordi Alvarez.  TBox Acquisition and Information Theory , 2000, Description Logics.

[5]  Ian Horrocks,et al.  Reasoning with Axioms: Theory and Practice , 2000, KR.

[6]  Ian Horrocks,et al.  Optimizing Description Logic Subsumption , 1999, J. Log. Comput..

[7]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[8]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[9]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[10]  J. Freeman.  Improvements to propositional satisfiability search algorithms , 1995 .

[11]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[12]  Volker Haarslev,et al.  An Empirical Evaluation of Optimization Strategies for ABox Reasoning in Expressive Description Logics , 1999, Description Logics.

[13]  Franz Baader,et al.  Extensions of Concept Languages for a Mechanical Engineering Application , 1992, GWAI.

[14]  Enrico Franconi,et al.  The i.com tool for Intelligent Conceptual Modeling , 2000, KRDB.

[15]  Diego Calvanese,et al.  Logics for Databases and Infor-mation Systems , 1998 .

[16]  Anni-Yasmin Turhan,et al.  RACE User's Guide and Reference Manual Version 1.1 , 1999 .

[17]  I. Horrocks,et al.  A PSPACE-algorithm for deciding ALCNIR+-satisfiability , 1998 .

[18]  Gerald J. Sussman,et al.  Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis , 1976, Artif. Intell..

[19]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[20]  Volker Haarslev,et al.  High Performance Reasoning with Very Large Knowledge Bases: A Practical Case Study , 2001, IJCAI.

[21]  Maarten de Rijke,et al.  Description Logics and Feature Interaction , 1999, Description Logics.

[22]  J. Davenport.  Editor , 1960 .

[23]  Volker Haarslev,et al.  Combining Tableaux and Algebraic Methods for Reasoning with Qualified Number Restrictions , 2001, Description Logics.

[24]  Carsten Lutz.  The Complexity of Reasoning with Concrete Domains Revised Version , 1999 .

[25]  Volker Haarslev,et al.  Consistency Testing: The RACE Experience , 2000, TABLEAUX.

[26]  Diego Calvanese,et al.  Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.

[27]  Volker Haarslev,et al.  Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics , 2001, IJCAR.

[28]  J StuckeyPeter,et al.  The CLP( ℛ ) language and system , 1992 .

[29]  Volker Haarslev,et al.  Adapting Optimization Techniques to Description Logics with Concrete Domains , 2000, Description Logics.

[30]  Volker Haarslev,et al.  Optimizing Reasoning in Description Logics with Qualified Number Restrictions , 2001, Description Logics.

[31]  Volker Haarslev,et al.  Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles , 2000, KR.