Forgetting under the Well-Founded Semantics

José Júlio Alves Alferes; Matthias Knorr

doi:10.1007/978-3-642-40564-8_4

Forgetting under the Well-Founded Semantics

José Júlio Alves Alferes, Matthias Knorr

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	Unknown
Title of host publication	Lecture Notes in Computer Science
Pages	36-41
ISBN (Electronic)	978-3-642-40564-8
DOIs	https://doi.org/10.1007/978-3-642-40564-8_4
Publication status	Published - 1 Jan 2013
Event	12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) - Duration: 1 Jan 2013 → …

Conference

Conference	12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
Period	1/01/13 → …

Access to Document

10.1007/978-3-642-40564-8_4

Cite this

@inproceedings{a278899904a04ec7b775e898310f07c3,

title = "Forgetting under the Well-Founded Semantics",

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.",

author = "Alferes, {Jos{\'e} J{\'u}lio Alves} and Matthias Knorr",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-3-642-40564-8_4",

language = "Unknown",

isbn = "ISBN 978-3-642-40563-1",

pages = "36--41",

booktitle = "Lecture Notes in Computer Science",

note = "null ; Conference date: 01-01-2013",

}

TY - GEN

T1 - Forgetting under the Well-Founded Semantics

AU - Alferes, José Júlio Alves

AU - Knorr, Matthias

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-40564-8_4

DO - 10.1007/978-3-642-40564-8_4

M3 - Conference contribution

SN - ISBN 978-3-642-40563-1

SP - 36

EP - 41

BT - Lecture Notes in Computer Science

Y2 - 1 January 2013

ER -