totSAT - Totally-Ordered Hierarchical Planning Through SAT.
Gregor BehnkeDaniel HöllerSusanne BiundoPublished in: AAAI (2018)
Keyphrases
- totally ordered
- partially ordered
- partial order
- sat solvers
- satisfiability problem
- partial ordering
- sat problem
- sat solving
- search algorithm
- stochastic local search algorithms
- boolean satisfiability
- pseudo boolean constraints
- propositional satisfiability
- phase transition
- max sat
- sat instances
- variable ordering
- search procedures
- graph coloring
- search strategies
- classical planning
- stochastic local search
- orders of magnitude
- sat encodings
- information retrieval systems
- search space
- lower bound
- data mining