Satisfiability Problem: Theory and Applications : DIMACS Workshop, March 11-13, 1996Dingzhu Du, Jun Gu, Panos M. Pardalos American Mathematical Soc., 1997. gada 1. janv. - 724 lappuses 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. |
Saturs
| 11 | |
| 19 | |
| 29 | |
Relative size of certain polynomial time solvable subclasses of satisfiability | 211 |
Complexity of hierarchically and 1dimensional periodically specified | 225 |
Approaches | 261 |
Satisfiability of 3CNF formulas with small clausevariableratio | 293 |
Propositional search efficiency and firstorder theorem proving | 332 |
Multispace search for satisfiability and NPhard problems | 407 |
A branch and cut algorithm for MAXSAT and weighted MAXSAT | 519 |
Surrogate constraint analysisnew heuristics and learning schemes | 537 |
A general stochastic approach to solving problems with hard and soft | 573 |
Some fundamental properties of Boolean ring normal forms | 587 |
The polynomial time decidability of simulation relations for finite state | 603 |
A better upper bound for the unsatisfiability threshold | 643 |
On the imbalance of distributions of solutions of CNFformulas and | 669 |
Branching rules for propositional satisfiability test | 351 |
A discrete Lagrangianbased globalsearch method for solving satisfiability | 365 |
Approximate solution of weighted MAXSAT problems using GRASP | 393 |
Local search for channel assignment in cellular mobile networks | 689 |
A GRASP clustering technique for circuit partitioning | 711 |
Citi izdevumi - Skatīt visu
Satisfiability Problem: Theory and Applications : DIMACS Workshop, March 11 ... Dingzhu Du,Jun Gu,Panos M. Pardalos Ierobežota priekšskatīšana - 1997 |
Satisfiability Problem: Theory and Application ; DIMACS Workshop, March, 11 ... Priekšskatījums nav pieejams - 1997 |
Bieži izmantoti vārdi un frāzes
2-clauses analysis applied approach Artificial Intelligence asynchronous circuit benchmark binary bisimulation Boolean function Boolean ring branching channel assignment CNF formula complexity CPLEX defined denoted DIMACS discrete efficient equivalence example exponential Figure flip global optimization graph GSAT heuristic IEEE Trans implementation improved initial input iterations Lagrangian Lemma linear literal local minima logic Mathematics MAX-SAT methods minimal minimum multispace search n-queen problem NHORNSAT NP-complete number of clauses number of nodes objective function obtained optimization algorithms optimization problems parallel parameter partitioning performance polynomial Probe Order Backtracking problem instances Proc procedure proof PSPACE-hardness random formula reduction resolution SAT algorithms SAT formula SAT problem satisfiability problem satisfiability SAT satisfying assignment scheduling search algorithm search space Section selected simulated annealing simulation solution specified strategy structure surrogate constraint tabu search techniques testing theorem Theoretical Computer Science tree truth assignment unsatisfied clauses update variables
Populāri fragmenti
469. lappuse - O(e + np), where e is the number of edges, n is the number of nodes, and p is the number of PEs.
131. lappuse - JS Sargent, Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors, IEEE Transactions on Parallel and Distributed Systems 1 (1) (1990) 91-106.
13. lappuse - Northeast Hazardous Substance Research Center, as well as the Hazardous Substance Management Research Center, which is jointly sponsored by the National Science Foundation and the New Jersey Commission on Science and Technology, both headquartered at NJIT. He is a Fellow of the ASME and a Diplomate of the American Academy of Environmental Engineers. Dr. Magee ' s research expertise is in combustion, with major interest in the incineration of municipal and industrial wastes.
255. lappuse - Department of Computer Science University at Albany - State University of New York Albany, NY 12222 Email: {eandeep, hunt, djr}Ccs.
150. lappuse - Multiprocessing of Combinatorial Search Problems,
508. lappuse - B. Selman. H. Kautz. and B. Cohen, Noise strategies for improving local search.