{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T00:07:46Z","timestamp":1715645266134},"reference-count":11,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"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":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We investigate the relationship between the generalization of program completion defined in 1984 by Lloyd and Topor and the generalization of the stable model semantics introduced recently by Ferraris <jats:italic>et al<\/jats:italic>. The main theorem can be used to characterize, in some cases, the general stable models of a logic program by a first-order formula. The proof uses Truszczynski's stable model semantics of infinitary propositional formulas.<\/jats:p>","DOI":"10.1017\/s1471068413000318","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"503-515","source":"Crossref","is-referenced-by-count":2,"title":["Lloyd-Topor completion and general stable models"],"prefix":"10.1017","volume":"13","author":[{"given":"VLADIMIR","family":"LIFSCHITZ","sequence":"first","affiliation":[]},{"given":"FANGKAI","family":"YANG","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000318_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.04.011"},{"key":"S1471068413000318_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":"S1471068413000318_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/383779.383783"},{"key":"S1471068413000318_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.04.004"},{"key":"S1471068413000318_ref6","first-page":"69","volume-title":"Principles of Knowledge Representation","author":"Lifschitz","year":"1996"},{"key":"S1471068413000318_ref1","unstructured":"Bartholomew M. and Lee J. 2012. Stable models of formulas with intensional functions. In Proceedings of International Conference on Principles of Knowledge Representation and Reasoning (KR)."},{"key":"S1471068413000318_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068403001765"},{"key":"S1471068413000318_ref5","first-page":"125","article-title":"First-order stable model semantics and first-order loop formulas.","volume":"42","author":"Lee","year":"2011","journal-title":"Journal of Artificial Inteligence Research (JAIR)"},{"key":"S1471068413000318_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90011-6"},{"key":"S1471068413000318_ref9","unstructured":"Lin F. and Zhao J. 2003. On tight logic programs and yet another translation from normal logic programs to propositional logic. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 853\u2013864."},{"key":"S1471068413000318_ref8","unstructured":"Lifschitz V. , Pearce D. and Valverde A. 2007. A characterization of strong equivalence for logic programs with variables. In Procedings of International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), 188\u2013200."}],"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\/S1471068413000318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:29:15Z","timestamp":1715592555000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000318\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":11,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000318"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000318","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}