Forgetting under the well-founded semantics

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

12 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 languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 12th International Conference, LPNMR 2013, Proceedings
EditorsP. Cabalar, T. C. Son
Place of PublicationBerlin, Heidelberg
PublisherSpringer
Pages36-41
Number of pages6
ISBN (Electronic)978-3-642-40564-8
ISBN (Print)978-3-642-40563-1
DOIs
Publication statusPublished - 2013
Event12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013 - Corunna, Spain
Duration: 15 Sept 201319 Sept 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer
Volume8148 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2013
Country/TerritorySpain
CityCorunna
Period15/09/1319/09/13

Fingerprint

Dive into the research topics of 'Forgetting under the well-founded semantics'. Together they form a unique fingerprint.

Cite this