

Ranu, Sayan, Balakrishnan, Prabhakar and Prabhu, G.M. (2006) Optimization Rules in DLV for the Bridge Crossing Problem. Technical Report 0608, Computer Science, Iowa State University.
Abstract
Disjunctive logic programming is a powerful tool in knowledge representation and commonsense reasoning. The first solid implementation of a DLP system is called DLV (Datalog with Vel). In this paper we offer three strategies to produce optimal solutions in DLV for the wellknown Bridge Crossing Problem. These strategies are a piggyback strategy, a nonpiggyback strategy, and a mixed strategy. An analysis to determine the number of time steps required for an optimal solution using these strategies is provided. We also characterize and prove the conditions under which a particular strategy should be used to obtain an optimal solution. These strategies are implemented in the form of optimization rules in a DLV program for the bridge crossing problem. Preliminary results indicate a drastic reduction in execution time when compared to other DLV programs for bridge crossing which do not incorporate these strategies. Our implementation uses a DLV Java wrapper, allowing us to embed disjunctive logic programs inside an objectoriented environment.
Contact site administrator at: ssg@cs.iastate.edu
