Partially Grounded Planning as Quantified Boolean Formula.

Michael Cashmore Maria Fox Enrico Giunchiglia

Published in: ICAPS (2013)

Keyphrases

boolean formula
planning problems
sat solvers
np complete
state space
scheduling problem
domain independent
read once formulas
machine learning
sat problem
max sat
sat instances
conjunctive normal form