{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:00:02Z","timestamp":1758268802752,"version":"3.44.0"},"reference-count":71,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,9,1]],"date-time":"2024-09-01T00:00:00Z","timestamp":1725148800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1016\/j.artint.2020.103307","type":"journal-article","created":{"date-parts":[[2020,6,10]],"date-time":"2020-06-10T13:30:43Z","timestamp":1591795843000},"page":"103307","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["On the limits of forgetting in Answer Set Programming"],"prefix":"10.1016","volume":"286","author":[{"given":"Ricardo","family":"Gon\u00e7alves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Knorr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o","family":"Leite","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2020.103307_br0010","series-title":"ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence","first-page":"957","article-title":"You can't always forget what you want: on the limits of forgetting in answer set programming","author":"Gon\u00e7alves","year":"2016"},{"issue":"5\u20136","key":"10.1016\/j.artint.2020.103307_br0020","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S1471068417000382","article-title":"When you must forget: beyond strong persistence when forgetting in answer set programming","volume":"17","author":"Gon\u00e7alves","year":"2017","journal-title":"Theory Pract. Log. Program."},{"year":"1885","series-title":"\u00dcber das Ged\u00e4chtnis. Untersuchungen zur experimentellen Psychologie","author":"Ebbinghaus","key":"10.1016\/j.artint.2020.103307_br0030"},{"key":"10.1016\/j.artint.2020.103307_br0040","article-title":"Meaning and causes of forgetting","author":"Shrestha","year":"2017","journal-title":"Psychstudy"},{"issue":"3","key":"10.1016\/j.artint.2020.103307_br0050","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.neuron.2017.05.039","article-title":"The biology of forgetting - a perspective","volume":"95","author":"Davis","year":"2017","journal-title":"Neuron"},{"issue":"6","key":"10.1016\/j.artint.2020.103307_br0060","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1016\/j.neuron.2017.04.037","article-title":"The persistence and transience of memory","volume":"94","author":"Richards","year":"2017","journal-title":"Neuron"},{"key":"10.1016\/j.artint.2020.103307_br0070","article-title":"Intentional forgetting in organizations: the importance of eliminating retrieval cues for implementing new routines","volume":"01","author":"Kluge","year":"2018","journal-title":"Front. Psychol."},{"key":"10.1016\/j.artint.2020.103307_br0080","article-title":"General data protection regulation","volume":"L119\/59","year":"2016","journal-title":"Off. J. Eur. Union"},{"issue":"1","key":"10.1016\/j.artint.2020.103307_br0090","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s13218-018-00574-x","article-title":"Intentional forgetting: an emerging field in ai and beyond","volume":"33","author":"Beierle","year":"2019","journal-title":"K\u00fcnstl. Intell."},{"issue":"1","key":"10.1016\/j.artint.2020.103307_br0100","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":"33","author":"Eiter","year":"2019","journal-title":"K\u00fcnstl. Intell."},{"issue":"1\u20132","key":"10.1016\/j.artint.2020.103307_br0110","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0004-3702(96)00044-6","article-title":"How to progress a database","volume":"92","author":"Lin","year":"1997","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0120","series-title":"IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence","first-page":"976","article-title":"On the progression of knowledge in the situation calculus","author":"Liu","year":"2011"},{"key":"10.1016\/j.artint.2020.103307_br0130","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference","first-page":"498","article-title":"Forgetting in action","author":"Rajaratnam","year":"2014"},{"key":"10.1016\/j.artint.2020.103307_br0140","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.1113","article-title":"Propositional independence: formula-variable independence and forgetting","volume":"18","author":"Lang","year":"2003","journal-title":"J. Artif. Intell. Res."},{"issue":"8\u20139","key":"10.1016\/j.artint.2020.103307_br0150","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1016\/j.artint.2006.02.002","article-title":"Solving logic program conflict through strong and weak forgettings","volume":"170","author":"Zhang","year":"2006","journal-title":"Artif. Intell."},{"issue":"14","key":"10.1016\/j.artint.2020.103307_br0160","doi-asserted-by":"crossref","first-page":"1644","DOI":"10.1016\/j.artint.2008.05.002","article-title":"Semantic forgetting in answer set programming","volume":"172","author":"Eiter","year":"2008","journal-title":"Artif. Intell."},{"issue":"12\u201313","key":"10.1016\/j.artint.2020.103307_br0170","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":"174","author":"Lang","year":"2010","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0180","series-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","first-page":"1482","article-title":"A syntax-independent approach to forgetting in disjunctive logic programs","author":"Delgrande","year":"2015"},{"issue":"1\u20132","key":"10.1016\/j.artint.2020.103307_br0190","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10472-010-9187-9","article-title":"Forgetting for knowledge bases in DL-lite","volume":"58","author":"Wang","year":"2010","journal-title":"Ann. Math. Artif. Intell."},{"issue":"15","key":"10.1016\/j.artint.2020.103307_br0200","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1016\/j.artint.2010.06.003","article-title":"Logic-based ontology comparison and module extraction, with an application to dl-lite","volume":"174","author":"Kontchakov","year":"2010","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0210","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1613\/jair.3552","article-title":"The logical difference for the lightweight description logic EL","volume":"44","author":"Konev","year":"2012","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2020.103307_br0220","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.artint.2013.07.004","article-title":"Model-theoretic inseparability and modularity of description logic ontologies","volume":"203","author":"Konev","year":"2013","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0230","series-title":"Procs. of ICLP","article-title":"The stable model semantics for logic programming","author":"Gelfond","year":"1988"},{"issue":"3\u20134","key":"10.1016\/j.artint.2020.103307_br0240","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Gener. Comput."},{"issue":"2","key":"10.1016\/j.artint.2020.103307_br0250","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"The Potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Commun."},{"issue":"3","key":"10.1016\/j.artint.2020.103307_br0260","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","article-title":"The DLV system for knowledge representation and reasoning","volume":"7","author":"Leone","year":"2006","journal-title":"ACM Trans. Comput. Log."},{"year":"1918","series-title":"A Survey of Symbolic Logic","author":"Lewis","key":"10.1016\/j.artint.2020.103307_br0270"},{"key":"10.1016\/j.artint.2020.103307_br0280","series-title":"5th Conference on Automated Deduction","first-page":"70","article-title":"Variable elimination and chaining in a resolution-based prover for inequalities","volume":"vol. 87","author":"Bledsoe","year":"1980"},{"key":"10.1016\/j.artint.2020.103307_br0290","series-title":"Principles and Practice of Constraint Programming - CP 2000, 6th International Conference","first-page":"291","article-title":"Boosting search with variable elimination","volume":"vol. 1894","author":"Larrosa","year":"2000"},{"key":"10.1016\/j.artint.2020.103307_br0300","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1613\/jair.1541","article-title":"On the practical use of variable elimination in constraint optimization problems: \u2018still-life\u2019 as a case study","volume":"23","author":"Larrosa","year":"2005","journal-title":"J. Artif. Intell. Res."},{"issue":"1&2","key":"10.1016\/j.artint.2020.103307_br0310","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(96)00071-0","article-title":"Lazy narrowing: strong completeness and eager variable elimination","volume":"167","author":"Middeldorp","year":"1996","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"10.1016\/j.artint.2020.103307_br0320","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1093\/logcom\/exm049","article-title":"Forgetting literals with varying propositional symbols","volume":"17","author":"Moinard","year":"2007","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.artint.2020.103307_br0330","series-title":"Expert Database Systems, Proceedings from the First International Conference","first-page":"487","article-title":"Updating propositional formulas","author":"Weber","year":"1986"},{"year":"2008","series-title":"Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications","author":"Gabbay","key":"10.1016\/j.artint.2020.103307_br0340"},{"issue":"1\u20133","key":"10.1016\/j.artint.2020.103307_br0350","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0743-1066(99)00065-5","article-title":"Dynamic updates of non-monotonic knowledge bases","volume":"45","author":"Alferes","year":"2000","journal-title":"J. Log. Program."},{"issue":"6","key":"10.1016\/j.artint.2020.103307_br0360","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1017\/S1471068401001247","article-title":"On properties of update sequences based on causal rejection","volume":"2","author":"Eiter","year":"2002","journal-title":"Theory Pract. Log. Program."},{"issue":"6","key":"10.1016\/j.artint.2020.103307_br0370","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1017\/S1471068403001716","article-title":"An abductive framework for computing knowledge base updates","volume":"3","author":"Sakama","year":"2003","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.artint.2020.103307_br0380","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference","first-page":"158","article-title":"Robust equivalence models for semantic updates of answer-set programs","author":"Slota","year":"2012"},{"key":"10.1016\/j.artint.2020.103307_br0390","series-title":"Logics in Artificial Intelligence - 13th European Conference","first-page":"372","article-title":"A unifying perspective on knowledge updates","volume":"vol. 7519","author":"Slota","year":"2012"},{"issue":"2","key":"10.1016\/j.artint.2020.103307_br0400","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/2480759.2480766","article-title":"A model-theoretic approach to belief change in answer set programming","volume":"14","author":"Delgrande","year":"2013","journal-title":"ACM Trans. Comput. Log."},{"issue":"6","key":"10.1016\/j.artint.2020.103307_br0410","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1017\/S1471068413000100","article-title":"The rise and fall of semantic rule updates based on se-models","volume":"14","author":"Slota","year":"2014","journal-title":"Theory Pract. Log. Program."},{"year":"2009","series-title":"Forgetting in logic programs","author":"Wong","key":"10.1016\/j.artint.2020.103307_br0420"},{"key":"10.1016\/j.artint.2020.103307_br0430","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference","first-page":"643","article-title":"Forgetting in logic programs under strong equivalence","author":"Wang","year":"2012"},{"key":"10.1016\/j.artint.2020.103307_br0440","series-title":"IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence","first-page":"1163","article-title":"Forgetting for answer set programs revisited","author":"Wang","year":"2013"},{"key":"10.1016\/j.artint.2020.103307_br0450","series-title":"Logics in Artificial Intelligence - 14th European Conference","first-page":"412","article-title":"Preserving strong equivalence while forgetting","volume":"vol. 8761","author":"Knorr","year":"2014"},{"key":"10.1016\/j.artint.2020.103307_br0460","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1613\/jair.4297","article-title":"Knowledge forgetting in answer set programming","volume":"50","author":"Wang","year":"2014","journal-title":"J. Artif. Intell. Res."},{"issue":"16\u201317","key":"10.1016\/j.artint.2020.103307_br0470","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1016\/j.artint.2009.07.005","article-title":"Knowledge forgetting: properties and applications","volume":"173","author":"Zhang","year":"2009","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.artint.2020.103307_br0480","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","article-title":"Semantics of (disjunctive) logic programs based on partial evaluation","volume":"40","author":"Brass","year":"1999","journal-title":"J. Log. Program."},{"key":"10.1016\/j.artint.2020.103307_br0490","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference","first-page":"135","article-title":"The ultimate guide to forgetting in answer set programming","author":"Gon\u00e7alves","year":"2016"},{"issue":"3","key":"10.1016\/j.artint.2020.103307_br0500","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1243996.1244000","article-title":"Semantical characterizations and complexity of equivalences in answer set programming","volume":"8","author":"Eiter","year":"2007","journal-title":"ACM Trans. Comput. Log."},{"issue":"3\u20134","key":"10.1016\/j.artint.2020.103307_br0510","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1018978005636","article-title":"Nested expressions in logic programs","volume":"25","author":"Lifschitz","year":"1999","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3\u20134","key":"10.1016\/j.artint.2020.103307_br0520","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Gener. Comput."},{"key":"10.1016\/j.artint.2020.103307_br0530","article-title":"Die Formalen Regeln der Intuitionistischen Logik","author":"Heyting","year":"1930","journal-title":"Sitz.ber. Preuss. Akad. Wiss. Phys.-Math. Kl."},{"issue":"1","key":"10.1016\/j.artint.2020.103307_br0540","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0743-1066(98)10015-8","article-title":"Stable inference as intuitionistic validity","volume":"38","author":"Pearce","year":"1999","journal-title":"J. Log. Program."},{"issue":"4","key":"10.1016\/j.artint.2020.103307_br0550","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1145\/383779.383783","article-title":"Strongly equivalent logic programs","volume":"2","author":"Lifschitz","year":"2001","journal-title":"ACM Trans. Comput. Log."},{"issue":"6","key":"10.1016\/j.artint.2020.103307_br0560","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1017\/S1471068407003110","article-title":"Propositional theories are strongly equivalent to logic programs","volume":"7","author":"Cabalar","year":"2007","journal-title":"Theory Pract. Log. Program."},{"key":"10.1016\/j.artint.2020.103307_br0570","series-title":"IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","first-page":"97","article-title":"On solution correspondences in answer-set programming","author":"Eiter","year":"2005"},{"key":"10.1016\/j.artint.2020.103307_br0580","series-title":"Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference","first-page":"447","article-title":"On eliminating disjunctions in stable logic programming","author":"Eiter","year":"2004"},{"key":"10.1016\/j.artint.2020.103307_br0590","series-title":"Logic Programming and Nonmonotonic Reasoning, 7th International Conference","first-page":"87","article-title":"Simplifying logic programs under uniform and strong equivalence","volume":"vol. 2923","author":"Eiter","year":"2004"},{"issue":"3\u20134","key":"10.1016\/j.artint.2020.103307_br0600","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","article-title":"On the computational cost of disjunctive logic programming: propositional case","volume":"15","author":"Eiter","year":"1995","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0610","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.2472","article-title":"Sound and complete inference rules for SE-consequence","volume":"31","author":"Wong","year":"2008","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2020.103307_br0620","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1613\/jair.5530","article-title":"A knowledge level account of forgetting","volume":"60","author":"Delgrande","year":"2017","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2020.103307_br0630","series-title":"Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning","article-title":"Forgetting auxiliary atoms in forks","volume":"vol. 1868","author":"Aguado","year":"2017"},{"key":"10.1016\/j.artint.2020.103307_br0640","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.artint.2019.07.005","article-title":"Forgetting auxiliary atoms in forks","volume":"275","author":"Aguado","year":"2019","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0650","series-title":"Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence","first-page":"1594","article-title":"What is answer set programming?","author":"Lifschitz","year":"2008"},{"key":"10.1016\/j.artint.2020.103307_br0660","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","article-title":"Modularity aspects of disjunctive stable models","volume":"35","author":"Janhunen","year":"2009","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.artint.2020.103307_br0670","series-title":"The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence","first-page":"2843","article-title":"Forgetting in modular answer set programming","author":"Gon\u00e7alves","year":"2019"},{"issue":"5\u20136","key":"10.1016\/j.artint.2020.103307_br0680","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1017\/S1471068419000346","article-title":"A syntactic operator for forgetting that satisfies strong persistence","volume":"19","author":"Berthold","year":"2019","journal-title":"Theory Pract. Log. Program."},{"issue":"16\u201317","key":"10.1016\/j.artint.2020.103307_br0690","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1016\/j.artint.2010.08.004","article-title":"Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs","volume":"174","author":"Truszczynski","year":"2010","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2020.103307_br0700","series-title":"Logic Programming and Nonmonotonic Reasoning, 12th International Conference","first-page":"36","article-title":"Forgetting under the well-founded semantics","volume":"vol. 8148","author":"Alferes","year":"2013"},{"issue":"3","key":"10.1016\/j.artint.2020.103307_br0710","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"J. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370220300631?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370220300631?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T07:22:07Z","timestamp":1757748127000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370220300631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":71,"alternative-id":["S0004370220300631"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2020.103307","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the limits of forgetting in Answer Set Programming","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2020.103307","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2020 Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"103307"}}