{"product_id":"searching-for-optimization-through-satisfiability-satisfiability-approaches-in-maximum-satisfiability-and-ai-planning-von-zhao-xing","title":"Searching for Optimization through Satisfiability","description":"\u003cp\u003eThis 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.\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838303277\"\u003e\u003ch3\u003eSatisfiability Approaches in Maximum Satisfiability and AI Planning\u003c\/h3\u003e\u003c\/div\u003e","brand":"Libri","offers":[{"title":"Softcover - 9783838303277","offer_id":39447928406109,"sku":"9783838303277","price":79.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/4728bd23-72c1-4a8d-aad4-4acf577ec0e5.jpg?v=1772866154","url":"https:\/\/shop.autorenwelt.de\/en\/products\/searching-for-optimization-through-satisfiability-satisfiability-approaches-in-maximum-satisfiability-and-ai-planning-von-zhao-xing","provider":"Autorenwelt Shop","version":"1.0","type":"link"}