next up previous
Next: Action Language Up: The LPSAT Engine & Previous: Incorporating Learning and Backjumping

The Resource Planning Application

In order to demonstrate LPSAT's utility, we implemented a compiler for metric planning domains (starting from a base of IPP's [Koehler et al.1997] and BLACKBOX's [Kautz and Selman1998] parsers) which translates resource planning problems into LCNF form. After LPSAT solves the LCNF problem, a small decoding unit maps the resulting boolean and real-valued assignments into a solution plan (Figure 1). We believe that this translate/solve/decode architecture is effective for a wide variety of problems.