Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: modal logic of subset spaces

Sortuj według:

Ogranicz wyniki do:

The complexity of certain modal formulas on binary ramified subset trees

Heinemann B.

Fundamenta Informaticae

1999

Vol. 39, Nr 3

259-272

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.