Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"Berechnungskomplexität"”.
-
System verification tools based on Monadic Logics
… für diese Logiken eine sehr hohe Berechnungskomplexität; oft brechen die oben genannten Werkzeuge ihre Berechnung aus Mangel an Speicherressourcen ab.<br>Die vorliegende Arbeit stellt mehrere Verfahren vor, die die erwähnten Nachteile überwinden und machen somit die monadischen …
-
The complexity of description logics with concrete domains
Concrete domains are an extension of Description Logics (DLs) that allows to integrate reasoning about conceptual knowledge with reasoning about "concrete qualities" of real world entities such as their age, weight, shape, and temporal extension. In this thesis, we perform an in-depth analysis of …
-
On the complexity of equilibria in games with succinct representation
Algorithmic game theory studies computational and algorithmic questions arising from the behavior of players in strategic situations. The computational aspects of game theory became subject to closer scrutiny in the last two decades. One reason for this is certainly the advent of large scale …
-
Complexity results and practical algorithms for logics in knowledge representation
Description Logics (DLs) are used in knowledge-based systems to represent and reason about terminological knowledge of the application domain in a semantically well-defined manner. In this thesis, we establish a number of novel complexity results and give practical algorithms for expressive DLs …
-
Games on pushdown graphs and extensions
Two player games are a standard model of reactive computation, where e.g. one player is the controller and the other is the environment. A game is won by a player if she has a winning strategy, ie, if she can win every play. Given a finite description of the game, our aim is to compute the winner …