{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:54:57Z","timestamp":1740174897239,"version":"3.37.3"},"reference-count":30,"publisher":"Wiley","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Scientific Programming"],"published-print":{"date-parts":[[2018]]},"abstract":"<jats:p>In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE). For normal programs, this semantics is based on<jats:italic>suitable<\/jats:italic>integration of the well-founded semantics (WFS) and the Clark\u2019s completion. D3-WFS-DCOM has the following appealing properties: First, it agrees with STABLE in the sense that it never defines a nonminimal model or a nonminimal supported model. Second, for normal programs it extends WFS. Third, every stable model of a disjunctive program<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\"><mml:mrow><mml:mi>P<\/mml:mi><\/mml:mrow><\/mml:math>is a D3-WFS-DCOM model of<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\"><mml:mrow><mml:mi>P<\/mml:mi><\/mml:mrow><\/mml:math>. Fourth, it is constructed using transformation rules accepted by STABLE. We also introduce second semantics that we call D2-WFS-DCOMP. We show that D2-WFS-DCOMP is equivalent to D3-WFS-DCOMP for normal programs but this is not the case for disjunctive programs. We also introduce third new semantics that supports the use of implicit disjunctions. We illustrate how these semantics can be extended to programs including explicit negation, default negation in the head of a clause, and a<mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\"><mml:mi mathvariant=\"normal\">l<\/mml:mi><mml:mi mathvariant=\"normal\">u<\/mml:mi><mml:mi mathvariant=\"normal\">b<\/mml:mi><\/mml:math>operator, which is a generalization of the aggregation operator<jats:italic>setof<\/jats:italic>over arbitrary complete lattices.<\/jats:p>","DOI":"10.1155\/2018\/4157030","type":"journal-article","created":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T23:31:30Z","timestamp":1519947090000},"page":"1-10","source":"Crossref","is-referenced-by-count":1,"title":["Extending Well-Founded Semantics with Clark\u2019s Completion for Disjunctive Logic Programs"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4072-8795","authenticated-orcid":true,"given":"Juan Carlos","family":"Nieves","sequence":"first","affiliation":[{"name":"Department of Computing Science, Ume\u00e5 University, 901 87 Ume\u00e5, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio","family":"Osorio","sequence":"additional","affiliation":[{"name":"Departamento de Actuar\u00eda, F\u00edsica y Matem\u00e1ticas, Universidad de las Am\u00e9ricas Puebla, Sta. Catarina M\u00e1rtir, 72820 Cholula, PUE, Mexico"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357"},{"issue":"3","key":"10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","year":"1995","journal-title":"Fundamenta Informaticae"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(00)00044-0"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80053-4"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90285-N"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(98)10015-8"},{"key":"1","first-page":"104","volume":"2","year":"1999","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46564-2_14"},{"issue":"3","key":"17","first-page":"620","volume":"38","year":"1991","journal-title":"Journal of the ACM"},{"year":"1987","key":"20"},{"year":"1994","key":"32"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(96)00115-X"},{"first-page":"293","volume-title":"Logic and Databases","year":"1978","key":"8"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1005952908693"},{"year":"1997","series-title":"CSLI Lectures Notes 73","key":"7"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023807"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45607-4_4"},{"journal-title":"LPNMR","first-page":"221","year":"1999","key":"19"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90025-6"},{"issue":"2","key":"11","first-page":"123","volume":"11","year":"1998","journal-title":"AI Communications"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037222"},{"journal-title":"PODS","first-page":"127","year":"1992","key":"16"},{"issue":"3","key":"24","first-page":"457","volume":"21","year":"2017","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.3233\/FI-1995-2233"},{"issue":"6","key":"27","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1093\/logcom\/exl013","volume":"16","year":"2006","journal-title":"Journal of Logic and Computation"},{"volume-title":"Useful Transformations in Answer Set Programming","year":"March 2001","key":"28"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000408"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003359"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2011-388"}],"container-title":["Scientific Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2018\/4157030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2018\/4157030.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/sp\/2018\/4157030.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T22:17:43Z","timestamp":1603923463000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/sp\/2018\/4157030\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":30,"alternative-id":["4157030","4157030"],"URL":"https:\/\/doi.org\/10.1155\/2018\/4157030","relation":{},"ISSN":["1058-9244","1875-919X"],"issn-type":[{"type":"print","value":"1058-9244"},{"type":"electronic","value":"1875-919X"}],"subject":[],"published":{"date-parts":[[2018]]}}}