Wyniki wyszukiwania - Biblioteka Nauki

Ten serwis zostanie wyłączony 2025-02-11.

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Fundamenta Informaticae

2 2007

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: information logic

Sortuj według:

Ogranicz wyniki do:

Relative Nondeterministic Information Logic is EXPTIME-complete

100%

Demri S. , Orłowska E.

tom Vol. 75, nr 1-4

163-178

We define a relative version of the logic NIL introduced by Or owska, Pawlak and Vakarelov and we show that its satisfiability is not only decidable but also EXPTIME-complete. Such a logic combines two ingredients that are seldom present simultaneously in information logics: frame conditions involving more than one information relation and relative frames. The EXPTIMEupper bound is obtained by designing a well-suited decision procedure based on the nonemptiness problem of Büchi automata on infinite trees. The paper provides evidence that Büchi automata on infinite trees are crucial language acceptors even for relative information logics with multiple types of relations.

Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems

100%

Balbiani P. , Vakarelov D.

tom Vol. 75, nr 1-4

1-25

We dedicate this paper to the memory of Zdislaw Pawlak, the founder of rough sets methodology in computer science. A great deal of our scientific work was motivated and influenced by Pawlak's ideas.