Forgetting under the Well-Founded Semantics

View/ Open
Author(s)
Alferes, Jose Julio
Knorr, Matthias
Wang, Kewen
Griffith University Author(s)
Year published
2013
Metadata
Show full item recordAbstract
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.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.
View less >
View less >
Conference Title
LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR 2013)
Volume
8148
Copyright Statement
© 2013 Springer-Verlag Berlin Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the conference's website for access to the definitive, published version.
Subject
Artificial Intelligence and Image Processing not elsewhere classified
Computational Logic and Formal Languages