Skip to Main Content
Automated Planning
book

Automated Planning

by Malik Ghallab, Dana Nau, Paolo Traverso
May 2004
Intermediate to advanced content levelIntermediate to advanced
635 pages
19h 46m
English
Morgan Kaufmann
Content preview from Automated Planning
160 Chapter 7 Propositional Satisfiability Techniques
Local-Search-SAT selects a random total assignment first. Let us suppose the
assignment is µ ={D, A, B}. Under this assignment, the only unsatisfied
clause is (¬D ∨¬A ∨¬B), and therefore Cost(µ,) = 1. There is no µ
such
that |µ µ
|=1 and Cost(µ,) < 1. Local-Search-SAT terminates execution
with failure. It behaves differently if the initial guess is different, for instance,
if µ ={¬D, A, ¬B}, then it finds the model in one iteration step.
Basic-GSAT selects a random total assignment. Let us suppose it starts also with
the initial guess µ ={D, A, B}. Different than Local-Search-SAT, Basic-GSAT
has two alternatives. It can flip either variable D or B because the correspond-
ing cost is 1 (flipping
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Communicate with Teams More Effectively

Communicate with Teams More Effectively

Charles Humble
How to Overcome a Power Deficit

How to Overcome a Power Deficit

Cyril Bouquet, Jean-Louis Barsoux

Publisher Resources

ISBN: 9781558608566