{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:07:06Z","timestamp":1760170026635},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2003,3,10]],"date-time":"2003-03-10T00:00:00Z","timestamp":1047254400000},"content-version":"unspecified","delay-in-days":9,"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":[[2003,3]]},"abstract":"<jats:p>We introduce a methodology and framework for expressing general preference information in \nlogic programming under the answer set semantics. An <jats:italic>ordered<\/jats:italic> logic program is an extended \nlogic program in which rules are named by unique terms, and in which preferences among \nrules are given by a set of atoms of form <jats:italic>s<\/jats:italic> [pr      ] <jats:italic>t<\/jats:italic> where <jats:italic>s<\/jats:italic> and <jats:italic>t<\/jats:italic> are names. An ordered logic \nprogram is transformed into a second, regular, extended logic program wherein the preferences \nare respected, in that the answer sets obtained in the transformed program correspond with \nthe preferred answer sets of the original program. Our approach allows the specification \nof <jats:italic>dynamic<\/jats:italic> orderings, in which preferences can appear arbitrarily within a program. <jats:italic>Static<\/jats:italic> \norderings (in which preferences are external to a logic program) are a trivial restriction of \nthe general dynamic case. First, we develop a specific approach to reasoning with preferences, \nwherein the preference ordering specifies the order in which rules are to be applied. We \nthen demonstrate the wide range of applicability of our framework by showing how other \napproaches, among them that of Brewka and Eiter, can be captured within our framework. \nSince the result of each of these transformations is an extended logic program, we can make \nuse of existing implementations, such as <jats:styled-content style=\"e6\">dlv<\/jats:styled-content> and <jats:styled-content style=\"e6\">smodels<\/jats:styled-content>. To this end, we have developed a \npublicly available compiler as a front-end for these programming systems.<\/jats:p>","DOI":"10.1017\/s1471068402001539","type":"journal-article","created":{"date-parts":[[2003,3,17]],"date-time":"2003-03-17T11:58:48Z","timestamp":1047902328000},"page":"129-187","source":"Crossref","is-referenced-by-count":72,"title":["A framework for compiling preferences \nin logic programs"],"prefix":"10.1017","volume":"3","author":[{"given":"JAMES P.","family":"DELGRANDE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TORSTEN","family":"SCHAUB","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HANS","family":"TOMPITS","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,3,10]]},"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\/S1471068402001539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T18:53:28Z","timestamp":1554058408000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068402001539\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S1471068402001539"],"URL":"https:\/\/doi.org\/10.1017\/s1471068402001539","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}