{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:00:48Z","timestamp":1747173648889,"version":"3.40.5"},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T00:00:00Z","timestamp":1568937600000},"content-version":"unspecified","delay-in-days":19,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explicit negation is normally used in front of atoms, rather than allowing its use as a regular operator. In this paper we consider the arbitrary combination of explicit negation with nested expressions, as those defined by Lifschitz, Tang and Turner. We extend the concept of reduct for this new syntax and then prove that it can be captured by an extension of Equilibrium Logic with this second negation. We study some properties of this variant and compare to the already known combination of Equilibrium Logic with Nelson\u2019s strong negation.<\/jats:p>","DOI":"10.1017\/s1471068419000267","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T09:06:21Z","timestamp":1568970381000},"page":"908-924","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting Explicit Negation in Answer Set Programming"],"prefix":"10.1017","volume":"19","author":[{"given":"FELICIDAD","family":"AGUADO","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PEDRO","family":"CABALAR","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3917-8717","authenticated-orcid":false,"given":"JORGE","family":"FANDINNO","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID","family":"PEARCE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GILBERTO","family":"P\u00c9REZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CONCEPCI\u00d3N","family":"VIDAL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000267_ref11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","article-title":"Representing action and change by logic programs","volume":"2\/3&4","author":"Gelfond","year":"1993","journal-title":"Journal of Logic Programming 17"},{"key":"S1471068419000267_ref2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1017\/S1471068410000517","article-title":"Functional answer set programming","volume":"2","author":"Cabalar","year":"2011","journal-title":"Theory and Practice of Logic Programming 11"},{"unstructured":"Nelson, D. 1949. Constructible falsity. Journal of Symbolic Logic 14, 1626.","key":"S1471068419000267_ref16"},{"doi-asserted-by":"publisher","key":"S1471068419000267_ref1","DOI":"10.1080\/11663081.2013.798985"},{"unstructured":"Ortiz, M. and Osorio, M. 2007. Strong negation and equivalence in the safe belief semantics. Journal of Logic and Computation 17, 499\u2013515.","key":"S1471068419000267_ref19"},{"key":"S1471068419000267_ref18","first-page":"343","volume-title":"Proc. of the 8th Logic Programming and Nonmonotonic Reasoning, LPNMR 2005, Diamante, Italy","volume":"3662","author":"Odintsov","year":"2005"},{"key":"S1471068419000267_ref22","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02121118","article-title":"Notes on N-lattices and constructive logic with strong negation","volume":"1","author":"Vakarelov","year":"1977","journal-title":"Studia logica 36"},{"key":"S1471068419000267_ref6","first-page":"93","volume-title":"Proc. of the 1st Intl. Workshop on Frontiers of Combining Systems, Munich, Germany, March 26-29","volume":"3","author":"Fari\u00f1as del Cerro","year":"1996"},{"key":"S1471068419000267_ref4","first-page":"340","volume-title":"Proc. of the 14th European Conf. on Logics in Artificial Intelligence, JELIA 2014, Funchal, Madeira, Portugal, September 24-26","volume":"8761","author":"Cabalar","year":"2014"},{"key":"S1471068419000267_ref10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"3\/4","author":"Gelfond","year":"1991","journal-title":"New Generation Comput. 9"},{"key":"S1471068419000267_ref13","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"4","author":"Lifschitz","year":"2001","journal-title":"ACM Transactions on Computational Logic 2"},{"doi-asserted-by":"crossref","unstructured":"Cabalar, P. , Fandinno, J. , and Fari\u00f1as del Cerro, L. 2019. Founded world views with autoepistemic equilibrium logic. In Proc. of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR\u201919) (June 3-7).","key":"S1471068419000267_ref3","DOI":"10.1007\/978-3-030-20528-7_11"},{"key":"S1471068419000267_ref7","first-page":"2964","volume-title":"Proc. of the Intl. Joint Conference on Artificial Intelligence (IJCAI\u201915)","author":"Fari\u00f1as del Cerro","year":"2015"},{"key":"S1471068419000267_ref8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Proc. of the 8th Intl. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201905)","volume":"3662","author":"Ferraris","year":"2005"},{"unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proc. of the 5th Intl. Conference on Logic Programming (ICLP\u201988). 1070\u20131080.","key":"S1471068419000267_ref9"},{"unstructured":"Heyting, A. 1930. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 42\u201356.","key":"S1471068419000267_ref12"},{"key":"S1471068419000267_ref15","first-page":"169","volume-title":"Stable models and an alternative logic programming paradigm","author":"Marek","year":"1999"},{"unstructured":"Niemel\u00e4, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. AMAI 25, 241\u2013273.","key":"S1471068419000267_ref17"},{"key":"S1471068419000267_ref21","first-page":"102","volume-title":"Proceedings of the European Conference on Artificial Intelligence (ECAI\u201992)","author":"Pereira","year":"1992"},{"unstructured":"Vorob\u2019ev, N. 1952a. A constructive propositional calculus with strong negation (in Russian). Doklady Akademii Nauk SSR 85, 465\u2013468.","key":"S1471068419000267_ref23"},{"unstructured":"Vorob\u2019ev, N. 1952b. The problem of deducibility in constructive propositional calculus with strong negation (in russian). Doklady Akademii Nauk SSR 85, 689\u2013692.","key":"S1471068419000267_ref24"},{"key":"S1471068419000267_ref20","first-page":"57","volume-title":"NMELP","volume":"1216","author":"Pearce","year":"1997"},{"doi-asserted-by":"publisher","key":"S1471068419000267_ref14","DOI":"10.1023\/A:1018978005636"},{"key":"S1471068419000267_ref5","first-page":"592","volume-title":"Proc. of the 10th Ibero-American Artificial Intelligence Conf. (IBERAMIA\u201906), Ribeiro Preto, Brazil","volume":"4140","author":"Cabalar","year":"2006"}],"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\/S1471068419000267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T04:34:44Z","timestamp":1571114084000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000267\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":24,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000267"],"URL":"https:\/\/doi.org\/10.1017\/s1471068419000267","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}