Skip to main content Accessibility help
×
Home

A Syntactic Operator for Forgetting that Satisfies Strong Persistence

  • MATTI BERTHOLD (a1), RICARDO GONÇALVES (a2), MATTHIAS KNORR (a2) and JOÃO LEITE (a2)

Abstract

Whereas the operation of forgetting 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.

In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence – a property that seems to best capture the essence of forgetting in the context of ASP – 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.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      A Syntactic Operator for Forgetting that Satisfies Strong Persistence
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      A Syntactic Operator for Forgetting that Satisfies Strong Persistence
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      A Syntactic Operator for Forgetting that Satisfies Strong Persistence
      Available formats
      ×

Copyright

References

Hide All
Alferes, J. J., Knorr, M., and Wang, K. 2013. Forgetting under the well-founded semantics. In Procs. of LPNMR. LNCS, vol. 8148. Springer, 36–41.
Berthold, M., Gonçalves, R., Knorr, M., and Leite, J. 2019. A syntactic operator for forgetting that satisfies strong persistence. CoRR abs/1907.12501.
Brass, S. and Dix, J. 1999. Semantics of (disjunctive) logic programs based on partial evaluation. J. Log. Program. 40, 1, 146.
Cabalar, P. and Ferraris, P. 2007. Propositional theories are strongly equivalent to logic programs. TPLP 7, 6, 745759.
Cabalar, P., Pearce, D., and Valverde, A. 2007. Minimal logic programs. In Procs. of ICLP. Springer.
Delgrande, J. P. and Wang, K. 2015. A syntax-independent approach to forgetting in disjunctive logic programs. In Procs. of AAAI. AAAI Press, 1482–1488.
Eiter, T. and Kern-Isberner, G. 2019. A brief survey on forgetting from a knowledge representation and reasoning perspective. KI - Künstliche Intelligenz 33, 1, 933.
Eiter, T. and Wang, K. 2008. Semantic forgetting in answer set programming. Artif. Intell. 172, 14, 16441672.10.1016/j.artint.2008.05.002
Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Comput. 9, 3-4, 365385.
Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., and Woltran, S. 2019. Forgetting in modular answer set programming. In Procs. of AAAI. AAAI Press.
Gonçalves, R., Knorr, M., and Leite, J. 2016a. The ultimate guide to forgetting in answer set programming. In Procs. of KR. AAAI Press, 135–144.
Gonçalves, R., Knorr, M., and Leite, J. 2016b. You can’t always forget what you want: on the limits of forgetting in answer set programming. In Procs. of ECAI. IOS Press, 957–965.
Gonçalves, R., Knorr, M., and Leite, J. 2017. Iterative variable elimination in ASP. In Procs. of EPIA. LNCS, vol. 10423. Springer, 643–656.
Gonçalves, R., Knorr, M., Leite, J., and Woltran, S. 2017. When you must forget: Beyond strong persistence when forgetting in answer set programming. TPLP 17, 5-6, 837854.
Inoue, K. and Sakama, C. 1998. Negation as failure in the head. J. Log. Program. 35, 1, 3978.
Inoue, K. and Sakama, C. 2004. Equivalence of logic programs under updates. In Procs. of JELIA. Springer.
Knorr, M. and Alferes, J. J. 2014. Preserving strong equivalence while forgetting. In Procs. of JELIA. LNCS, vol. 8761. Springer, 412–425.
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–1141.
Lang, J., Liberatore, P., and Marquis, P. 2003. Propositional independence: Formula-variable independence and forgetting. J. Artif. Intell. Res. (JAIR) 18, 391443.
Lang, J. and Marquis, P. 2010. Reasoning under inconsistency: A forgetting-based approach. Artif. Intell. 174, 12-13, 799823.
Leite, J. 2017. A bird’s-eye view of forgetting in answer-set programming. In Procs. of LPNMR. LNCS, vol. 10377. Springer, 10–22.
Lifschitz, V., Pearce, D., and Valverde, A. 2001. Strongly equivalent logic programs. ACM Trans. Comput. Log. 2, 4, 526541.
Lin, F. and Reiter, R. 1997. How to progress a database. Artif. Intell. 92, 1-2, 131167.
Liu, Y. and Wen, X. 2011. On the progression of knowledge in the situation calculus. In Procs. of IJCAI. IJCAI/AAAI, 976–982.
Rajaratnam, D., Levesque, H. J., Pagnucco, M., and Thielscher, M. 2014. Forgetting in action. In Procs. of KR. AAAI Press.
Slota, M. and Leite, J. 2011. Back and forth between rules and se-models. In Procs. of LPNMR. Springer.
Wang, Y., Wang, K., and Zhang, M. 2013. Forgetting for answer set programs revisited. In Procs. of IJCAI. IJCAI/AAAI, 1162–1168.
Wang, Y., Zhang, Y., Zhou, Y., and Zhang, M. 2014. Knowledge forgetting in answer set programming. J. Artif. Intell. Res. (JAIR) 50, 3170.
Wang, Z., Wang, K., Topor, R. W., and Pan, J. Z. 2010. Forgetting for knowledge bases in DL-Lite. Ann. Math. Artif. Intell. 58, 1-2, 117151.10.1007/s10472-010-9187-9
Zhang, Y. and Foo, N. Y. 2006. Solving logic program conflict through strong and weak forgettings. Artif. Intell. 170, 8-9, 739778.
Zhang, Y. and Zhou, Y. 2009. Knowledge forgetting: Properties and applications. Artif. Intell. 173, 16-17, 15251537.

Keywords

A Syntactic Operator for Forgetting that Satisfies Strong Persistence

  • MATTI BERTHOLD (a1), RICARDO GONÇALVES (a2), MATTHIAS KNORR (a2) and JOÃO LEITE (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed