eBook PDF Download Digital Library
Author: Doug DeGroot
Publisher: Prentice Hall
Published: 1986
Total Pages: 584
ISBN-13:
DOWNLOAD EBOOK →Setting the stage; Unification and functional programming; Symmetric combinations; Programming with equality; Augmented unification; Semantic foundations.
Author: Christian Posthoff
Publisher: Springer Science & Business Media
Published: 2013-03-19
Total Pages: 410
ISBN-13: 1402029381
DOWNLOAD EBOOK →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.
Author: Hélène Kirchner
Publisher: Springer Science & Business Media
Published: 1992-08-19
Total Pages: 476
ISBN-13: 9783540558736
DOWNLOAD EBOOK →This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.
Author: Christian Prehofer
Publisher: Springer Science & Business Media
Published: 2012-12-06
Total Pages: 193
ISBN-13: 1461217784
DOWNLOAD EBOOK →This monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica tions, higher-order logic provides the necessary level of abstraction for con cise and natural formulations. The main assets of higher-order logic are quan tification over functions or predicates and its abstraction mechanism. These allow one to represent quantification in formulas and other variable-binding constructs. In this book, we focus on equational logic as a fundamental and natural concept in computer science and mathematics. We present calculi for equa tional reasoning modulo higher-order equations presented as rewrite rules. This is followed by a systematic development from general equational rea soning towards effective calculi for declarative programming in higher-order logic and A-calculus. This aims at integrating and generalizing declarative programming models such as functional and logic programming. In these two prominent declarative computation models we can view a program as a logical theory and a computation as a deduction.
Author: Bernd Steinbach
Publisher: Springer Science & Business Media
Published: 2009-01-29
Total Pages: 232
ISBN-13: 1402095953
DOWNLOAD EBOOK →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.
Author: Anind Dey
Publisher: Springer Science & Business Media
Published: 2005-06-24
Total Pages: 1392
ISBN-13: 9783540269243
DOWNLOAD EBOOK →This book constitutes the refereed proceedings of the 5th International and Interdisciplinary Conference on Modeling and Using Context, CONTEXT 2005, held in Paris, France in July 2005. The 42 revised full papers presented were carefully reviewed and selected from a total of 120 submissions. The papers presented deal with the interdisciplinary topic of modeling and using context from various points of view, ranging through cognitive science, formal logic, artifical intelligence, computational intelligence, philosophical and psychological aspects, and information processing. Highly general philosophical and theoretical issues are complemented by specific applications in various fields.
Author: Jan Grabowski
Publisher: Springer
Published: 2005-07-06
Total Pages: 277
ISBN-13: 3540460632
DOWNLOAD EBOOK →This volume contains the proceedings of the First International Workshop on Algebraic and Logic Programming held in Gaussig (German Democratic Republic) from November 14 to 18, 1988. The workshop was devoted to Algebraic Programming, in the sense of programming by algebraic specifications and rewrite rule systems, and Logic Programming, in the sense of Horn clause specifications and resolution systems. This includes combined algebraic/logic programming systems, mutual relations and mutual implementation of programming paradigms, completeness and efficiency considerations in both fields, as well as related topics.
Author: Andrzej Tarlecki
Publisher: Springer Science & Business Media
Published: 1991-08-07
Total Pages: 458
ISBN-13: 9783540543459
DOWNLOAD EBOOK →This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
Author: Stephane Kaplan
Publisher: Springer Science & Business Media
Published: 1991-08-07
Total Pages: 500
ISBN-13: 9783540543176
DOWNLOAD EBOOK →In recent years, extensions of rewriting techniques that go beyond the traditional untyped algebraic rewriting framework have been investigated and developed. Among these extensions, conditional and typed systems are particularly important, as are higher-order systems, graph rewriting systems, etc. The international CTRS (Conditional and Typed Rewriting Systems) workshops are intended to offer a forum for researchers on such extensions of rewriting techniques. This volume presents the proceedings of the second CTRS workshop, which contributed to discussion and evaluation of new directions of research. (The proceedings of the first CTRS workshop are in Lecture Notes in Computer Science, Vol. 308.) Several important directions for extensions of rewriting techniques were stressed, which are reflected in the organization of the chapters in this volume: - Theory of conditional and Horn clause systems, - Infinite terms, non-terminating systems, and termination, - Extension of Knuth-Bendix completion, - Combined systems, combined languages and modularity, - Architecture, compilers and parallel computation, - Basic frameworks for typed and order-sorted systems, - Extension of unification and narrowing techniques.
Author: Steffen Hölldobler
Publisher: Lecture Notes in Artificial Intelligence
Published: 1989
Total Pages: 268
ISBN-13:
DOWNLOAD EBOOK →Equations play a vital role in many fields of mathematics, computer science, and artificial intelligence. Therefore, many proposals have been made to integrate equational, functional, and logic programming. This book presents the foundations of equational logic programming. After generalizing logic programming by augmenting programs with a conditional equational theory, the author defines a unifying framework for logic programming, equation solving, universal unification, and term rewriting. Within this framework many known results are developed. In particular, a presentation of the least model and the fixpoint semantics of equational logic programs is followed by a rigorous proof of the soundness and the strong completeness of various proof techniques: SLDE-resolution, where a universal unification procedure replaces the traditional unification algorithm; linear paramodulation and special forms of it such as rewriting and narrowing; complete sets of transformations for conditional equational theories; and lazy resolution combined with any complete set of inference rules for conditional equational theories.
