{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T08:26:48Z","timestamp":1717230408580},"reference-count":31,"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":"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":[[2019,9]]},"abstract":"Abstract<\/jats:title>Whereas the operation of forgetting<\/jats:italic> has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.<\/jats:p>In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence<\/jats:italic> \u2013 a property that seems to best capture the essence of forgetting in the context of ASP \u2013 whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program.<\/jats:p>","DOI":"10.1017\/s1471068419000346","type":"journal-article","created":{"date-parts":[[2019,9,20]],"date-time":"2019-09-20T13:06:21Z","timestamp":1568984781000},"page":"1038-1055","source":"Crossref","is-referenced-by-count":8,"title":["A Syntactic Operator for Forgetting that Satisfies Strong Persistence"],"prefix":"10.1017","volume":"19","author":[{"given":"MATTI","family":"BERTHOLD","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-4289-7197","authenticated-orcid":false,"given":"RICARDO","family":"GON\u00c7ALVES","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1826-1498","authenticated-orcid":false,"given":"MATTHIAS","family":"KNORR","sequence":"additional","affiliation":[]},{"given":"JO\u00c3O","family":"LEITE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"S1471068419000346_ref13","unstructured":"Gon\u00e7alves, R. , Knorr, M. , and Leite, J. 2017. Iterative variable elimination in ASP. In Procs. of EPIA. LNCS, vol. 10423. Springer, 643\u2013656."},{"key":"S1471068419000346_ref4","first-page":"745","article-title":"Propositional theories are strongly equivalent to logic programs","volume":"6","author":"Cabalar","year":"2007","journal-title":"TPLP 7"},{"key":"S1471068419000346_ref6","unstructured":"Delgrande, J. P. and Wang, K. 2015. A syntax-independent approach to forgetting in disjunctive logic programs. In Procs. of AAAI. AAAI Press, 1482\u20131488."},{"key":"S1471068419000346_ref10","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, R. , Janhunen, T. , Knorr, M. , Leite, J. , and Woltran, S. 2019. Forgetting in modular answer set programming. In Procs. of AAAI. AAAI Press.","DOI":"10.1609\/aaai.v33i01.33012843"},{"key":"S1471068419000346_ref22","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 Trans. Comput. Log. 2,"},{"key":"S1471068419000346_ref1","unstructured":"Alferes, J. J. , Knorr, M. , and Wang, K. 2013. Forgetting under the well-founded semantics. In Procs. of LPNMR. LNCS, vol. 8148. Springer, 36\u201341."},{"key":"S1471068419000346_ref25","unstructured":"Rajaratnam, D. , Levesque, H. J. , Pagnucco, M. , and Thielscher, M. 2014. Forgetting in action. In Procs. of KR. AAAI Press."},{"key":"S1471068419000346_ref14","first-page":"837","article-title":"When you must forget: Beyond strong persistence when forgetting in answer set programming","volume":"5","author":"Gon\u00e7alves","year":"2017","journal-title":"TPLP 17"},{"key":"S1471068419000346_ref21","unstructured":"Leite, J. 2017. A bird\u2019s-eye view of forgetting in answer-set programming. In Procs. of LPNMR. LNCS, vol. 10377. Springer, 10\u201322."},{"key":"S1471068419000346_ref19","unstructured":"Lang, J. , Liberatore, P. , and Marquis, P. 2003. Propositional independence: Formula-variable independence and forgetting. J. Artif. Intell. Res. (JAIR) 18, 391\u2013443."},{"key":"S1471068419000346_ref5","unstructured":"Cabalar, P. , Pearce, D. , and Valverde, A. 2007. Minimal logic programs. In Procs. of ICLP. Springer."},{"key":"S1471068419000346_ref23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0004-3702(96)00044-6","article-title":"How to progress a database","volume":"1","author":"Lin","year":"1997","journal-title":"Artif. Intell. 92"},{"key":"S1471068419000346_ref18","unstructured":"Kontchakov, R. , Wolter, F. , and Zakharyaschev, M. 2010. Logic-based ontology comparison and module extraction, with an application to dl-lite. Artif. Intell. 174, 15, 1093\u20131141."},{"key":"S1471068419000346_ref7","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s13218-018-0564-6","article-title":"A brief survey on forgetting from a knowledge representation and reasoning perspective","volume":"1","author":"Eiter","year":"2019","journal-title":"KI - K\u00fcnstliche Intelligenz 33"},{"key":"S1471068419000346_ref11","unstructured":"Gon\u00e7alves, R. , Knorr, M. , and Leite, J. 2016a. The ultimate guide to forgetting in answer set programming. In Procs. of KR. AAAI Press, 135\u2013144."},{"key":"S1471068419000346_ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.07.005"},{"key":"S1471068419000346_ref28","unstructured":"Wang, Y. , Zhang, Y. , Zhou, Y. , and Zhang, M. 2014. Knowledge forgetting in answer set programming. J. Artif. Intell. Res. (JAIR) 50, 31\u201370."},{"key":"S1471068419000346_ref27","unstructured":"Wang, Y. , Wang, K. , and Zhang, M. 2013. Forgetting for answer set programs revisited. In Procs. of IJCAI. IJCAI\/AAAI, 1162\u20131168."},{"key":"S1471068419000346_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-010-9187-9"},{"key":"S1471068419000346_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2006.02.002"},{"key":"S1471068419000346_ref2","unstructured":"Berthold, M. , Gon\u00e7alves, R. , Knorr, M. , and Leite, J. 2019. A syntactic operator for forgetting that satisfies strong persistence. CoRR abs\/1907.12501."},{"key":"S1471068419000346_ref3","first-page":"1","article-title":"Semantics of (disjunctive) logic programs based on partial evaluation","volume":"1","author":"Brass","year":"1999","journal-title":"J. Log. Program. 40"},{"key":"S1471068419000346_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.05.002"},{"key":"S1471068419000346_ref9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"3","author":"Gelfond","year":"1991","journal-title":"New Generation Comput. 9"},{"key":"S1471068419000346_ref12","unstructured":"Gon\u00e7alves, R. , Knorr, M. , and Leite, J. 2016b. You can\u2019t always forget what you want: on the limits of forgetting in answer set programming. In Procs. of ECAI. IOS Press, 957\u2013965."},{"key":"S1471068419000346_ref15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","article-title":"Negation as failure in the head","volume":"1","author":"Inoue","year":"1998","journal-title":"J. Log. Program. 35"},{"key":"S1471068419000346_ref16","doi-asserted-by":"crossref","unstructured":"Inoue, K. and Sakama, C. 2004. Equivalence of logic programs under updates. In Procs. of JELIA. Springer.","DOI":"10.1007\/978-3-540-30227-8_17"},{"key":"S1471068419000346_ref17","unstructured":"Knorr, M. and Alferes, J. J. 2014. Preserving strong equivalence while forgetting. In Procs. of JELIA. LNCS, vol. 8761. Springer, 412\u2013425."},{"key":"S1471068419000346_ref20","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.artint.2010.04.023","article-title":"Reasoning under inconsistency: A forgetting-based approach","volume":"12","author":"Lang","year":"2010","journal-title":"Artif. Intell. 174"},{"key":"S1471068419000346_ref24","unstructured":"Liu, Y. and Wen, X. 2011. On the progression of knowledge in the situation calculus. In Procs. of IJCAI. IJCAI\/AAAI, 976\u2013982."},{"key":"S1471068419000346_ref26","doi-asserted-by":"crossref","unstructured":"Slota, M. and Leite, J. 2011. Back and forth between rules and se-models. In Procs. of LPNMR. Springer.","DOI":"10.1007\/978-3-642-20895-9_16"}],"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\/S1471068419000346","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T08:30:59Z","timestamp":1571128259000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068419000346\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":31,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["S1471068419000346"],"URL":"http:\/\/dx.doi.org\/10.1017\/s1471068419000346","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}
