Abstract
We present the first terminating tableau system for hybrid logic with eventualities. The system is designed as a basis for gracefully degrading reasoners. Eventualities are formulas of the form ◇* that hold for a state if it can reach in n ≥ 0 steps a state satisfying the formula s. The system is prefix-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision procedures. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Kaminski, M., & Smolka, G. (2010). Terminating tableaux for hybrid logic with eventualities. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6173 LNAI, pp. 240–254). https://doi.org/10.1007/978-3-642-14203-1_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
