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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Bresolin, D., Montanari, A., & Sala, P. (2007). An optimal tableau-based decision algorithm for propositional neighborhood logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4393 LNCS, pp. 549–560). Springer Verlag. https://doi.org/10.1007/978-3-540-70918-3_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
