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
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 113 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 74 extracted citations

113 Citations

0102030'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 113 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…