The Automation of Syllogistic, Vol. 2 (Classic Reprint): Optimization and Complexity Issues: Optimization and Complexity Issues (Classic Reprint) - Tapa blanda

Sinopsis

This book introduces a series of mathematical formulas and techniques for evaluating set theories. These theories, called syllogistic schemes, are applicable to any finite collection of set variables, and easily demonstrate the satisfiability, or truth, of each. It has been shown that any formula can be broken down as a disjunction of syllogistic formulas. The initial part of this book focuses on refining the algorithm outlined above, while the second half explores complexity issues related to classes of set-theoretic formulas. The author proves that if a set of syllogistic schemes is non-empty, then it contains at least one minimum effort scheme, and that in order to check for satisfiability, only such schemes need to be sought. This search, though it involves backtracking, can be piloted quite effectively. This book will be of interest to mathematicians, logicians, and computer scientists.

"Sinopsis" puede pertenecer a otra edición de este libro.