Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders

Authors:
Davide Bresolin;Angelo Montanari;Pietro Sala;Guido Sciavicco
Affiliations:
Department of Computer Science, University of Verona, Verona, Italy;Department of Mathematics and Computer Science, University of Udine, Udine, Italy;Department of Mathematics and Computer Science, University of Udine, Udine, Italy;Department of Information, Engineering and Communications, University of Murcia, Murcia, Spain
Venue:
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Year:
2008

Citing 6
Cited 6

A propositional modal logic of time intervals

Journal of the ACM (JACM)
An Adequate First Order Interval Logic

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
An Optimal Decision Procedure for Right Propositional Neighborhood Logic

Journal of Automated Reasoning
On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Tableau Systems for Logics of Subinterval Structures over Dense Orderings

TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
An optimal Tableau-based decision algorithm for propositional neighborhood logic

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings

Electronic Notes in Theoretical Computer Science (ENTCS)
B and D are enough to make the Halpern-Shoham logic undecidable

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Expressiveness of the interval logics of Allen's relations on the class of all linear orders: complete classification

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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 specificclasses 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 wholeclass of linearly ordered domains.