An optimal Tableau-based decision algorithm for propositional neighborhood logic

Authors:
Davide Bresolin;Angelo Montanari;Pietro Sala
Affiliations:
Department of Mathematics and Computer Science, University of Udine, Italy;Department of Mathematics and Computer Science, University of Udine, Italy;Department of Mathematics and Computer Science, University of Udine, Italy
Venue:
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Year:
2007

Citing 5
Cited 15

A propositional modal logic of time intervals

Journal of the ACM (JACM)
Decidability of Interval Temporal Logics over Split-Frames via Granularity

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Propositional Interval Temporal Logics: Some Promising Paths

TIME '05 Proceedings of the 12th International Symposium on Temporal Representation and Reasoning
An Optimal Decision Procedure for Right Propositional Neighborhood Logic

Journal of Automated Reasoning
A tableau-based decision procedure for right propositional neighborhood logic

TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods

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
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
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
Back to Interval Temporal Logics

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Complete and Terminating Tableau for the Logic of Proper Subinterval Structures Over Dense Orderings

Electronic Notes in Theoretical Computer Science (ENTCS)
Using temporal logic for spatial reasoning: temporalized propositional neighborhood logic

EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders

Electronic Notes in Theoretical Computer Science (ENTCS)
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
The importance of the past in interval temporal logics: the case of propositional neighborhood logic

Logic Programs, Norms and Action
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers

Theoretical Computer Science
A survey on temporal logics for specifying and verifying real-time systems

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we focus our attention on the decision problem for Propositional Neighborhood Logic (PNL for short). PNL is the proper subset of Halpern and Shoham's modal logic of intervals whose modalities correspond to Allen's relations meets and met by. We show that the satisfiability problem for PNL over the integers is NEXPTIME-complete. Then, we develop a sound and complete tableau-based decision procedure and we prove its optimality.