Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423161 | Electronic Notes in Theoretical Computer Science | 2009 | 17 Pages |
Abstract
We present the first tableau-based decision procedure for basic hybrid logic with the difference modality. The decision procedure is gracefully degrading in that the less expressive constructs don't pay for the computationally expensive difference modality. The procedure can be specialized to reflexive and transitive frames. Key features of our approach are nominal elimination, pattern-based blocking, and expansion control.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics