Paper Info
Title
Reachability, Relevance, Resolution and the Planning as Satisfiability Approach
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.
Year
DOI
Venue
1999
10.1613/jair.737
IJCAI
Keywords
Field
DocType
higher-order resolution step,additional consideration,resolution step,nice result,graphplan encoding scheme,satisfiability approach,limited binary resolution,natural class,relevance algorithm,relevance information,central encoding method,satisfiability,higher order
Discrete mathematics,Computer science,Satisfiability,Natural class,Theoretical computer science,Reachability,Preprocessor,Graphplan,Binary number,Encoding (memory)
Conference
Volume
Issue
ISSN
14
1
1076-9757
ISBN
Citations 
PageRank 
1-55860-613-0
7
0.74
References 
Authors
17
23
Name
Order
Citations
PageRank
Ronen I. Brafman13260220.63
Nevin .L Zhang289597.21
wei zhang370.74
xi chen470.74
Peter Van Beek51612141.30
Christopher Lusena61079.27
john r goldsmith770.74
martin mundhenk870.74
Craig Boutilier96864621.05
Umberto Straccia102731251.15
ralf kusters1170.74
Alexander Borgida122521986.29
Romuald Debruyne1327215.91
Christian Bessière141520114.38
Chumki Basu15574160.00
Haym Hirsh161839277.74
william w cohen1770.74
Craig G. Nevill-Manning181376146.05
Jörg Hoffmann192702189.88
Bernhard Nebel204019565.71
M L Ginsberg212249453.16
Joseph Y. Halpern2296171618.10
RI Brafman231199.18