|
Abstract
|
|
|---|---|
| Planning as satisfiability is one of the most efficient ways to solve classic automated planning problems. In SAT planning, the encoding used to convert the problem to a SAT formula is critical for the performance of the SAT solver. This paper presents a novel bit-encoding that reduces the number of bits required to represent actions in a SAT-based automated planning problem. To obtain such encoding we first build a conflict graph, | |
|
International
|
Si |
|
Congress
|
International Conference on Mathematical Methods & Computational Techniques in Science & Engineering (MMCTSE) 2017 |
|
|
960 |
|
Place
|
Cambridge, UK |
|
Reviewers
|
Si |
|
ISBN/ISSN
|
978-0-7354-1552-2 |
|
|
|
|
Start Date
|
24/02/2017 |
|
End Date
|
26/02/2017 |
|
From page
|
1 |
|
To page
|
11 |
|
|
AIP Conference Proceedings 1872, 020015 (2017) |