A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A Tableau System for Right Propositional Neighborhood Logic over Finite Linear Orders: An Implementation
[chapter]
2013
Lecture Notes in Computer Science
Interval temporal logics are quite expressive temporal logics, which turn out to be difficult to deal with in many respects. Even finite satisfiability of simple interval temporal logics presents non-trivial technical issues when it comes to the implementation of efficient tableaubased decision procedures. We focus our attention on the logic of Allen's relation meets, a.k.a. Right Propositional Neighborhood Logic (RPNL), interpreted over finite linear orders. Starting from a high-level
doi:10.1007/978-3-642-40537-2_8
fatcat:vgqnpnuserea7nxktixedvcehi