Compact Tree Encodings for Planning as QBF
Considerable improvements in the technology and performance of SAT solvers has made their use possible for the resolution of various problems in artificial intelligence, and among them that of generating plans. Recently, promising Quantified Boolean Formula (QBF) solvers have been developed and we...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Asociación Española para la Inteligencia Artificial
2018-10-01
|
| Series: | Inteligencia Artificial |
| Subjects: | |
| Online Access: | https://journal.iberamia.org/index.php/intartif/article/view/214 |