Hostname: page-component-cc8bf7c57-n7pht Total loading time: 0 Render date: 2024-12-11T22:10:58.143Z Has data issue: false hasContentIssue false
  • English
  • Français

Forgetting in Answer Set Programming – A Survey

Published online by Cambridge University Press:  27 December 2021

RICARDO GONÇALVES Open the ORCID record for RICARDO GONÇALVES [Opens in a new window] ,
MATTHIAS KNORR Open the ORCID record for MATTHIAS KNORR [Opens in a new window]  and
JOÃO LEITE Open the ORCID record for JOÃO LEITE [Opens in a new window]
RICARDO GONÇALVES
Affiliation:
NOVA LINCS, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Portugal (e-mails: [email protected]@fct.unl.pt, [email protected]@fct.unl.pt, [email protected]@fct.unl.pt)
MATTHIAS KNORR
Affiliation:
NOVA LINCS, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Portugal (e-mails: [email protected]@fct.unl.pt, [email protected]@fct.unl.pt, [email protected]@fct.unl.pt)
JOÃO LEITE
Affiliation:
NOVA LINCS, Departamento de Informática, Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Portugal (e-mails: [email protected]@fct.unl.pt, [email protected]@fct.unl.pt, [email protected]@fct.unl.pt)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Forgetting – or variable elimination – is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this article, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.

Keywords

forgettinganswer set programminglogic programs
Type
Original Article
Information
Theory and Practice of Logic Programming , Volume 23 , Issue 1 , January 2023 , pp. 111 - 156
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press

References

