{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:48:22Z","timestamp":1769975302885,"version":"3.49.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T00:00:00Z","timestamp":1154476800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2006,9]]},"abstract":"<jats:p>We present a declarative language, <jats:inline-formula id=\"ffm001\">${\\cal PP}$<\/jats:inline-formula>, for the high-level 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 such preferences. The semantics of <jats:inline-formula id=\"ffm002\">${\\cal PP}$<\/jats:inline-formula> allows the identification of <jats:italic>most preferred trajectories<\/jats:italic> for a given goal. We also provide an answer set programming implementation of planning problems with <jats:inline-formula id=\"ffm003\">${\\cal PP}$<\/jats:inline-formula> preferences.<\/jats:p>","DOI":"10.1017\/s1471068406002717","type":"journal-article","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T22:16:57Z","timestamp":1154557017000},"page":"559-607","source":"Crossref","is-referenced-by-count":35,"title":["Planning with preferences using logic programming"],"prefix":"10.1017","volume":"6","author":[{"given":"TRAN CAO","family":"SON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ENRICO","family":"PONTELLI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2006,8,2]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068406002717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T19:01:55Z","timestamp":1554145315000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068406002717\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,2]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["S1471068406002717"],"URL":"https:\/\/doi.org\/10.1017\/s1471068406002717","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,2]]}}}