SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (Q814472): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Graphplan / rank | |||
Normal rank | |||
Revision as of 05:41, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | SAT-based planning in complex domains: Concurrency, constraints and nondeterminism |
scientific article |
Statements
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism (English)
0 references
7 February 2006
0 references
SAT-based planning
0 references
Planning under uncertainty
0 references
Concurrency
0 references
Satisfiability
0 references
