Applications of Logic Programming to Planning: Computational Experiments

We summarized our experiments with the systems SMODELS and DLV applied to some planning problems in a report. A postscript version of the report and the input files used in our experiments are available below.

• the report  (abstract) (postscript version)
• the problems
• the Suitcase domain
• presented to DLV
• presented to SMODELS
• the Suitcase problem
• presented to DLV
• presented to SMODELS
• Blocks World domain
• presented to DLV:  (a) and (b)
• presented to SMODELS
• presented to CCALC
• Blocks World problems
• Sussman Anomaly  (presented to DLV)  (presented to SMODELS) (presented to CCALC)
• P1 (presented to DLV)  (presented to SMODELS) (presented to CCALC)
• P2 (presented to DLV)  (presented to SMODELS) (presented to CCALC)
• P3 (presented to DLV)  (presented to SMODELS) (presented to CCALC)
• P4 (presented to DLV)  (presented to SMODELS) (presented to CCALC)

You can look at the manuals of DLV, SMODELS and CCALC for the instructions to install and use these systems. The manuals are available at their webpages.

Please check the modifications done so far on the report, the domain descriptions, and the problem descriptions at our update-page.