Sound global state caching for ALC with inverse roles

Rajeev Goré*, Florian Widmann

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    24 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publicationAutomated Reasoning with Analytic Tableaux and Related Methods - 18th International Conference, TABLEAUX 2009, Proceedings
    Pages205-219
    Number of pages15
    DOIs
    Publication statusPublished - 2009
    Event18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2009 - Oslo, Norway
    Duration: 6 Jul 200910 Jul 2009

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5607 LNAI
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2009
    Country/TerritoryNorway
    CityOslo
    Period6/07/0910/07/09

    Fingerprint

    Dive into the research topics of 'Sound global state caching for ALC with inverse roles'. Together they form a unique fingerprint.

    Cite this