2000 character limit reached
Techniques for Measuring the Inferential Strength of Forgetting Policies (2404.02454v4)
Published 3 Apr 2024 in cs.AI and cs.LO
Abstract: The technique of forgetting in knowledge representation has been shown to be a powerful and useful knowledge engineering tool with widespread application. Yet, very little research has been done on how different policies of forgetting, or use of different forgetting operators, affects the inferential strength of the original theory. The goal of this paper is to define loss functions for measuring changes in inferential strength based on intuitions from model counting and probability theory. Properties of such loss measures are studied and a pragmatic knowledge engineering tool is proposed for computing loss measures using ProbLog. The paper includes a working methodology for studying and determining the strength of different forgetting policies, in addition to concrete examples showing how to apply the theoretical results using ProbLog. Although the focus is on forgetting, the results are much more general and should have wider application to other areas.
- 1995. Foundations of Databases. Addison-Wesley.
- 2015. Stable model counting and its application in probabilistic logic programming. In Bonet, B., and Koenig, S., eds., Proc. 29th AAAI Conf. on AI, 3468–3474. AAAI Press.
- 2019. Towards a general framework for kinds of forgetting in common-sense belief management. Künstliche Intell. 33(1):57–68.
- 2021. Handbook of Satisfiability, volume 336 of Frontiers in AI and Applications. IOS Press.
- 2021. Approximate model counting. In Biere et al. (?). 1015–1045.
- Clark, K. L. 1977. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases, Symposium on Logic and Data Bases, Advances in Data Base Theory, 293–322. New York: Plemum Press.
- 2008. CLP(BN): Constraint logic programming for probabilistic knowledge. In De Raedt et al. (?), 156–188.
- 2015. Probabilistic (logic) programming concepts. Machine Learning 100(1):5–47.
- 2008. Probabilistic Inductive Logic Programming - Theory and Applications, volume 4911 of LNCS. Springer.
- 2016. Statistical Relational Artificial Intelligence: Logic, Probability, and Computation. Synthesis Lectures on AI and ML. Morgan & Claypool Pub.
- 2019. Abox abduction via forgetting in ALC. In The 33rd AAAI Conf. on AI, 2768–2775.
- Delgrande, J. P. 2017. A knowledge level account of forgetting. J. Artif. Intell. Res. 60:1165–1213.
- 2024. Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions. Artif. Intell. 326:104036.
- 1997. Computing circumscription revisited. J. Automated Reasoning 18(3):297–336.
- 2019. A brief survey on forgetting from a knowledge representation and reasoning perspective. Künstliche Intell. 33(1):9–33.
- 2021. The model counting competition 2020. ACM J. of Experimental Algorithmics 26(13):1–26.
- 2008. Second-Order Quantifier Elimination. Foundations, Computational Aspects and Applications, volume 12 of Studies in Logic. College Publications.
- 2009. Solution enumeration for projected boolean search problems. In van Hoeve, W. J., and Hooker, J. N., eds., 6th Int. Conf. CPAIOR, volume 5547 of LNCS, 71–86. Springer.
- 2021. Model counting. In Biere et al. (?). 993–1014.
- 2021. Forgetting in Answer Set Programming - A survey. Theory and Practice of Logic Programming 1–43.
- 2022. Tseitin or not Tseitin? The impact of CNF transformations on feature-model analyses. In 37th ASE, IEEE/ACM Int. Conf. on Automated Software Engineering, 110:1–110:13.
- 2019. A recursive algorithm for projected model counting. In The 33rd AAAI Conf. on AI, 1536–1543. AAAI Press.
- 2020. Definability for model counting. Artif. Intell. 281:103229.
- 2017. Lpmlnmln{}^{\mbox{mln}}start_FLOATSUPERSCRIPT mln end_FLOATSUPERSCRIPT, weak constraints, and P-log. In Proc. 31st AAAI Conf., 1170–1177.
- 1994. Forget it! In Proc. of the AAAI Fall Symp. on Relevance, 154–159.
- 1984. Making Prolog more expressive. Journal of Logic Programming 1(3):225–240.
- 1995. A semantic theory of abstractions. In Proc. 14th IJCAI 95, 196–203. Morgan Kaufmann.
- Pfeffer, A. 2016. Practical Probabilistic Programming. Manning Pub. Co.
- Poole, D. 2008. The independent choice logic and beyond. In De Raedt et al. (?), 222–243.
- Riguzzi, F. 2023. Foundations of Probabilistic Logic Programming. Languages, Semantics, Inference and Learning. Series in Software Engineering. River Publishers.
- 1997. PRISM: A language for symbolic-statistical modeling. In Proc. of the 15th IJCAI, 1330–1339. Morgan Kaufmann.
- Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In Proc. 12th Int. Conf. on Logic Programming ICLP, 715–729.
- 2019. BIRD: engineering an efficient CNF-XOR SAT solver and its applications to approximate model counting. In 33rd AAAI, 1592–1599.
- Tseitin, G. S. 1968. On the complexity of derivation in propositional calculus. In Structures in Constructive Mathematics and Mathematical Logic, 115–125. Steklov Mathematical Institute.
- 2009. Introspective forgetting. Synth. 169(2):405–423.
- 2006. Representing causal information about a probabilistic process. In Fisher, M.; van der Hoek, W.; Konev, B.; and Lisitsa, A., eds., Proc. Logics in AI, 10th JELIA, volume 4160 of LNCS, 452–464. Springer.
- 2013. Programming with personalized pagerank: a locally groundable first-order probabilistic logic. In He, Q.; Iyengar, A.; Nejdl, W.; Pei, J.; and Rastogi, R., eds., 22nd ACM Int. Conf. on Information and Knowledge Management, 2129–2138.
- 2013. Forgetting for Answer Set Programs revisited. In Rossi, F., ed., Proc. IJCAI’2013, 1162–1168.
- 2006. Solving logic program conflict through strong and weak forgettings. Artif. Intell. 170(8):739–778.
- 2016. Forgetting concept and role symbols in 𝒜ℒ𝒞𝒪ℐℋμ+(∇,⊓)𝒜ℒ𝒞𝒪ℐℋsuperscript𝜇∇square-intersection\mathcal{ALCOIH}\mu^{+}(\nabla,\sqcap)caligraphic_A caligraphic_L caligraphic_C caligraphic_O caligraphic_I caligraphic_H italic_μ start_POSTSUPERSCRIPT + end_POSTSUPERSCRIPT ( ∇ , ⊓ )-ontologies. In Kambhampati, S., ed., Proc. IJCAI’2016, 1345–1352.
- 2017. Role forgetting for 𝒜ℒ𝒞𝒪𝒬ℋ𝒜ℒ𝒞𝒪𝒬ℋ\mathcal{ALCOQH}caligraphic_A caligraphic_L caligraphic_C caligraphic_O caligraphic_Q caligraphic_H (universal role)-ontologies using an Ackermann-based approach. In Sierra, C., ed., Proc. IJCAI’17, 1354–1361.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.