{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:14:05Z","timestamp":1777644845068,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2013,8]]},"abstract":"<jats:p>Weight constraints are a powerful programming construct that has proved very useful within the Answer Set Programming paradigm. In this paper, we argue that practical Answer Set Programming might take profit from introducing some forms of nested weight constraints. We define such empowered constraints (that we call \u201cNested Weight Constraints\u201d) and discuss their semantics and their complexity.<\/jats:p>","DOI":"10.3233\/fi-2013-843","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:26:15Z","timestamp":1575332775000},"page":"449-464","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Nested Weight Constraints in ASP"],"prefix":"10.1177","volume":"124","author":[{"given":"Stefania","family":"Costantini","sequence":"first","affiliation":[{"name":"DISIM - Universita degli Studi di L'Aquila, Via Vetoio Loc. Coppito, I-67100 L'Aquila, Italy. Stefania.Costantini@univaq.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, Universita di Perugia, via Vanvitelli 1, I-06123, Perugia, Italy. formis@dmi.unipg.it"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2013,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2013-843","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2013-843","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:35Z","timestamp":1777444235000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2013-843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["10.3233\/FI-2013-843"],"URL":"https:\/\/doi.org\/10.3233\/fi-2013-843","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}