This is a book on a highly specialist topic. None-the-less it is an important topic. There are many problems that require solutions governed by a set of logical statements (propositions). I believe that the general problem is classified as NP complete (the severest and most demanding kind of 'solved' mathematical problem whose general solutions cannot in general be computed in much less than the age of the universe).
New approaches such as neural networks are being used to tackle this kind of problem. This book describes an approach based on combinatorial decom- position. It is a first generation text. By this I mean that it is written by the original inventor/discoverer and is highly technical and largely theoretical.
The author is an expert in his field, but so was Einstein in his. If you have an interest in Propositional Calculus and would like to understand Dr Truemper's proposals this is about the only place to start. If you have the requisite skills, interests and experience I would be happy to let you have the review copy with the aim of providing an in depth review together with reasons why programmers might want to study this area.