Planning with Specialized SAT Solvers

Authors

  • Jussi Rintanen The Australian National University

Abstract

Logic, and declarative representation of knowledge in general, have long been a preferred framework for problem solving in AI. However, specific subareas of AI have been eager to abandon general-purpose knowledge representation in favor of methods that seem to address their computational core problems better. In planning, for example, state-space search has in the last several years been preferred to logic-based methods such as SAT. In our recent work, we have demonstrated that the observed performance differences between SAT and specialized state-space search methods largely go back to the difference between a blind (or at least planning-agnostic) and a planning-specific search method. If SAT search methods are given even simple heuristics which make the search goal-directed, the efficiency differences disappear.

Downloads

Published

2011-08-04

How to Cite

Rintanen, J. (2011). Planning with Specialized SAT Solvers. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 1563-1566. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/7962

Issue

Section

New Scientific and Technical Advances in Research