Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP (Q5958636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP |
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
0 references
0.9088687
0 references
0.90787774
0 references
0.90393466
0 references
0.90125406
0 references
0.8970791
0 references
