Computational Logic

Although a number of recent technological applications require classical deductive computation with non-classical logics, many key technologies still do well--or exclusively, for that matter--with classical logic. In this first of a two-volume work, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing--a.k.a. formal languages and automata theory--and classical deduction with the classical first-order predicate calculus with a view to computational implementations, namely in automated theorem proving and logic programming.

As a complement to the mathematical-based exposition of the topics we offer the reader a very large selection of exercises. This selection aims at not only practice of discussed material, but also creative approaches to problems, for both discussed and novel contents, as well as at research into further relevant topics.

The present second edition improves on the first by correcting a number of addenda and errata, as well as by adding new exercises. But the major improvement is the addition of a wholly new chapter on Datalog, thus providing a highly relevant expansion on logic programming, which in the first edition was limited to Prolog.