论文信息 - The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees

The Complexity of Certain Modal Formulas on Binary Ramified Subset Trees

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 O of subsets of X such that the relation of reverse set inclusion makes O a binary ramified tree. It turns out that the satisfiability problem of the logic is complete in NP.

Bernhard Heinemann

[1] Klaus Weihrauch. A Foundation for Computable Analysis , 1997, SOFSEM.

[2] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[3] Ronald Fagin,et al. Reasoning about knowledge , 1995 .

[4] Bernhard Heinemann. Revisiting Knowledge and Time from a Topological Point of View , 1997, SCAI.

[5] Konstantinos Georgatos,et al. Reasoning about Knowledge on Computation Trees , 1994, JELIA.

[6] Joseph Y. Halpern,et al. A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[7] A. Nakamura,et al. On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

[8] Lawrence S. Moss,et al. Topological Reasoning and the Logic of Knowledge , 1996, Ann. Pure Appl. Log..

[9] Bernhard Heinemann,et al. Topological Nexttime Logic , 1996, Advances in Modal Logic.

[10] Bernhard Heinemann,et al. A Modal Logic for Reasoning about Knowledge and Time on Binary Subset Trees , 1997, ECSQARU-FAPR.