We investigate fragments of Halpern-Shoham's interval logic HS involving the modal operators for the relations of left or right overlap of intervals. We prove that most of these fragments are undecidable, by employing a non-trivial reduction from the octant tiling problem.
D. Bresolin, A. Montanari, P. Sala (2008). Optimal tableau for Right Propositional Neighborhood Logic over trees. IEEE Comp. Society Press [10.1109/TIME.2008.17].
Optimal tableau for Right Propositional Neighborhood Logic over trees
BRESOLIN, DAVIDE;
2008
Abstract
We investigate fragments of Halpern-Shoham's interval logic HS involving the modal operators for the relations of left or right overlap of intervals. We prove that most of these fragments are undecidable, by employing a non-trivial reduction from the octant tiling problem.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
