TY - GEN
T1 - A novel transition based encoding scheme for planning as satisfiability
AU - Huang, Ruoyun
AU - Chen, Yixin
AU - Zhang, Weixiong
PY - 2010
Y1 - 2010
N2 - Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+ formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number of clauses by up to 50 fold. Our results show that this encoding scheme improves upon the STRlPS-based encoding, in terms of both time and memory efficiency.
AB - Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+ formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number of clauses by up to 50 fold. Our results show that this encoding scheme improves upon the STRlPS-based encoding, in terms of both time and memory efficiency.
UR - http://www.scopus.com/inward/record.url?scp=77958569760&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:77958569760
SN - 9781577354642
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 89
EP - 94
BT - AAAI-10 / IAAI-10 - Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference
PB - AI Access Foundation
T2 - 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10
Y2 - 11 July 2010 through 15 July 2010
ER -