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
172 Chapter 8 Constraint Satisfaction Techniques
Given a CSP, one may be interested in addressing: (1) a resolution problem:
finding a solution tuple; (2) a consistency problem: checking whether such a solution
exists; (3) a filtering problem: removing some redundant values from domains or
some redundant tuples from constraints; and (4) a minimal reduction problem:
removing every redundant value and redundant tuple.
One may define several levels of filtering, but filtering is weaker than minimal
reduction because remaining values in a filtered domain may or may not belong to
a solution. Minimal reduction solves the consistency problem because a CSP has
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