{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:24:30Z","timestamp":1777645470130,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,10]]},"abstract":"<jats:p>In recent years, Answer Set Programming has gained popularity as a\n\t\t\t viable paradigm for applications in knowledge representation and reasoning.\n\t\t\t This paper presents a novel methodology to compute answer sets of an answer set\n\t\t\t program. The proposed methodology maintains a bottom-up approach to the \n\t\t\t computation of answer sets (as in existing systems), but it makes use of a\n\t\t\t novel structuring of the computation, that originates from the non-ground \n\t\t\t version of the program. Grounding is lazily performed during the computation of\n\t\t\t the answer sets. The implementation has been realized using Constraint Logic\n\t\t\t Programming over finite domains.<\/jats:p>","DOI":"10.3233\/fi-2009-180","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:00:54Z","timestamp":1575327654000},"page":"297-322","source":"Crossref","is-referenced-by-count":44,"title":["GASP: Answer Set Programming with Lazy Grounding"],"prefix":"10.1177","volume":"96","author":[{"given":"Alessandro","family":"Dal Pal\u00f9","sequence":"first","affiliation":[{"name":"Dipartimento di Matematica, University of Parma, Italy.\r\t\t\tE-mail: alessandro.dalpalu@unipr.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica e Informatica, University\r\t\t\t of Udine, Italy. E-mail: dovier@dimi.uniud.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[{"name":"Dept. Computer Science, New Mexico State University,\r\t\t\t Mexico. E-mail: epontell@cs.nmsu.edu"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianfranco","family":"Rossi","sequence":"additional","affiliation":[{"name":"Dipartimento di Matematica, University of Parma, Italy.\r\t\t\t E-mail: gianfranco.rossi@unipr.it"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-180","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:32:18Z","timestamp":1777444338000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["10.3233\/FI-2009-180"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-180","relation":{"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.306.9","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.306.60","asserted-by":"object"}]},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}