Abstract

A powerful new approach to solving propositional logic problems in the design of expert systems Effective Logic Computation describes breakthrough mathematical methods for computation in propositional logic. Offering a highly robust and versatile alternative to the production rule- or neural net-based approaches commonly used in the design of expert systems, Dr. Truemper’s combinatorial decomposition-based approach has produced a compiler that uniquely yields solution algorithms for both logic satisfiability problems and logic minimization problems. Also unique to the compiler is computation of a performance guarantee for each solution algorithm. Effective Logic Computation provides detailed algorithms for all steps carried out by the compiler. Much of the mathematics described in this book has been implemented in the Leibniz System, a commercially available software system for logic programming and a leading tool for building expert systems. This book’s companion volume, Design of Intelligent Computer Systems, is in preparation and will offer detailed coverage of software implementation and use, including a complete version of the Leibniz System. Effective Logic Computation is an indispensable working resource for computer scientists and applied mathematicians involved in the design of logic programming software, researchers in artificial intelligence, and operations researchers.