Login / Signup
Faster Probabilistic Planning through More Efficient Stochastic Satisfiability Problem Encodings.
Stephen M. Majercik
Andrew P. Rusczek
Published in:
AIPS (2002)
Keyphrases
</>
satisfiability problem
probabilistic planning
boolean satisfiability
sat problem
np complete
sat instances
temporal logic
search algorithm
planning problems
phase transition
max sat
constraint satisfaction problems