Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders

  • Davide Bresolin
  • Angelo Montanari
  • Pietro Sala
  • Guido Sciavicco
Conference paper

DOI: 10.1007/978-3-540-87803-2_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5293)
Cite this paper as:
Bresolin D., Montanari A., Sala P., Sciavicco G. (2008) Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders. In: Hölldobler S., Lutz C., Wansing H. (eds) Logics in Artificial Intelligence. JELIA 2008. Lecture Notes in Computer Science, vol 5293. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Davide Bresolin
    • 1
  • Angelo Montanari
    • 2
  • Pietro Sala
    • 2
  • Guido Sciavicco
    • 3
  1. 1.Department of Computer ScienceUniversity of VeronaVeronaItaly
  2. 2.Department of Mathematics and Computer ScienceUniversity of UdineUdineItaly
  3. 3.Department of Information, Engineering and CommunicationsUniversity of MurciaMurciaSpain

Personalised recommendations