Overview

This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in roblemy Sokrashcheniya Perebora, published in Russian in 1987 by the Scientific Council ""Cybernetics"" of the USSR Academy of Sciences. The problems form the nucleus of this intensively developing area. This translation is dedicated to the memory of two remarkable Russian mathematicians, Sergei Maslov and his wife Nina Maslova. Maslov is known as the originator of the universe method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robison and has approximately the same range of applications. In 1981, Maslov proposed an iterative algorithm for propositional satisfiability based on some general ideas of search described in detail in his posthumously published book, Theory of Deductive Systems and Its Applications (1986; English 1987). This collection contains translations of papers on propositional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role.

Full Product Details

Author:   American Mathematical Society ,  G. Mints
Publisher:   American Mathematical Society
Imprint:   American Mathematical Society
Volume:   No. 178
Weight:   0.567kg
ISBN:  

9780821803868

ISBN 10:   0821803867
Pages:   190
Publication Date:   30 November 1996
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print  
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Algorithmics of $NP$-hard problems by R. I. Freidzon Algorithmics of propositional satisfiability problems by E. Ya. Dantsin Semantics of S. Yu. Maslov's iterative method by V. Ya. Kreinovich Ergodic properties of Maslov's iterative method by M. I. Zakharevich Anomalous properties of Maslov's iterative method by I. V. Melichev Possible nontraditional methods of establishing unsatisfiability of propositional formulas by Yu. V. Matiyasevich Dual algorithms in discrete optimization by G. V. Davydov and I. M. Davydova Models, methods, and modes for the synthesis of program schemes by A. Ya. Dikovsky Effective calculi as a technique for search reduction by M. I. Kanovich Lower bounds of combinatorial complexity for exponential search reduction by N. K. Kossovskii On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them by An. A. Muchnik S. Maslov's iterative method: 15 years later (freedom of choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing) by V. Kreinovich.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions