---
title: "Reachability, Relevance, Resolution and the Planning as Satisfiability Approach"
authors:
  - "Ronen I. Brafman"
doi: ""
url: "https://ijcai.org/proceedings/1999/139"
pdf: "https://ijcai.org/proceedings/1999/0139.pdf"
venue: "Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence"
year: 1999
pages: "976-980"
track: "Planning and Scheduling"
keywords:
---

# Reachability, Relevance, Resolution and the Planning as Satisfiability Approach

Ronen I. Brafman

*Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence*, pages 976-980.

## Abstract

We investigate the ability of two central encoding methods to propagate reachability and relevance information using resolution steps. More specifically, we compare the ability of unit-propagation and higher-order resolution steps to propagate reachability and relevance information in the context of the linear and GRAPHPLAN encoding schemes to the ability of a natural class of reachability and relevance algorithms that operate at the plan level. As a result of our observations and additional considerations, we experiment with a preprocessing step based on limited binary resolution that shows nice results.