Aguado, F., Cabalar, P., Fandinno, J., Pearce, D., Pérez, G. and Vidal, C. 2019. Forgetting auxiliary atoms in forks. Artificial Intelligence 275, 575–601.CrossRefGoogle Scholar
Alferes, J. J., Knorr, M. and Wang, K. 2013. Forgetting under the Well-Founded Semantics. In Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Proceedings, P. Cabalar and T. C. Son, Eds. Lecture Notes in Computer Science, vol. 8148. Springer, 36–41.Google Scholar
Alferes, J. J., Leite, J. A., Pereira, L. M., Przymusinska, H. and Przymusinski, T. C. 2000. Dynamic updates of non-monotonic knowledge bases. Journal of Logic Programmming 45, 1–3, 43–70.CrossRefGoogle Scholar
Alviano, M., Calimeri, F., Dodaro, C., Fuscà, D., Leone, N., Perri, S., Ricca, F., Veltri, P. and Zangari, J. 2017. The ASP system DLV2. In Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Proceedings, M. Balduccini and T. Janhunen, Eds. Lecture Notes in Computer Science, vol. 10377. Springer, 215–221.Google Scholar
Baral, C. and Zhang, Y. 2005. Knowledge updates: Semantics and complexity issues. Artificial Intelligence 164, 1–2, 209–243.CrossRefGoogle Scholar
Beierle, C. and Timm, I. J. 2019. Intentional forgetting: An emerging field in AI and beyond. Künstliche Intelligenz 33, 1, 5–8.CrossRefGoogle Scholar
Berthold, M., Gonçalves, R., Knorr, M. and Leite, J. 2019a. Forgetting in Answer Set Programming with anonymous cycles. In Progress in Artificial Intelligence, 19th EPIA Conference on Artificial Intelligence, EPIA 2019, Proceedings, Part II, P. M. Oliveira, P. Novais and L. P. Reis, Eds. Lecture Notes in Computer Science, vol. 11805. Springer, 552–565.Google Scholar
Berthold, M., Gonçalves, R., Knorr, M. and Leite, J. 2019b. A syntactic operator for forgetting that satisfies strong persistence. Theory and Practice of Logic Programming 19, 5–6, 1038–1055.CrossRefGoogle Scholar
Bledsoe, W. W. and Hines, L. M. 1980. Variable elimination and chaining in a resolution-based prover for inequalities. In 5th Conference on Automated Deduction, Proceedings, W. Bibel and R. A. Kowalski, Eds. Lecture Notes in Computer Science, vol. 87. Springer, 70–87.Google Scholar
Boole, G. 1854. An Investigation of The Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities. Macmillian, London.CrossRefGoogle Scholar
Brass, S. and Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. Journal of Logic Programming 40, 1, 1–46.Google Scholar
Buccafurri, F., Faber, W. and Leone, N. 2002. Disjuctive logic programs with inheritance. Theory and Practice of Logic Programming 2, 3, 293–321.CrossRefGoogle Scholar
Cabalar, P. and Ferraris, P. 2007. Propositional theories are strongly equivalent to logic programs. Theory and Practice of Logic Programming 7, 6, 745–759.CrossRefGoogle Scholar
Cabalar, P., Pearce, D. and Valverde, A. 2007. Minimal logic programs. In Logic Programming, 23rd International Conference, ICLP 2007, Proceedings, V. Dahl and I. Niemelä, Eds. Lecture Notes in Computer Science, vol. 4670. Springer, 104–118.Google Scholar
Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Computing Surveys 33, 3, 374–425.CrossRefGoogle Scholar
Davis, R. L. and Zhong, Y. 2017. The biology of forgetting - A perspective. Neuron 95, 3, 490–503.CrossRefGoogle Scholar
Delgrande, J. P. 2017. A knowledge level account of forgetting. Journal of Artificial Intelligence Research 60, 1165–1213.CrossRefGoogle Scholar
Delgrande, J. P., Schaub, T., Tompits, H. and Woltran, S. 2013. A model-theoretic approach to belief change in Answer Set Programming. ACM Transactions on Computational Logic 14, 2, 14:1–14:46.Google Scholar
Delgrande, J. P. and Wang, K. 2015. A syntax-independent approach to forgetting in disjuctive logic programs. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, B. Bonet and S. Koenig, Eds. AAAI Press, 1482–1488.Google Scholar
Ebbinghaus, H. 1885. Über das Gedächtnis. Untersuchungen zur experimentellen Psychologie. Duncker & Humblot, Leipzig.Google Scholar
Eiter, T. and Fink, M. 2003. Uniform equivalence of logic programs under the Stable Model Semantics. In Logic Programming, 19th International Conference, ICLP 2003, Proceedings, C. Palamidessi, Ed. Lecture Notes in Computer Science, vol. 2916. Springer, 224–238.Google Scholar
Eiter, T., Fink, M., Sabbatini, G. and Tompits, H. 2002. On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming 2, 6, 711–767.CrossRefGoogle Scholar
Eiter, T., Fink, M. and Woltran, S. 2007. Semantical characterizations and complexity of equivalences in Answer Set Programming. ACM Transactions on Computational Logic 8, 3, 17.CrossRefGoogle Scholar
Eiter, T. and Kern-Isberner, G. 2019. A brief survey on forgetting from a knowledge representation and reasoning perspective. Künstliche Intelligenz 33, 1, 9–33.CrossRefGoogle Scholar
Eiter, T. and Wang, K. 2008. Semantic forgetting in Answer Set Programming. Artificial Intelligence 172, 14, 1644–1672.CrossRefGoogle Scholar
Erdem, E. and Ferraris, P. 2007. Forgetting actions in domain descriptions. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. AAAI Press, 409–414.Google Scholar
European Parliament. 2016. General data protection regulation. Official Journal of the European Union L119/59. Google Scholar
Gabbay, D. M., Pearce, D. and Valverde, A. 2011. Interpolable formulas in Equilibrium Logic and Answer Set Programming. Journal of Artificial Intelligence Research 42, 917–943.Google Scholar
Gabbay, D. M., Schmidt, R. A. and Szalas, A. 2008. Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications. College Publications.Google Scholar
Gebser, M., Kaminski, R., Kaufmann, B., Lühne, P., Obermeier, P., Ostrowski, M., Romero, J., Schaub, T., Schellhorn, S. and Wanko, P. 2018. The Potsdam answer set solving collection 5.0. Künstliche Intelligenz 32, 2–3, 181–182.Google Scholar
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T. and Schneider, M. T. 2011. Potassco: The Potsdam answer set solving collection. AI Communications 24, 2, 107–124.CrossRefGoogle Scholar
Gelfond, M. and Lifschitz, V. 1988. The Stable Model Semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, (2 Volumes), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070–1080.Google Scholar
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3–4, 365–385.CrossRefGoogle Scholar
Ghilardi, S., Lutz, C. and Wolter, F. 2006. Did I damage my ontology? A case for conservative extensions in Description Logics. In Proceedings, Tenth International Conference on Principles of Knowledge Representation and Reasoning, P. Doherty, J. Mylopoulos and C. A. Welty, Eds. AAAI Press, 187–197.Google Scholar
Gonçalves, R., Janhunen, T., Knorr, M. and Leite, J. 2021. On syntactic forgetting under uniform equivalence. In Logics in Artificial Intelligence - 17th European Conference, JELIA 2021, Proceedings, W. Faber, G. Friedrich, M. Gebser and M. Morak, Eds. Lecture Notes in Computer Science, vol. 12678. Springer, 297–312.Google Scholar
Gonçalves, R., Janhunen, T., Knorr, M., Leite, J. and Woltran, S. 2019. Forgetting in Modular Answer Set Programming. In 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, EAAI 2019. AAAI Press, 2843–2850.Google Scholar
Gonçalves, R., Knorr, M., ao Leite, J. and Woltran, S. 2020. On the limits of forgetting in Answer Set Programming. Artificial Intelligence 286, 103–307.Google Scholar
Gonçalves, R., Knorr, M. and Leite, J. 2016a. Forgetting in ASP: the forgotten properties. In Logics in Artificial Intelligence - 15th European Conference, JELIA 2016, Proceedings, L. Michael and A. C. Kakas, Eds. Lecture Notes in Computer Science, vol. 10021. Springer, 543–550.Google Scholar
Gonçalves, R., Knorr, M. and Leite, J. 2016b. The ultimate guide to forgetting in Answer Set Programming. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, C. Baral, J. P. Delgrande and F. Wolter, Eds. AAAI Press, 135–144.Google Scholar
Gonçalves, R., Knorr, M. and Leite, J. 2016c. You can’t always forget what you want: On the limits of forgetting in Answer Set Programming. In ECAI 2016 - 22nd European Conference on Artificial Intelligence - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum and F. van Harmelen, Eds. Frontiers in Artificial Intelligence and Applications, vol. 285. IOS Press, 957–965.Google Scholar
Gonçalves, R., Knorr, M. and Leite, J. 2017. Iterative variable elimination in ASP. In Progress in Artificial Intelligence - 18th EPIA Conference on Artificial Intelligence, EPIA 2017, Proceedings, E. C. Oliveira, J. Gama, Z. A. Vale and H. L. Cardoso, Eds. Lecture Notes in Computer Science, vol. 10423. Springer, 643–656.Google Scholar
Gonçalves, R., Knorr, M., Leite, J. and Woltran, S. 2017. When you must forget: Beyond strong persistence when forgetting in Answer Set Programming. Theory and Practice of Logic Programming 17, 5–6, 837–854.CrossRefGoogle Scholar
Heyting, A. 1930. Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, 42–56.Google Scholar
Janhunen, T., Oikarinen, E., Tompits, H. and Woltran, S. 2009. Modularity aspects of disjunctive stable models. Journal of Artificial Intelligence Research 35, 813–857.CrossRefGoogle Scholar
Ji, J., You, J. and Wang, Y. 2015. On forgetting postulates in Answer Set Programming. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Q. Yang and M. J. Wooldridge, Eds. AAAI Press, 3076–3083.Google Scholar
Kluge, A. and Gronau, N. 2018. Intentional forgetting in organizations: The importance of eliminating retrieval cues for implementing new routines. Frontiers in Psychology 9, 51, 1–17.Google Scholar
Knorr, M. and Alferes, J. J. 2014. Preserving strong equivalence while forgetting. In Logics in Artificial Intelligence - 14th European Conference, JELIA 2014. Proceedings, E. Fermé and J. Leite, Eds. Lecture Notes in Computer Science, vol. 8761. Springer, 412–425.Google Scholar
Konev, B., Ludwig, M., Walther, D. and Wolter, F. 2012. The logical difference for the lightweight description logic EL. Journal of Artificial Intelligence Research 44, 633–708.CrossRefGoogle Scholar
Konev, B., Lutz, C., Walther, D. and Wolter, F. 2013. Model-theoretic inseparability and modularity of description logic ontologies. Artificial Intelligence 203, 66–103.Google Scholar
Konev, B., Walther, D. and Wolter, F. 2009. Forgetting and uniform interpolation in large-scale description logic terminologies. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, C. Boutilier, Ed. IJCAI/AAAI.Google Scholar
Kontchakov, R., Wolter, F. and Zakharyaschev, M. 2010. Logic-based ontology comparison and module extraction, with an application to DL-lite. Artificial Intelligence 174, 15, 1093–1141.CrossRefGoogle Scholar
Lang, J., Liberatore, P. and Marquis, P. 2003. Propositional independence: Formula-variable independence and forgetting. Journal of Artificial Intelligence Research 18, 391–443.CrossRefGoogle Scholar
Lang, J. and Marquis, P. 2002. Resolving inconsistencies by variable forgetting. In Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), D. Fensel, F. Giunchiglia, D. L. McGuinness and M. Williams, Eds. Morgan Kaufmann, 239–250.Google Scholar
Lang, J. and Marquis, P. 2010. Reasoning under inconsistency: A forgetting-based approach. Artificial Intelligence 174, 12–13, 799–823.CrossRefGoogle Scholar
Larrosa, J. 2000. Boosting search with variable elimination. In Principles and Practice of Constraint Programming - CP 2000, 6th International Conference, Proceedings, R. Dechter, Ed. Lecture Notes in Computer Science, vol. 1894. Springer, 291–305.Google Scholar
Larrosa, J., Morancho, E. and Niso, D. 2005. On the practical use of variable elimination in constraint optimization problems: ’still-life’ as a case study. Journal of Artificial Intelligence Research 23, 421–440.CrossRefGoogle Scholar
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S. and Scarcello, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7, 3, 499–562.CrossRefGoogle Scholar
Lifschitz, V., Pearce, D. and Valverde, A. 2001. Strongly equivalent logic programs. ACM Transactions on Computational Logic 2, 4, 526–541.CrossRefGoogle Scholar
Lifschitz, V., Tang, L. R. and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25, 3–4, 369–389.CrossRefGoogle Scholar
Lin, F. and Reiter, R. 1994. Forget it! In AAAI Fall Symposium on Relevance. AAAI Press, 154–159.Google Scholar
Lin, F. and Reiter, R. 1997. How to progress a database. Artificial Intelligence 92, 1–2, 131–167.CrossRefGoogle Scholar
Liu, Y. and Wen, X. 2011. On the progression of knowledge in the Situation Calculus. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, T. Walsh, Ed. IJCAI/AAAI, 976–982.Google Scholar
Lutz, C. and Wolter, F. 2011. Foundations for uniform interpolation and forgetting in expressive description logics. In IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, T. Walsh, Ed. IJCAI/AAAI, 989–995.Google Scholar
Middeldorp, A., Okui, S. and Ida, T. 1996. Lazy narrowing: Strong completeness and eager variable elimination. Theoretical Computer Science 167, 1&2, 95–130.Google Scholar
Moinard, Y. 2007. Forgetting literals with varying propositional symbols. Journal of Logic and Computation 17, 5, 955–982.CrossRefGoogle Scholar
Pearce, D. 1999. Stable inference as intuitionistic validity. Journal of Logic Programming 38, 1, 79–91.CrossRefGoogle Scholar
Rajaratnam, D., Levesque, H. J., Pagnucco, M. and Thielscher, M. 2014. Forgetting in action. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, C. Baral, G. D. Giacomo and T. Eiter, Eds. AAAI Press.Google Scholar
Richards, B. A. and Frankland, P. W. 2017. The persistence and transience of memory. Neuron 94, 6, 1071–1084.CrossRefGoogle Scholar
Sakama, C. and Inoue, K. 2003. An abductive framework for computing knowledge base updates. Theory and Practice of Logic Programming 3, 6, 671–713.CrossRefGoogle Scholar
Saribatur, Z. and Eiter, T. 2021. Omission-based abstraction for answer set programs. Theory and Practice of Logic Programming 21, 2, 145–195.CrossRefGoogle Scholar
Saribatur, Z. G. and Eiter, T. 2018. Omission-based abstraction for answer set programs. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, M. Thielscher, F. Toni and F. Wolter, Eds. AAAI Press, 42–51.Google Scholar
Saribatur, Z. G., Eiter, T. and Schüller, P. 2021. Abstraction for non-ground answer set programs. Artificial Intelligence 300, 103563.CrossRefGoogle Scholar
Saribatur, Z. G., Schüller, P. and Eiter, T. 2019. Abstraction for non-ground answer set programs. In Logics in Artificial Intelligence - 16th European Conference, JELIA 2019, Proceedings, F. Calimeri, N. Leone and M. Manna, Eds. Lecture Notes in Computer Science, vol. 11468. Springer, 576–592.Google Scholar
Shrestha, P. 2017. Meaning and causes of forgetting. Psychstudy, November 17, 2017. https://www.psychestudy.com/cognitive/memory/meaning-causes-forgetting.Google Scholar
Simons, P., Niemelä, I. and Soininen, T. 2002. Extending and implementing the Stable Model Semantics. Artificial Intelligence 138, 1–2, 181–234.CrossRefGoogle Scholar
Slota, M. and Leite, J. 2012a. Robust equivalence models for semantic updates of answer-set programs. In Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, G. Brewka, T. Eiter and S. A. McIlraith, Eds. AAAI Press.Google Scholar
Slota, M. and Leite, J. 2012b. A unifying perspective on knowledge updates. In Logics in Artificial Intelligence - 13th European Conference, JELIA 2012. Proceedings, L. F. del Cerro, A. Herzig and J. Mengin, Eds. Lecture Notes in Computer Science, vol. 7519. Springer, 372–384.Google Scholar
Slota, M. and Leite, J. 2014. The rise and fall of semantic rule updates based on SE-models. Theory and Practice of Logic Programming 14, 6, 869–907.CrossRefGoogle Scholar
Truszczynski, M. 2010. Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs. Artificial Intelligence 174, 16–17, 1285–1306.CrossRefGoogle Scholar
Turner, H. 2003. Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3, 4–5, 609–622.CrossRefGoogle Scholar
Van Gelder, A., Ross, K. A. and Schlipf, J. S. 1991. The well-founded semantics for general logic programs. Journal of the ACM 38, 3, 620–650.Google Scholar
Visser, A. 1996. Uniform interpolation and layered bisimulation. In Gödel 1996. Lecture Notes in Logic, vol. 6. Springer Verlag, 139–164.Google Scholar
Wang, K., Sattar, A. and Su, K. 2005. A theory of forgetting in logic programming. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, M. M. Veloso and S. Kambhampati, Eds. AAAI Press/The MIT Press, 682–688.Google Scholar
Wang, Y., Wang, K. and Zhang, M. 2013. Forgetting for answer set programs revisited. In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, F. Rossi, Ed. IJCAI/AAAI, 1162–1168.Google Scholar
Wang, Y., Zhang, Y., Zhou, Y. and Zhang, M. 2012. Forgetting in logic programs under strong equivalence. In Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, G. Brewka, T. Eiter and S. A. McIlraith, Eds. AAAI Press.Google Scholar
Wang, Y., Zhang, Y., Zhou, Y. and Zhang, M. 2014. Knowledge forgetting in Answer Set Programming. Journal of Artificial Intelligence Research 50, 31–70.CrossRefGoogle Scholar
Wang, Z., Wang, K., Topor, R. W. and Pan, J. Z. 2010. Forgetting for knowledge bases in DL-lite. Annals of Mathematics and Artificial Intelligence 58, 1–2, 117–151.CrossRefGoogle Scholar
Weber, A. 1986. Updating propositional formulas. In Expert Database Systems, Proceedings From the First International Conference, L. Kerschberg, Ed. Benjamin/Cummings, 487–500.Google Scholar
Wong, K.-S. 2008. Sound and complete inference rules for SE-consequence. Journal of Artificial Intelligence Research 31, 205–216.CrossRefGoogle Scholar
Wong, K.-S. 2009. Forgetting in logic programs. Ph.D. thesis, The University of New South Wales.Google Scholar
Zhang, Y. and Foo, N. Y. 2005. A unified framework for representing logic program updates. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, M. M. Veloso and S. Kambhampati, Eds. AAAI Press/The MIT Press, 707–713.Google Scholar
Zhang, Y. and Foo, N. Y. 2006. Solving logic program conflict through strong and weak forgettings. Artificial Intelligence 170, 8–9, 739–778.CrossRefGoogle Scholar
Zhang, Y., Foo, N. Y. and Wang, K. 2005. Solving logic program conflict through strong and weak forgettings. In IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, L. P. Kaelbling and A. Saffiotti, Eds. Professional Book Center, 627–634.Google Scholar
Zhang, Y. and Zhou, Y. 2009. Knowledge forgetting: Properties and applications. Artificial Intelligence 173, 16–17, 1525–1537.CrossRefGoogle Scholar
Supplementary material: PDF

Gonçalves et al. supplementary material

Gonçalves et al. supplementary material

Download Gonçalves et al. supplementary material(PDF)
PDF 193.2 KB