{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T21:02:57Z","timestamp":1772830977563,"version":"3.50.1"},"publisher-location":"Cham","reference-count":45,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319616599","type":"print"},{"value":"9783319616605","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61660-5_2","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T09:22:22Z","timestamp":1498555342000},"page":"10-22","source":"Crossref","is-referenced-by-count":8,"title":["A Bird\u2019s-Eye View of Forgetting in Answer-Set Programming"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o","family":"Leite","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"2_CR1","unstructured":"Goncalves, R., Knorr, M., Leite, J.: The ultimate guide to forgetting in answer set programming. In: Baral, C., Delgrande, J., Wolter, F. (eds.) Proceedings of KR, pp. 135\u2013144. AAAI Press (2016)"},{"key":"2_CR2","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: You can\u2019t always forget what you want: on the limits of forgetting in answer set programming. In: Fox, M.S., Kaminka, G.A. (eds.) Proceedings of ECAI. IOS Press (2016)"},{"key":"2_CR3","unstructured":"European Parliament: General data protection regulation. Official Journal of the European Union L119\/59, May 2016"},{"issue":"1\u20132","key":"2_CR4","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0004-3702(96)00044-6","volume":"92","author":"F Lin","year":"1997","unstructured":"Lin, F., Reiter, R.: How to progress a database. Artif. Intell. 92(1\u20132), 131\u2013167 (1997)","journal-title":"Artif. Intell."},{"key":"2_CR5","unstructured":"Liu, Y., Wen, X.: On the progression of knowledge in the situation calculus. In: Walsh, T. (ed.) Proceedings of IJCAI, IJCAI\/AAAI, pp. 976\u2013982 (2011)"},{"key":"2_CR6","unstructured":"Rajaratnam, D., Levesque, H.J., Pagnucco, M., Thielscher, M.: Forgetting in action. In: Baral, C., Giacomo, G.D., Eiter, T. (eds.) Proceedings of KR. AAAI Press (2014)"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.1113","volume":"18","author":"J Lang","year":"2003","unstructured":"Lang, J., Liberatore, P., Marquis, P.: Propositional independence: formula-variable independence and forgetting. J. Artif. Intell. Res. (JAIR) 18, 391\u2013443 (2003)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"8\u20139","key":"2_CR8","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.artint.2006.02.002","volume":"170","author":"Y Zhang","year":"2006","unstructured":"Zhang, Y., Foo, N.Y.: Solving logic program conflict through strong and weak forgettings. Artif. Intell. 170(8\u20139), 739\u2013778 (2006)","journal-title":"Artif. Intell."},{"issue":"14","key":"2_CR9","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.artint.2008.05.002","volume":"172","author":"T Eiter","year":"2008","unstructured":"Eiter, T., Wang, K.: Semantic forgetting in answer set programming. Artif. Intell. 172(14), 1644\u20131672 (2008)","journal-title":"Artif. Intell."},{"issue":"12\u201313","key":"2_CR10","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.artint.2010.04.023","volume":"174","author":"J Lang","year":"2010","unstructured":"Lang, J., Marquis, P.: Reasoning under inconsistency: a forgetting-based approach. Artif. Intell. 174(12\u201313), 799\u2013823 (2010)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"2_CR11","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-010-9187-9","volume":"58","author":"Z Wang","year":"2010","unstructured":"Wang, Z., Wang, K., Topor, R.W., Pan, J.Z.: Forgetting for knowledge bases in DL-Lite. Ann. Math. Artif. Intell. 58(1\u20132), 117\u2013151 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"15","key":"2_CR12","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/j.artint.2010.06.003","volume":"174","author":"R Kontchakov","year":"2010","unstructured":"Kontchakov, R., Wolter, F., Zakharyaschev, M.: Logic-based ontology comparison and module extraction, with an application to dl-lite. Artif. Intell. 174(15), 1093\u20131141 (2010)","journal-title":"Artif. Intell."},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1613\/jair.3552","volume":"44","author":"B Konev","year":"2012","unstructured":"Konev, B., Ludwig, M., Walther, D., Wolter, F.: The logical difference for the lightweight description logic EL. J. Artif. Intell. Res. (JAIR) 44, 633\u2013708 (2012)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.artint.2013.07.004","volume":"203","author":"B Konev","year":"2013","unstructured":"Konev, B., Lutz, C., Walther, D., Wolter, F.: Model-theoretic inseparability and modularity of description logic ontologies. Artif. Intell. 203, 66\u2013103 (2013)","journal-title":"Artif. Intell."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Lewis, C.I.: A survey of symbolic logic. University of California Press (1918). Republished by Dover (1960)","DOI":"10.1525\/9780520398252"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/3-540-10009-1_7","volume-title":"5th Conference on Automated Deduction","author":"WW Bledsoe","year":"1980","unstructured":"Bledsoe, W.W., Hines, L.M.: Variable elimination and chaining in a resolution-based prover for inequalities. In: Bibel, W., Kowalski, R. (eds.) CADE 1980. LNCS, vol. 87, pp. 70\u201387. Springer, Heidelberg (1980). doi: 10.1007\/3-540-10009-1_7"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45349-0_22","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"J Larrosa","year":"2000","unstructured":"Larrosa, J.: Boosting search with variable elimination. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 291\u2013305. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45349-0_22"},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.1541","volume":"23","author":"J Larrosa","year":"2005","unstructured":"Larrosa, J., Morancho, E., Niso, D.: On the practical use of variable elimination in constraint optimization problems: \u2018still-life\u2019 as a case study. J. Artif. Intell. Res. (JAIR) 23, 421\u2013440 (2005)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"1&2","key":"2_CR19","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","volume":"167","author":"A Middeldorp","year":"1996","unstructured":"Middeldorp, A., Okui, S., Ida, T.: Lazy narrowing: strong completeness and eager variable elimination. Theor. Comput. Sci. 167(1&2), 95\u2013130 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"2_CR20","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1093\/logcom\/exm049","volume":"17","author":"Y Moinard","year":"2007","unstructured":"Moinard, Y.: Forgetting literals with varying propositional symbols. J. Log. Comput. 17(5), 955\u2013982 (2007)","journal-title":"J. Log. Comput."},{"key":"2_CR21","unstructured":"Weber, A.: Updating propositional formulas. In: Expert Database Conference, pp. 487\u2013500 (1986)"},{"issue":"1\u20133","key":"2_CR22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0743-1066(99)00065-5","volume":"45","author":"JJ Alferes","year":"2000","unstructured":"Alferes, J.J., Leite, J.A., Pereira, L.M., Przymusinska, H., Przymusinski, T.C.: Dynamic updates of non-monotonic knowledge bases. J. Logic Program. 45(1\u20133), 43\u201370 (2000)","journal-title":"J. Logic Program."},{"issue":"6","key":"2_CR23","first-page":"721","volume":"2","author":"T Eiter","year":"2002","unstructured":"Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: On properties of update sequences based on causal rejection. Theor. Pract. Logic Program. (TPLP) 2(6), 721\u2013777 (2002)","journal-title":"Theor. Pract. Logic Program. (TPLP)"},{"issue":"6","key":"2_CR24","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1017\/S1471068403001716","volume":"3","author":"C Sakama","year":"2003","unstructured":"Sakama, C., Inoue, K.: An abductive framework for computing knowledge base updates. Theor. Pract. Logic Program. (TPLP) 3(6), 671\u2013713 (2003)","journal-title":"Theor. Pract. Logic Program. (TPLP)"},{"key":"2_CR25","unstructured":"Slota, M., Leite, J.: Robust equivalence models for semantic updates of answer-set programs. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceeding of KR, pp. 158\u2013168. AAAI Press (2012)"},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-33353-8_29","volume-title":"Logics in Artificial Intelligence","author":"M Slota","year":"2012","unstructured":"Slota, M., Leite, J.: A unifying perspective on knowledge updates. In: Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 372\u2013384. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33353-8_29"},{"issue":"2","key":"2_CR27","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/2480759.2480766","volume":"14","author":"JP Delgrande","year":"2013","unstructured":"Delgrande, J.P., Schaub, T., Tompits, H., Woltran, S.: A model-theoretic approach to belief change in answer set programming. ACM Trans. Comput. Log. 14(2), 14 (2013)","journal-title":"ACM Trans. Comput. Log."},{"issue":"6","key":"2_CR28","first-page":"869","volume":"14","author":"M Slota","year":"2014","unstructured":"Slota, M., Leite, J.: The rise and fall of semantic rule updates based on SE-models. TPLP 14(6), 869\u2013907 (2014)","journal-title":"TPLP"},{"key":"2_CR29","unstructured":"Wong, K.S.: Forgetting in Logic Programs. Ph.D. thesis, The University of New South Wales (2009)"},{"key":"2_CR30","unstructured":"Wang, Y., Zhang, Y., Zhou, Y., Zhang, M.: Forgetting in logic programs under strong equivalence. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) Proceedings of KR, pp. 643\u2013647. AAAI Press (2012)"},{"key":"2_CR31","unstructured":"Wang, Y., Wang, K., Zhang, M.: Forgetting for answer set programs revisited. In: Rossi, F. (ed.) Proceedings of IJCAI, IJCAI\/AAAI (2013)"},{"key":"2_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-11558-0_29","volume-title":"Logics in Artificial Intelligence","author":"M Knorr","year":"2014","unstructured":"Knorr, M., Alferes, J.J.: Preserving strong equivalence while forgetting. In: Ferm\u00e9, E., Leite, J. (eds.) JELIA 2014. LNCS, vol. 8761, pp. 412\u2013425. Springer, Cham (2014). doi: 10.1007\/978-3-319-11558-0_29"},{"key":"2_CR33","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1613\/jair.4297","volume":"50","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Zhang, Y., Zhou, Y., Zhang, M.: Knowledge forgetting in answer set programming. J. Artif. Intell. Res. (JAIR) 50, 31\u201370 (2014)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Delgrande, J.P., Wang, K.: A syntax-independent approach to forgetting in disjunctive logic programs. In: Bonet, B., Koenig, S. (eds.) Proceedings of AAAI, pp. 1482\u20131488. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9402"},{"issue":"16\u201317","key":"2_CR35","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1016\/j.artint.2009.07.005","volume":"173","author":"Y Zhang","year":"2009","unstructured":"Zhang, Y., Zhou, Y.: Knowledge forgetting: properties and applications. Artif. Intell. 173(16\u201317), 1525\u20131537 (2009)","journal-title":"Artif. Intell."},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-319-48758-8_37","volume-title":"Logics in Artificial Intelligence","author":"R Gon\u00e7alves","year":"2016","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: Forgetting in ASP: the forgotten properties. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS, vol. 10021, pp. 543\u2013550. Springer, Cham (2016). doi: 10.1007\/978-3-319-48758-8_37"},{"key":"2_CR37","unstructured":"Gon\u00e7alves, R., Knorr, M., Leite, J.: On some properties of forgetting in ASP. In: Booth, R., Casini, G., Klarman, S., Richard, G., Varzinczak, I.J. (eds.) Proceedings of the International Workshop on Defeasible and Ampliative Reasoning (DARe-16). CEUR Workshop Proceedings, vol. 1626. CEUR-WS.org (2016)"},{"issue":"1","key":"2_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","volume":"40","author":"S Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. J. Log. Program. 40(1), 1\u201346 (1999)","journal-title":"J. Log. Program."},{"key":"2_CR39","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.2472","volume":"31","author":"KS Wong","year":"2008","unstructured":"Wong, K.S.: Sound and complete inference rules for SE-consequence. J. Artif. Intell. Res. (JAIR) 31, 205\u2013216 (2008)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Log. 8(3) (2007)","DOI":"10.1145\/1243996.1244000"},{"key":"2_CR41","unstructured":"Lifschitz, V.: What is answer set programming? In: Fox, D., Gomes, C.P. (eds.) Proceedings of AAAI, pp. 1594\u20131597. AAAI Press (2008)"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Sagiv, Y.: Optimizing datalog programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659\u2013698. Morgan Kaufmann (1988)","DOI":"10.1016\/B978-0-934613-40-8.50021-X"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224\u2013238. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-24599-5_16"},{"issue":"3\u20134","key":"2_CR44","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25(3\u20134), 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"4","key":"2_CR45","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Trans. Comput. Log. 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61660-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T00:43:49Z","timestamp":1719276229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61660-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319616599","9783319616605"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61660-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}