Inproceedings,

On syntactic forgetting with strong persistence

.
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning, California, International Joint Conferences on Artificial Intelligence Organization, (July 2022)

Abstract

It is generally agreed upon that so-called strong persistence (SP) captures best the essence of forgetting in logic programming. While classes of operators, such as F\_R and F\_SP, that satisfy immediate relaxations of (SP), and in the case of F\_SP, even (SP) whenever possible, have been characterized semantically, many practical questions have yet to be addressed. This technical paper aims to answer one of them: How can atoms be forgotten from a program without having to calculate its exponential number of models? To this end, we introduce two concrete representatives of F\_R and F\_SP that forget sets of atoms by syntactical manipulation of a program's rules. This may in many cases prevent exponential blowups and produce a forgetting result that is close to the original program.

Tags

    Users

    • @scadsfct

    Comments and Reviews