The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees

Authors:
Bernhard Heinemann
Affiliations:
(Correspd.) Fachbereich Informatik, FernUniversität Hagen, D-58084 Hagen, Germany. email: bernhard.heinemann@fernuni-hagen.de
Venue:
Fundamenta Informaticae
Year:
1999

Citing 5
Cited 0

A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
Revisiting knowledge and time from a topological a point of view

SCAI '97 Proceedings of the sixth Scandinavian conference on Artificial intelligence
Reasoning about Knowledge on Computation Trees

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Modal Logic for Reasoning about Knowledge and Time on Binary Subset Trees

ECSQARU/FAPR '97 Proceedings of the First International Joint Conference on Qualitative and Quantitative Practical Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present note we determine the complexity of the satisfiability problem of a certain modal logic of subset spaces which was proposed in [6]. The corresponding semantics is defined w.r.t. binary ramified subset trees consisting of a set X and a distinguished set 𝒪 of subsets of X such that the relation of reverse set inclusion makes 𝒪 a binary ramified tree. It turns out that the satisfiability problem of the logic is complete in NP.