{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:21:17Z","timestamp":1649215277437},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T00:00:00Z","timestamp":1503446400000},"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":[[2017,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We argue that turning a logic program into a set of completed definitions can be sometimes thought of as the \u201creverse engineering\u201d process of generating a set of conditions that could serve as a specification for it. Accordingly, it may be useful to define completion for a large class of Answer Set Programming (ASP) programs and to automate the process of generating and simplifying completion formulas. Examining the output produced by this kind of software may help programmers to see more clearly what their program does, and to what degree its behavior conforms with their expectations. As a step toward this goal, we propose here a definition of program completion for a large class of programs in the input language of the ASP grounder <jats:sc>gringo<\/jats:sc>, and study its properties.<\/jats:p>","DOI":"10.1017\/s1471068417000394","type":"journal-article","created":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T03:07:56Z","timestamp":1503457676000},"page":"855-871","source":"Crossref","is-referenced-by-count":2,"title":["Program completion in the input language of GRINGO"],"prefix":"10.1017","volume":"17","author":[{"given":"AMELIA","family":"HARRISON","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VLADIMIR","family":"LIFSCHITZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DHANANJAY","family":"RAJU","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"S1471068417000394_ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"key":"S1471068417000394_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001765"},{"key":"S1471068417000394_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(86)90055-2"},{"key":"S1471068417000394_ref9","unstructured":"Harrison A. , Lifschitz V. and Yang F. 2014. The semantics of Gringo and infinitary propositional formulas. In Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR), 32\u201341."},{"key":"S1471068417000394_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30743-0_37"},{"key":"S1471068417000394_ref11","unstructured":"Lee J. and Meng Y. 2012. Stable models of formulas with generalized quantifiers. In Working Notes of the 14th International Workshop on Non-Monotonic Reasoning (NMR)."},{"key":"S1471068417000394_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068415000150"},{"key":"S1471068417000394_ref4","doi-asserted-by":"crossref","unstructured":"Ferraris P. 2005. Answer sets for propositional theories. In Proc. of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 119\u2013131.","DOI":"10.1007\/11546207_10"},{"key":"S1471068417000394_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"S1471068417000394_ref3","first-page":"51","article-title":"Consistency of Clark's completion and existence of stable models","volume":"1","author":"Fages","year":"1994","journal-title":"Journal of Methods of Logic in Computer Science"},{"key":"S1471068417000394_ref6","unstructured":"Ferraris P. and Lifschitz V. 2010. The stable model semantics for first-order formulas with aggregates. In Proc. of International Workshop on Nonmonotonic Reasoning (NMR) http:\/\/www.kr.org\/NMR\/proceedings.html"},{"key":"S1471068417000394_ref10","doi-asserted-by":"crossref","unstructured":"Lee J. and Meng Y. 2009. On reductive semantics of aggregates in answer set programming. In Proc. of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). 182\u2013195.","DOI":"10.1007\/978-3-642-04238-6_17"}],"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\/S1471068417000394","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T21:53:54Z","timestamp":1555451634000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068417000394\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,23]]},"references-count":12,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S1471068417000394"],"URL":"https:\/\/doi.org\/10.1017\/s1471068417000394","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,23]]}}}