Sound Global State Caching for ALC with Inverse Roles

  • Authors:
  • Rajeev Goré;Florian Widmann

  • Affiliations:
  • Logic and Computation Group, The Australian National University, Canberra, Australia ACT 0200;Logic and Computation Group and NICTA, The Australian National University, Canberra, Australia ACT 0200

  • Venue:
  • TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We give an optimal (exptime ), sound and complete tableau-based algorithm for deciding satisfiability with respect to a TBox in the logic ALCI using global state caching. Global state caching guarantees optimality and termination without dynamic blocking, but in the presence of inverse roles, the proofs of soundness and completeness become significantly harder. We have implemented the algorithm in OCaml, and our initial comparison with FaCT++ indicates that it is a promising method for checking satisfiability with respect to a TBox.