Abstract
In this paper, we develop a notion of forgetting for normal logic programs under the well-founded semantics. We show that a number of desirable properties are satisfied by our approach. Three different algorithms are presented that maintain the computational complexity of the well-founded semantics, while partly keeping its syntactical structure. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Alferes, J. J., Knorr, M., & Wang, K. (2013). Forgetting under the well-founded semantics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8148, pp. 36–41). Springer Verlag. https://doi.org/10.1007/978-3-642-40564-8_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
