Editorial Cuvillier

Publicaciones, tesis doctorales, capacitaciónes para acceder a una cátedra de universidad & prospectos.
Su editorial internacional especializado en ciencias y economia

Editorial Cuvillier

De En Es
On the Complexity of Modal Logic Variants and their Fragments

Impresion
EUR 24,35 EUR 23,13

E-Book
EUR 17,05

On the Complexity of Modal Logic Variants and their Fragments (Tienda española)

Arne Meier (Autor)

Previo

Indice, Datei (44 KB)
Lectura de prueba, Datei (100 KB)

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.

ISBN-10 (Impresion) 3869559292
ISBN-13 (Impresion) 9783869559292
ISBN-13 (E-Book) 9783736939295
Idioma Inglés
Numero de paginas 148
Laminacion de la cubierta mate
Edicion 1 Aufl.
Volumen 0
Lugar de publicacion Göttingen
Lugar de la disertacion Hannover
Fecha de publicacion 15.11.2011
Clasificacion simple Tesis doctoral
Area Informática
Palabras claves Beschreibungslogik, Komplexität, Modale Logik, Post'scher Verband, Temporale Logik.