This book presents an overview of the most fundamental aspects of the theory that underlies the Relational Database Model. As such it is self-contained though experience with formal models and abstract data manipulating on the one hand and with the practical use of a relational system on the other hand can help the reader. Such experience will offer the reader a better understanding of and a motivation for the different concepts, theories and results mentioned in the book. We have focussed on the most basic concepts and aspects of the relational model, without trying to give a complete...
This book presents an overview of the most fundamental aspects of the theory that underlies the Relational Database Model. As such it is self-containe...
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of the methods and results of universal algebra that are useful in a variety of applications in computer science. The notation is simple and the concepts are clearly presented. The book concerns the algebraic characterization of axiomatic classes of algebras (equational, implicational, and universal Horn classes) by closure operators generalizing the famous Birkhoff Variety Theorem, and the algebraic characterization of the related theories. The...
A new model-theoretic approach to universal algebra is offered in this book. Written for computer scientists, it presents a systematic development of ...
Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion generalizes standard convexity and several types of nontraditional convexity. We explore the properties of this generalized convexity in multidimensional Euclidean space, describes restricted-orientation analogs of lines, hyperplanes, flats, and halfspaces, and identify major properties of standard convex sets that also hold for restricted-orientation convexity. We then introduce the notion of strong restricted-orientation convexity, which is an...
Restricted-orientation convexity is the study of geometric objects whose intersections with lines from some fixed set are connected. This notion ge...
This work presents a purely classical first-order logical approach to the field of study in theoretical computer science sometimes referred to as the theory of programs, or programming theory. This field essentially attempts to provide a precise mathematical basis for the common activities involved in reasoning about computer programs and programming languages, and it also attempts to find practical applications in the areas of program specification, verification and programming language design. Many different approaches with different mathematical frameworks have been proposed as a basis for...
This work presents a purely classical first-order logical approach to the field of study in theoretical computer science sometimes referred to as the ...
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and this...
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, con...
The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming languages created a need for a general and theoretically dean methodology for writing compilers for these languages. It was perceived that the compilation process had to be "syntax-directed," that is, the functioning of a programming language compiler had to be defined completely by the underlying formal syntax of the language. A program text to be compiled is "parsed" according to the syntax of the language, and the object code for the program...
The theory of parsing is an important application area of the theory of formal languages and automata. The evolution of modem high-level programming l...
This book is a comprehensive explanation of graph and model transformation. After a detailed introduction, including references to the historical context, the book includes detailed chapters on adhesive and M-adhesive categories, M-adhesive transformation systems, and multi-amalgamated transformations, and model transformation based on triple graph grammars. In the final part of the book the authors examine application of the techniques in various domains, including chapters on case studies and tool support.
The book will be of interest to researchers in the areas of theoretical...
This book is a comprehensive explanation of graph and model transformation. After a detailed introduction, including references to the historical c...
This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search procedures to specific problems in distributed computing, bioinformatics and computational learning.
This book examines approaches to fault-tolerance in the context of algorithmic search theory. It details the application of fault-tolerant search proc...
This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted model for distributed systems.
This book deals with the problem of finding suitable languages that can represent specific classes of Petri nets, the most studied and widely accepted...
