Logics in Artificial Intelligence

Volume 5293 of the series Lecture Notes in Computer Science pp 62-75

Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders

  • Davide BresolinAffiliated withDepartment of Computer Science, University of Verona
  • , Angelo MontanariAffiliated withDepartment of Mathematics and Computer Science, University of Udine
  • , Pietro SalaAffiliated withDepartment of Mathematics and Computer Science, University of Udine
  • , Guido SciaviccoAffiliated withDepartment of Information, Engineering and Communications, University of Murcia

* Final gross prices may vary according to local VAT.

Get Access


The study of interval temporal logics on linear orders is a meaningful research area in computer science and artificial intelligence. Unfortunately, even when restricted to propositional languages, most interval logics turn out to be undecidable. Decidability has been usually recovered by imposing severe syntactic and/or semantic restrictions. In the last years, tableau-based decision procedures have been obtained for logics of the temporal neighborhood and logics of the subinterval relation over specific classes of temporal structures. In this paper, we develop an optimal NEXPTIME tableau-based decision procedure for the future fragment of Propositional Neighborhood Logic over the whole class of linearly ordered domains.