Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
ISMIS'11 Proceedings of the 19th international conference on Foundations of intelligent systems
A cut-free exptime tableau decision procedure for the description logic SHI
ICCCI'11 Proceedings of the Third international conference on Computational collective intelligence: technologies and applications - Volume Part I
Optimal tableau algorithms for coalgebraic logics
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimal and cut-free tableaux for propositional dynamic logic with converse
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Optimized description logic reasoning via core blocking
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
BDD-based automated reasoning for propositional bi-intuitionistic tense logics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Extended caching, backjumping and merging for expressive description logics
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Studia Logica
ExpTime Tableaux for Using Sound Global Caching
Journal of Automated Reasoning
Hi-index | 0.00 |
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.