Display program code

strips.pl : a STRIP-like planning language
This program takes as query a ground instance of a STRIP like language and computes the plans that satisfy the goal.

How to use:
initial_state constraint(X) is the constraint used to list the atoms of the initial state.
The defined the actions should the action constraints. An action constraint has has 5 arguments: 1) the name of the action 2) list of positive preconditions (atoms that should be in the store for the action occurrence) 3) list of negative preconditions (atoms that should not be into the store for the action occurrence) 4) list of negative postconditions (atoms deleted form the store after the action action occurrence) 5) list of positive postconditions (atoms added to the store after the action action occurrence)
goal(X) is used to list the atoms that should be in the final state.
The query should contains: 1) the initial_state constraint 2) all the action constraints 3) the goal constraint 4) the constraint solve(N) where N is a maximum length of the plans tested. Note that solve(N) must be the last constraint of the query.
The CHR program adds a result/3 constraint for every plan that satisfies the goal. The arguments of the result constraint are: 1) the final state 2) the length of the plan 3) the actions of the plan

See also:
For more information about STRIPS go to: http://en.wikipedia.org/wiki/STRIPS

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

CHR
WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007