**Rule-based Computation and Deduction**

by Helene Kirchner, Pierre-Etienne Moreau

**Publisher**: ESSLLI 2001**Number of pages**: 100

**Description**:

This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.

Download or read it online for free here:

**Download link**

(870KB, PDF)

## Similar books

**Introduction to Theory of Computation**

by

**Anil Maheshwari, Michiel Smid**-

**Carleton University**

This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.

(

**3397**views)

**Cellular Automata And Complexity: Collected Papers**

by

**Stephen Wolfram**-

**Westview Press**

These original papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for computer science, physics, economics, biology, and many other areas.

(

**8502**views)

**Galois Connections and Fixed Point Calculus**

by

**Roland Backhouse**

The book on the fundamental algebraic structures in the mathematics of program construction focusing the algebraic properties of recursion and how these are applied to the generic solution of programming problems. The tutorial covers fixed point calculus.

(

**8518**views)

**Logic and Proof**

by

**Lawrence C Paulson**-

**University of Cambridge**

These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems.

(

**8995**views)