Planning with Preferences using Logic Programming
This page contains the source codes presented in the paper "Planning with Preferences using Logic Programming". The codes are changed frequently and you might experience some problems because I keep changing the predicate names to better reflect the role they play in the program. Please contact me if you have any questions and comments. To avoid conflicts with built-in predicates in SMODELS, some of the predicates in the source files have different names than what we have in the paper, for example, 'isand' and 'isor' stand for 'and' and 'or', respectively.
Here are the encodings of some examples from the paper. I am working on a translation from formula of the form desire(j) (respectively, preference(j)) where j is a desire (respectively, preference) written in the prefix notation (in PROLOG) into the set of atoms Õj encoding j and the set of rules computing w(a,n). Please check back in a few weeks. Below are the encoding of some of the preferences described in the paper.
lparse -c length=2 exp.pl preference-file axioms sat | smodels
(preference-file is the name of the file encoding the preference, e.g., exp1-occ, time, cost-time, etc.)
Last Update 06/29/2004