Cutting Connections in Linear Connection Proofs

Abstract

The paper contributes to the implementation of plan generation systems based on the Linear Connection Method. Analysing a previously published algorithm, we decocted as one of the reasons for the explosion of its search space certain “cyclic rules” –Horn clause like expressions where the head literal reoccurs in the tail –which resulted from the way we transformed action specifications. We will present here an improved algorithm, which instead of using these cyclic rules, solves sub goals via insertion of actions into an already partially constructed plan. This improved algorithm also outperformed the old one when we ran it on some benchmarks.