Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Since 2002, FoLLI awards an annual prize for an outstanding dissertation in the fields of Logic, Language, and Information. This book is based on the Ph.D. thesis of Gabriele Puppis, who was the winner of the E.W. Beth dissertation award for 2007.

Puppis' thesis focuses on Logic and Computation and, more specifically, on automata-based decidability techniques for time granularity and on a new method for deciding Monadic Second Order theories of trees. The results presented represent a significant step towards a better understanding of the changes in granularity levels that humans make so easily in cognition of time, space, and other phenomena, whereas their logical and computational structure poses difficult conceptual and computational challenges.

Author(s): Gabriele Puppis (auth.)
Series: Lecture Notes in Computer Science 5955 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010

Language: English
Pages: 206
Tags: Artificial Intelligence (incl. Robotics); Logics and Meanings of Programs; Software Engineering; Mathematical Logic and Formal Languages; Programming Languages, Compilers, Interpreters; Algorithm Analysis and Problem Complexity

Front Matter....Pages -
Introduction....Pages 1-3
Word Automata and Time Granularities....Pages 5-88
Tree Automata and Logics....Pages 89-167
Summary....Pages 169-170
Back Matter....Pages -