Satisfiability and Model Checking in Team Based Logics
-
- Taschenbuch
- eBook ausgewählt
-
Form:Einzelkauf Download
-
Sprache:Englisch
21,10 €
inkl. gesetzl. MwSt.Beschreibung
Produktdetails
Format
Kopierschutz
Nein
Family Sharing
Ja
Text-to-Speech
Nein
Erscheinungsdatum
01.08.2014
Verlag
Cuvillier Verlag eBooksSeitenzahl
148 (Printausgabe)
Dateigröße
865 KB
Sprache
Englisch
EAN
9783736947597
Dependence and independence between properties is occurring in many different scientific disciplines, for example in the description of discrete systems or during the evaluation of physical experiments. During this thesis we will study a variety of team based logics, which can express some form of dependence or independence.
The concept of expressing functional dependencies between terms by atomic FO-formulae was introduced by Väänänen in 2007. He showed that dependence logic is equally expressive as existential second order logic and thus dependence logic characterises NP. In the first chapter of this thesis we are obtaining a Horn fragment of dependence logic which characterises P.
In the second part of this thesis we will study the concept of dependence and independence in the context of team based modal logics. We will study several decision problems for these modal logics, like satisfiability and model checking. Furthermore we will investigate the expressive power of these modal logics. Finally we will give a general notion of team atoms and the properties that they are describing.
The concept of expressing functional dependencies between terms by atomic FO-formulae was introduced by Väänänen in 2007. He showed that dependence logic is equally expressive as existential second order logic and thus dependence logic characterises NP. In the first chapter of this thesis we are obtaining a Horn fragment of dependence logic which characterises P.
In the second part of this thesis we will study the concept of dependence and independence in the context of team based modal logics. We will study several decision problems for these modal logics, like satisfiability and model checking. Furthermore we will investigate the expressive power of these modal logics. Finally we will give a general notion of team atoms and the properties that they are describing.
Kundinnen und Kunden meinen
Verfassen Sie die erste Bewertung zu diesem Artikel
Helfen Sie anderen Kund*innen durch Ihre Meinung
Kurze Frage zu unserer Seite
Vielen Dank für Ihr Feedback
Wir nutzen Ihr Feedback, um unsere Produktseiten zu verbessern. Bitte haben Sie Verständnis, dass wir Ihnen keine Rückmeldung geben können. Falls Sie Kontakt mit uns aufnehmen möchten, können Sie sich aber gerne an unseren Kund*innenservice wenden.
zum Kundenservice