Satisfiability Problem: Theory and Applications : DIMACS Workshop, March 11-13, 1996
Dingzhu Du, Jun Gu, Panos M. Pardalos
American Mathematical Soc., Jan 1, 1997 - Mathematics - 724 pages
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 applications of theoretical/algorithmic results to practical problems and presents practical examples for theoretical/algoritmic study. Major topics covered in the book include practical and industial 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.
What people are saying - Write a review
Relative size of certain polynomial time solvable subclasses of satisfiability
Complexity of hierarchically and 1dimensional periodically specified
Satisfiability of 3CNF formulas with small clausevariableratio
Propositional search efficiency and firstorder theorem proving
Branching rules for prepositional satisfiability test
Approximate solution of weighted MAXSAT problems using GRASP
Surrogate constraint analysisnew heuristics and learning schemes
A general stochastic approach to solving problems with hard and soft
Some fundamental properties of Boolean ring normal forms
The polynomial time decidability of simulation relations for finite state
A better upper bound for the unsatisfiability threshold
On the imbalance of distributions of solutions of CNFformulas and
Local search for channel assignment in cellular mobile networks
A GRASP clustering technique for circuit partitioning
Multispace search for satisfiability and NPhard problems
A branch and cut algorithm for MAXSAT and weighted MAXSAT
sciencedirect - Discrete Applied Mathematics : Worst-case study of ...
Quick Search: within. All Full-text Sources. Quick Search searches abstracts, titles, keywords, and authors. Click here for more ...
linkinghub.elsevier.com/ retrieve/ pii/ S0166218X02004043