Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Walksat / rank | |||
Normal rank | |||
Revision as of 05:35, 28 February 2024
scientific article; zbMATH DE number 1715665
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP |
scientific article; zbMATH DE number 1715665 |
Statements
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (English)
0 references
3 March 2002
0 references
planning
0 references
CSP compilation
0 references
constraint satisfaction
0 references
graphplan
0 references
encodings
0 references
EBL
0 references
