Advertisement
Published in:
2010 | OriginalPaper | Chapter
Terminating Tableaux for Hybrid Logic with Eventualities
Authors : Mark Kaminski, Gert Smolka
Published in: Automated Reasoning
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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
$\Diamond^*s$
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.