Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Problems of Reducing the Exhaustive Search
 
Edited by: V. Kreinovich University of Texas at El Paso, El Paso, TX
G. Mints Stanford University
Problems of Reducing the Exhaustive Search
eBook ISBN:  978-1-4704-3389-5
Product Code:  TRANS2/178.E
List Price: $165.00
MAA Member Price: $148.50
AMS Member Price: $132.00
Problems of Reducing the Exhaustive Search
Click above image for expanded view
Problems of Reducing the Exhaustive Search
Edited by: V. Kreinovich University of Texas at El Paso, El Paso, TX
G. Mints Stanford University
eBook ISBN:  978-1-4704-3389-5
Product Code:  TRANS2/178.E
List Price: $165.00
MAA Member Price: $148.50
AMS Member Price: $132.00
  • Book Details
     
     
    American Mathematical Society Translations - Series 2
    Volume: 1781997; 189 pp
    MSC: Primary 68; Secondary 03

    This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in Problemy 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 inverse method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robinson 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 proposititional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role.

    Readership

    Graduate students and research mathematicians working in mathematical logic, theory of algorithms, and in related areas of computer science.

  • Table of Contents
     
     
    • Chapters
    • R. I. Freidzon — Algorithmics of $NP$-hard problems
    • E. Ya. Dantsin — Algorithmics of propositional satisfiability problems
    • V. Ya. Kreinovich — Semantics of S. Yu. Maslov’s iterative method
    • M. I. Zakharevich — Ergodic properties of Maslov’s iterative method
    • I. V. Melichev — Anomalous properties of Maslov’s iterative method
    • Yu. V. Matiyasevich — Possible nontraditional methods of establishing unsatisfiability of propositional formulas
    • G. V. Davydov and I. M. Davydova — Dual algorithms in discrete optimization
    • A. Ya. Dikovsky — Models, methods, and modes for the synthesis of program schemes
    • M. I. Kanovich — Effective calculi as a technique for search reduction
    • N. K. Kossovskiĭ — Lower bounds of combinatorial complexity for exponential search reduction
    • An. A. Muchnik — On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them
    • V. Kreinovich — S. Maslov’s iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Volume: 1781997; 189 pp
MSC: Primary 68; Secondary 03

This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in Problemy 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 inverse method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robinson 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 proposititional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role.

Readership

Graduate students and research mathematicians working in mathematical logic, theory of algorithms, and in related areas of computer science.

  • Chapters
  • R. I. Freidzon — Algorithmics of $NP$-hard problems
  • E. Ya. Dantsin — Algorithmics of propositional satisfiability problems
  • V. Ya. Kreinovich — Semantics of S. Yu. Maslov’s iterative method
  • M. I. Zakharevich — Ergodic properties of Maslov’s iterative method
  • I. V. Melichev — Anomalous properties of Maslov’s iterative method
  • Yu. V. Matiyasevich — Possible nontraditional methods of establishing unsatisfiability of propositional formulas
  • G. V. Davydov and I. M. Davydova — Dual algorithms in discrete optimization
  • A. Ya. Dikovsky — Models, methods, and modes for the synthesis of program schemes
  • M. I. Kanovich — Effective calculi as a technique for search reduction
  • N. K. Kossovskiĭ — Lower bounds of combinatorial complexity for exponential search reduction
  • An. A. Muchnik — On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them
  • V. Kreinovich — S. Maslov’s iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.