Christian Posthoff - Böcker

Logic functions and equations are (some of) the most important concepts of Computer Science with many applications such as Binary Arithmetics, Coding, Complexity, Logic Design, Programming, Computer Architecture and Artificial Intelligence. They are very often studied in a minimum way prior to or together with their respective applications. Based on our long-time teaching experience, a comprehensive presentation of these concepts is given, especially emphasising a thorough understanding as well as numerical and computer-based solution methods. Any applications and examples from all the respective areas are given that can be dealt with in a unified way. They offer a broad understanding of the recent developments in Computer Science and are directly applicable in professional life.Logic Functions and Equations is highly recommended for a one- or two-semester course in many Computer Science or computer Science-oriented programmes. It allows students an easy high-level access to these methods and enables sophisticated applications in many different areas. It elegantly bridges the gap between Mathematics and the required theoretical foundations of Computer Science.

Tsutomu Sasao – Kyushu Institute of Technology, Japan The material covered in this book is quite unique especially for p- ple who are reading English, since such material is quite hard to ?nd in the U.S. literature. German and Russian people have independently developed their theories, but such work is not well known in the U.S. societies. On the other hand, the theories developed in the U.S. are not conveyed to the other places. Thus, the same theory is re-invented or re-discovered in various places. For example, the switching theory was developed independently in the U.S., Europe, and Japan, almost at the same time [4, 18, 19]. Thus, the same notions are represented by di?- ent terminologies. For example, the Shegalkin polynomial is often called complement-free ring-sum, Reed-Muller expression [10], or Positive - larityReed-Mullerexpression [19].Anyway,itisquitedesirablethatsuch a unique book like this is written in English, and many people can read it without any di?culties. The authors have developed a logic system called XBOOLE.Itp- forms logical operations on the given functions. With XBOOLE, the readers can solve the problems given in the book. Many examples and complete solutions to the problems are shown, so the readers can study at home. I believe that the book containing many exercises and their solutions [9] is quite useful not only for the students, but also the p- fessors.

The greatly expanded and updated 3rd edition of this textbook offers the reader a comprehensive introduction to the concepts of logic functions and equations and their applications across computer science and engineering. The authors’ approach emphasizes a thorough understanding of the fundamental principles as well as numerical and computer-based solution methods. The book provides insight into applications across propositional logic, binary arithmetic, coding, cryptography, complexity, logic design, and artificial intelligence.Updated throughout, some major additions for the 3rd edition include:a new chapter about the concepts contributing to the power of XBOOLE;a new chapter that introduces into the application of the XBOOLE-Monitor XBM 2;many tasks that support the readers in amplifying the learned content at the end of the chapters;solutions of a large subset of these tasks to confirm learning success;challenging tasks that need the power of the XBOOLE software for their solution.The XBOOLE-monitor XBM 2 software is used to solve the exercises; in this way the time-consuming and error-prone manipulation on the bit level is moved to an ordinary PC, more realistic tasks can be solved, and the challenges of thinking about algorithms leads to a higher level of education.

The greatly expanded and updated 3rd edition of this textbook offers the reader a comprehensive introduction to the concepts of logic functions and equations and their applications across computer science and engineering. The authors’ approach emphasizes a thorough understanding of the fundamental principles as well as numerical and computer-based solution methods. The book provides insight into applications across propositional logic, binary arithmetic, coding, cryptography, complexity, logic design, and artificial intelligence.Updated throughout, some major additions for the 3rd edition include:a new chapter about the concepts contributing to the power of XBOOLE;a new chapter that introduces into the application of the XBOOLE-Monitor XBM 2;many tasks that support the readers in amplifying the learned content at the end of the chapters;solutions of a large subset of these tasks to confirm learning success;challenging tasks that need the power of the XBOOLE software for their solution.The XBOOLE-monitor XBM 2 software is used to solve the exercises; in this way the time-consuming and error-prone manipulation on the bit level is moved to an ordinary PC, more realistic tasks can be solved, and the challenges of thinking about algorithms leads to a higher level of education.

This book demystifies the topic of Artificial Intelligence for readers of varying backgrounds. The content should enable many people to discuss and follow ongoing developments in an informed way, to draw conclusions for their own life and workplace and to acquire the necessary new knowledge.

The Boolean Differential Calculus (BDC) is a very powerful theory that extends the structure of a Boolean Algebra significantly. While a Boolean Algebra is focused on values of logic functions, the BDC allows the evaluation of changes of function values.

The Boolean Differential Calculus (BDC) is a very powerful theory that extends the basic concepts of Boolean Algebras significantly.Its applications are based on Boolean spaces ���� and ����ⁿ, Boolean operations, and basic structures such as Boolean Algebras and Boolean Rings, Boolean functions, Boolean equations, Boolean inequalities, incompletely specified Boolean functions, and Boolean lattices of Boolean functions. These basics, sometimes also called switching theory, are widely used in many modern information processing applications.The BDC extends the known concepts and allows the consideration of changes of function values. Such changes can be explored for pairs of function values as well as for whole subspaces. The BDC defines a small number of derivative and differential operations. Many existing theorems are very welcome and allow new insights due to possible transformations of problems. The available operations of the BDC have been efficiently implemented in several software packages.The common use of the basic concepts and the BDC opens a very wide field of applications. The roots of the BDC go back to the practical problem of testing digital circuits. The BDC deals with changes of signals which are very important in applications of the analysis and the synthesis of digital circuits. The comprehensive evaluation and utilization of properties of Boolean functions allow, for instance, to decompose Boolean functions very efficiently; this can be applied not only in circuit design, but also in data mining. Other examples for the use of the BDC are the detection of hazards or cryptography. The knowledge of the BDC gives the scientists and engineers an extended insight into Boolean problems leading to new applications, e.g., the use of Boolean lattices of Boolean functions.