On the Complexity of Modal Logic Variants and their Fragments / Libristo.pl
On the Complexity of Modal Logic Variants and their Fragments

Kod: 13414783

On the Complexity of Modal Logic Variants and their Fragments

Autor Arne Meier

The automatic verification of computer programs is an important step in software engineering. In this regard temporal logics have been invented as an extension of modal logic which itself is an extension of propositional logic. Th ... więcej

106.01

Zwykle: 111.66 zł

Oszczędzasz 5.65 zł


Dostępna u dostawcy
Wysyłamy za 5 - 7 dni
Dodaj do schowka

Zobacz książki o podobnej tematyce

Podaruj tę książkę jeszcze dziś
  1. Zamów książkę i wybierz "Wyślij jako prezent".
  2. Natychmiast wyślemy Ci bon podarunkowy, który możesz przekazać adresatowi prezentu.
  3. Książka zostanie wysłana do adresata, a Ty o nic nie musisz się martwić.

Dowiedz się więcej

Więcej informacji o On the Complexity of Modal Logic Variants and their Fragments

Za ten zakup dostaniesz 62 punkty

Opis

The automatic verification of computer programs is an important step in software engineering. In this regard temporal logics have been invented as an extension of modal logic which itself is an extension of propositional logic. Therefore, one may call them \emph{modal logic variants}. The first part of this thesis will investigate the two temporal logics CTL and CTL* with respect to their model-checking and satisfiability problem. We will analyze the complexity of fragments of these problems by means of operator and Boolean function restrictions. There we will see for the satisfiability problem, how the operator fragments form a trichotomy and the Boolean fragments form a quartering. The model-checking problem for CTL is divided into three types: monotone, atomic negation, and positive fragments. Surprisingly, we will see that these three fragments are computationally equivalent. Furthermore, several prominent extensions of CTL will be visited and classified with respect to their Boolean and operator fragments.In the second part we will concentrate on description logics which are modal logic extensions settled in the area of semantic web, databases, and artificial intelligence. These types of logics are used to express, and work on, large sets of data. Besides the usual satisfiability problems, we will work with some special kind of implication problem, which is called subsumption. We will see that these logics combine two very strong Boolean concepts, namely implication and conjunction, such that restricting large sets of Boolean functions do not reduce the complexity of the problems significantly.

Szczegóły książki

106.01

Ulubione w innej kategorii


250 000
zadowolonych klientów

Od roku 2008 obsłużyliśmy wielu miłośników książek, ale dla nas każdy był tym wyjątkowym.


Paczkomat 12,99 ZŁ 31975 punktów

Copyright! ©2008-24 libristo.pl Wszelkie prawa zastrzeżonePrywatnieCookies


Konto: Logowanie
Wszystkie książki świata w jednym miejscu. I co więcej w super cenach.

Koszyk ( pusty )

Kup za 299 zł i
zyskaj darmową dostawę.

Twoja lokalizacja: