%0 Conference Paper %1 Son04 %A Son, Tran C. %A Pontelli, Enrico %B In Proc. LPNMR'04 %D 2004 %I Springer %K logic-programming, planning %P 247--260 %T Planning with Preferences using Logic Programming %U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6290 %X We present a declarative language, PP , for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over them. The semantics of PP allows the identification of most preferred trajectories of a given goal. We provide a transformation to logic programming with negation as failure, that allows the use of existing logic programming...

@inproceedings{Son04, abstract = {{We present a declarative language, PP , for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allows users to elegantly express non-trivial, multi-dimensional preferences and priorities over them. The semantics of PP allows the identification of most preferred trajectories of a given goal. We provide a transformation to logic programming with negation as failure, that allows the use of existing logic programming...}}, added-at = {2011-05-04T16:04:17.000+0200}, author = {Son, Tran C. and Pontelli, Enrico}, biburl = {https://www.bibsonomy.org/bibtex/229a2523d7291d15b45280539da9fce43/baisemain}, booktitle = {In Proc. LPNMR'04}, citeulike-article-id = {1297481}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6290}, interhash = {8d30710dc617f88a4462dce493d4e0cc}, intrahash = {29a2523d7291d15b45280539da9fce43}, keywords = {logic-programming, planning}, pages = {247--260}, posted-at = {2007-05-15 17:21:06}, priority = {4}, publisher = {Springer}, timestamp = {2011-05-04T16:04:38.000+0200}, title = {{Planning with Preferences using Logic Programming}}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.6290}, year = 2004 }