Skip to content

Searching for Optimization Through Satisfiability

Spend $50 to get a free movie!

ISBN-10: 383830327X

ISBN-13: 9783838303277

Edition: N/A

Authors: Zhao Xing

List price: $114.00
Blue ribbon 30 day, 100% satisfaction guarantee!
Out of stock
We're sorry. This item is currently unavailable.
what's this?
Rush Rewards U
Members Receive:
Carrot Coin icon
XP icon
You have reached 400 XP and carrot coins. That is the daily max!


This book studies two optimization problems, maximum satisfiability and planing of satisfiability. The maximum satisfiability problem (max-SAT) is the optimization counterpart of the satisfiability problem (SAT). The goal of max-SAT is to maximize the number of clauses satisfied. planning as satisfiability is a class of planning aiming to achieve a plan with optimal resource, cost, or makespan by using the SAT approach. We present a mix- SAT formulation for these two optimization problems and examine to extend the Davis-Putnam-Logemann- Loveland (DPLL) procedure, which is the basic framework for the original SAT problem, for this mix- SAT formulation. We progressively develop a series of…    
Customers also bought

Book details

List price: $114.00
Publisher: Lap Lambert Academic Publishing GmbH & Company KG
Binding: Paperback
Pages: 220
Size: 6.00" wide x 9.00" long x 0.50" tall
Weight: 0.726
Language: English