DLVK
This is the homepage of DLVK
, which implements
a frontend for the language K to the DLV
system.
The language K is a logic-based planning language which - unlike previously proposed languages of this kind - is well-suited for representing incomplete knowledge. For a thorough description of the language we refer to "Planning under Incomplete Knowledge" by Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, and Axel Polleres.
For better readability of plans and the output of our planning frontend Jürgen Oberhofer has created a GUI available at SourceForge written in Tcl/TK.
Publications on DLVK
and some more information
on our planning project can be found at the official
project page.
We suggest to run some of them to get familiar with the system.
DLV blocks_world.plan sussman.plan sussman.dl -FP -N=3
DLV blocks_world_assured.plan sussman_incomplete.plan sussman_incomplete.dl -FP -N=4
DLV yale.plan -FP -N=1
DLV monkey.plan monkey.dl -FP -N=4
DLV monkey_incomplete.plan monkey.dl -FP -N=4
DLV rocket.plan rocket.dl -FP -N=3
Some more examples (these encodings were used for benchmarks in Technical Report INFSYS RR-1843-01-12 "A Logic Programming Approach to Knowledge-State Planning, II: The DLV^K System"):
DLV blocks.plan P.bk P3.plan -N=7 -FP
-planlength=8
DLV bmtc.plan concurrency.plan bt2.bk -N=4 -FPsec -planlength=3
Even more examples (some showing the new cost optimal planning features of our system which will be presented at JELIA'02):
DLV tsp.plan tsp.bk -FP -N=10
DLV crossing.plan crossing.bk -FP -planlength=7
DLV sheep_wolves.plan sheep_wolves.bk -FP