The FaCT System

FaCT is a Description Logic classifier which has been implemented as a test-bed for a highly optimised tableaux satisfiability (subsumption) testing algorithm. The correspondence between modal and description logics also allows FaCT to be used as a theorem prover for the propositional modal logics K, KT, K4 and S4. Empirical tests have demonstrated the effectiveness of the optimised implementation and, in particular, of the dependency directed backtracking optimisation.

[1]  Franz Baader,et al.  KRIS: Knowledge Representation and Inference System , 1991, SGAR.

[2]  Ulrike Sattler,et al.  A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.

[3]  Fausto Giunchiglia,et al.  Building Decision Procedures for Modal Logics from Propositional Decision Procedure - The Case Study of Modal K , 1996, CADE.

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

[5]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[6]  Werner Nutt,et al.  Terminological Knowledge Representation: A Proposal for a Terminological Logic , 1991, Description Logics.

[7]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

[8]  Jon W. Freeman.  Hard Random 3-SAT Problems and the Davis-Putnam Procedure , 1996, Artif. Intell..

[9]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[10]  Francesco M. Donini,et al.  Decidable Reasoning in Terminological Knowledge Representation Systems , 1993, IJCAI.

[11]  Fausto Giunchiglia,et al.  A SAT-based Decision Procedure for ALC , 1996, KR.

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

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

[14]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[15]  A. B. Baker.  Intelligent backtracking on constraint satisfaction problems: experimental and theoretical results , 1995 .

[16]  Sergio Tessaris,et al.  Implementing and Testing Expressive Description Logics: a Preliminary Report , 1995 .