Friends or foes? On planning as satisfiability and abstract CNF encodings (Q5190260)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5681360
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Friends or foes? On planning as satisfiability and abstract CNF encodings |
scientific article; zbMATH DE number 5681360 |
Statements
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings (English)
0 references
15 March 2010
0 references
model checking
0 references
planning
0 references
planning graph
0 references
satisfiability
0 references
0.8086055517196655
0 references
0.80501788854599
0 references
0.8011468052864075
0 references
0.7904994487762451
0 references
