Planning as satisfiability: Heuristics

@article{Rintanen2012PlanningAS,
  title={Planning as satisfiability: Heuristics},
  author={Jussi Rintanen},
  journal={Artif. Intell.},
  year={2012},
  volume={193},
  pages={45-86}
}
Reduction to SAT is a very successful approach to solving hard combinatorial problems in Artificial Intelligence and computer science in general. Most commonly, problem instances reduced to SAT are solved with a general-purpose SAT solver. Although there is the obvious possibility of improving the SAT solving process with application-specific heuristics, this has rarely been done successfully. In this work we propose a planning-specific variable selection strategy for SAT solving. The strategy… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 89 CITATIONS, ESTIMATED 31% COVERAGE

FILTER CITATIONS BY YEAR

2013
2019

CITATION STATISTICS

  • 15 Highly Influenced Citations

  • Averaged 16 Citations per year over the last 3 years

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…