Truemper K. Effective Logic Computation

Издательство Leibniz, 1998, -491 pp.The engineering advances of the second half of the 20th century have created an avalanche of new technology. Control and use of that technology require, among many things, effective computational methods for logic.
This book proposes one such method. It is based on a new theory of logic computation. Main features of the theory are an extension of propositional logic, an analysis of logic formulas via combinatorial structures, and a construction of logic solution algorithms based on that analysis.
The material of this book may be used as a blueprint for the design of logic programming software—for example, for expert system shells, for Prolog-type systems, or for systems similar to the Leibniz System. The book may also be used as the main text for a graduate course in computational logic. We have done so repeatedly with preliminary versionsBasic Concepts
Some Matroid Theory
System IB, Linear Algebra, and Matroids
Special Matrix Classes
Characterizations of Hidden Near Negativity
Boolean Closed Matrices
Closed Subregion Decomposition
Monotone Sum
Closed Sum
Augmented Sum
Linear Sum
Analysis Algorithm
Central and Semicentral Classes