Forgetting under the Well-Founded Semantics

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

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.
Original languageUnknown
Title of host publicationLecture Notes in Computer Science
Pages36-41
ISBN (Electronic)978-3-642-40564-8
DOIs
Publication statusPublished - 1 Jan 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) -
Duration: 1 Jan 2013 → …

Conference

Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
Period1/01/13 → …

Cite this