Searching for Optimization through Satisfiability
Satisfiability Approaches in Maximum Satisfiability and AI Planning
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
79.00 €
39 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
- Ratenzahlung möglich
Produktdetails
Produktinformationen zu „Searching for Optimization through Satisfiability “
Klappentext zu „Searching for Optimization through Satisfiability “
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 algorithms and reconsider many general SAT techniques for these two optimization problems.
Bibliographische Angaben
- Autor: Zhao Xing
- 2010, 220 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 383830327X
- ISBN-13: 9783838303277
Sprache:
Englisch
Kommentar zu "Searching for Optimization through Satisfiability"
0 Gebrauchte Artikel zu „Searching for Optimization through Satisfiability“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Searching for Optimization through Satisfiability".
Kommentar verfassen