Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment

  • Authors:
  • Jan Hladik

  • Affiliations:
  • -

  • Venue:
  • TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present SAGA, the implementation of a tableau-based Satisfiability Algorithm for the Guarded Fragment (GF). Satisfiability for GF with finite signature is ExpTime-complete and therefore theoretically intractable, but existingtableau-based systems for ExpTime-complete description and modal logics perform well for many realistic knowledge bases. We implemented and evaluated several optimisations used in description logic systems, and our results show that with an efficient combination, SAGA can compete with existinghig hly optimised systems for description logics and first order logic.