Satisfiability problem : theory and applications : DIMACS workshop, March 11-13, 1996
著者
書誌事項
Satisfiability problem : theory and applications : DIMACS workshop, March 11-13, 1996
（DIMACS series in discrete mathematics and theoretical computer science, v. 35）
American Mathematical Society, 1997
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
"NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science. A consortium of Rutgers University, Princeton University, AT&T Labs, Bell Labs, and Bellcore."
Includes bibliographical references
内容説明・目次
内容説明
The satisfiability (SAT) problem is central in mathematical logic, computing theory, and many industrial applications. There has been a strong relationship between the theory, the algorithms, and the applications of the SAT problem. This book aims to bring together work by the best theorists, algorithmists, and practitioners working on the SAT problem and on industrial applications, as well as to enhance the interaction between the three research groups. The book features the application of theoretical/algorithmic results to practical problems and presents practical problems for theoretical/algorithmic study.Major topics covered in the book include practical and industrial SAT problems and benchmarks, significant case studies and applications of the SAT problem and SAT algorithms, new algorithms and improved techniques for satisfiability testing, specific data structures and implementation details of the SAT algorithms, and the theoretical study of the SAT problem and SAT algorithms. It features: a comprehensive review of SAT research work over the past 25 years; the most recent research results; and a spectrum of algorithmic issues and applications.
目次
Finding hard instances of the satisfiability problem: A survey by S. A. Cook and D. G. Mitchell Algorithms for the satisfiability (SAT) problem: A survey by J. Gu, P. W. Purdom, J. Franco, and B. W. Wah Backtracking and probing by P. W. Purdom and G. N. Haven Relative size of certain polynomial time solvable subclasses of satisfiability by J. Franco Complexity of hierarchically and 1-dimensional periodically specified problems. I: Hardness results by M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan Worst-case analysis, 3-SAT decision, and lower bounds: Approaches for improved SAT algorithms by O. Kullmann Satisfiability of 3CNF formulas with small clause/variable-ratio by K. Iwama and K. Takaki Propositional search efficiency and first-order theorem proving by D. A. Plaisted and G. D. Alexander Branching rules for propositional satisfiability test by J. Wang A discrete Lagrangian-based global-search method for solving satisfiability problems by B. W. Wah and Y. Shang Approximate solution of weighted MAX-SAT problems using GRASP by M. G. C. Resende, L. S. Pitsoulis, and P. M. Pardalos Multispace search for satisfiability and NP-hard problems by J. Gu A branch and cut algorithm for MAX-SAT and weighted MAX-SAT by S. Joy, J. Mitchell, and B. Borchers Surrogate constraint analysis--new heuristics and learning schemes for satisfiability problems by A. Lokketangen and F. Glover A general stochastic approach to solving problems with hard and soft constraints by H. Kautz, B. Selman, and Y. Jiang Some fundamental properties of Boolean ring normal forms by J. Hsiang and G. S. Huang The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach by S. K. Shukla, D. J. Rosenkrantz, H. B. Hunt, and R. E. Stearns A better upper bound for the unsatisfiability threshold by L. M. Kirousis, E. Kranakis, and D. Krizanc Solving MAX-SAT with non-oblivious functions and history-based heuristics by R. Battiti and M. Protasi On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers by E. Speckenmeyer, M. Bohm, and P. Heusch On the use of second order derivatives for the satisfiability problem by H. van Maaren Local search for channel assignment in cellular mobile networks by C. K. Rushforth and W. Wang A GRASP clustering technique for circuit partitioning by S. Areibi and A. Vannelli.
「Nielsen BookData」 より
