On the Complexity of Modal Logic Variants and their Fragments - Couverture souple

Meier, Arne

9783869559292: On the Complexity of Modal Logic Variants and their Fragments

Couverture souple

ISBN 10 : 3869559292 ISBN 13 : 9783869559292

Editeur : Cuvillier Verlag, 2011

Afficher les exemplaires de cette �dition comportant l'ISBN

0 D'occasion

5 Neuf

De EUR 24,35

D�tails de l'�dition

�diteur: Cuvillier Verlag
Date d'�dition: 2011
Langue: anglais
ISBN 10: 3869559292
ISBN 13: 9783869559292
Reliure: Broch�
Nombre de pages: 148
Coordonn�es du fabricant: info@cuvillier.de
info@cuvillier.de

Nonnenstieg 8
G�ttingen
37075
Allemagne

R�sultats de recherche pour On the Complexity of Modal Logic Variants and their...

Image fournie par le vendeur

On the Complexity of Modal Logic Variants and their Fragments

Arne Meier

Edit� par Cuvillier Nov 2011, 2011

ISBN 10 : 3869559292 ISBN 13 : 9783869559292

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 148 pp. Englisch. N� de r�f. du vendeur 9783869559292

Contacter le vendeur

Acheter neuf

EUR 24,35

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

On the Complexity of Modal Logic Variants and their Fragments

Arne Meier

Edit� par Cuvillier

ISBN 10 : 3869559292 ISBN 13 : 9783869559292

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N� de r�f. du vendeur 9783869559292

Contacter le vendeur

Acheter neuf

EUR 24,35

Exp�dition �EUR 35
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

On the Complexity of Modal Logic Variants and their Fragments

Meier, Arne

Edit� par Cuvillier Verlag, 2011

ISBN 10 : 3869559292 ISBN 13 : 9783869559292

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. KlappentextrnrnThe 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. N� de r�f. du vendeur 145153028

Contacter le vendeur

Acheter neuf

EUR 24,35

Exp�dition �EUR 48,99
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

On the Complexity of Modal Logic Variants and their Fragments

Arne Meier

Edit� par Cuvillier, Cuvillier Nov 2011, 2011

ISBN 10 : 3869559292 ISBN 13 : 9783869559292

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Cuvillier Verlag, Nonnenstieg 8, 37075 G�ttingen 148 pp. Englisch. N� de r�f. du vendeur 9783869559292

Contacter le vendeur