Codes for Readers of CILC09, LPNMR09, and FI 2011 papers

• All codes are currently in SICStus Prolog 4. You can download the interpreter for free (for one month) from here. The codes can be ported in other clp(fd) Prolog systems with few work. We are happy to do this for you if you ask us by email.
• All the files are saved in .txt format to avoid a bad interpretation of Prolog files as Pearl files by some web browsers.
• SICStus Prolog clp(FD) Interpreter of the BMAP language (updated November 2010). Consult/compile it (if compiled it will run faster) after the adding of the line :-include(FileName). at the beginning of the file, where FileName stores the action description. Use the flags strategy (labeling options), loop_control (forbid to enter twice in a state), and monotonic (in case you assign a constrained cost to a state you can force this value to be always incremented during the search).
• Some (single agent) test codes:
  1. The three barrels, parametric on barrel sizes
  2. The Goat, Cabbage, and Wolf problem.
  3. The Gas diffusion problem
  4. A 3 x 3 puzzle
  5. The Peg Solitaire problem.
• Some concurrency test codes
  1. Bob and Mary at the park with Collective Actions and with Compound Actions
  2. A social game
  3. The Dining philosophers
  4. A problem of Cars and Fuel
  5. A two rooms, two agents, four blocks, and a table problem.
  6. Pumps and Pipes a multivalued, multiagent variant of hydraulic planning and leaking from the 2009 ASP competition.
  7. Reader and Switcher A two-agents example with durable actions and durable effects developed by us.
  8. The soccer domain. For this domain you may be interested in setting the monotonic option to true. Moreover, in the domain file there is an ad-hoc printing procedure for watching the soccer match. You can use it by changing the definition of predicate stampa_result by commenting/decommenting lines 1034--1039 in the interpeter.
• To use the interpreter, consult/compile it (change the line that includes the desired action theory - see above).
  Then call the goal :- bmap(N), where N is the length of the plan.
• It works either with the pretty syntax presented in the paper or with a more concrete syntax (the one used in these files). Please report us any problem and we'll try to fix it asap.

[Updated May 2010]