A syntax-independent approach to forgetting in disjunctive logic programs

29Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we present an approach to forgetting in disjunctive logic programs, where forgetting an atom from a program amounts to a reduction in the signature of that program. Notably, the approach is syntax-independent, so that if two programs are strongly equivalent, then the result of forgetting a given atom in each program is also strongly equivalent. Our central definition of forgetting is abstract: forgetting an atom from program P is characterised by the set of those SE consequences of P that do not mention the atom to be forgotten. We provide an equivalent, syntactic, characterization in which forgetting an atom p is given by those rules in the program that do not mention p, together with rules obtained by a single inference step from those rules that do mention p. Forgetting is shown to have appropriate properties; in particular, answer sets are preserved in forgetting an atom. As well, forgetting an atom via the syntactic characterization results in a modest (at worst quadratic) blowup in the program size. Finally, we provide a prototype implementation of this approach to forgetting.

Cite

CITATION STYLE

APA

Delgrande, J. P., & Wang, K. (2015). A syntax-independent approach to forgetting in disjunctive logic programs. In Proceedings of the National Conference on Artificial Intelligence (Vol. 2, pp. 1482–1488). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9402

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free