Iterative variable elimination in ASP

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

4 Citations (Scopus)


In recent years, a large variety of approaches for forgetting in Answer Set Programming (ASP) have been proposed, in the form of specific operators, or classes of operators, following different principles and obeying different properties. A recent comprehensive overview of existing operators and properties provides a uniform picture of the landscape, including many novel results on relations between properties and operators. In this paper, we introduce four new properties not considered previously and show that these are indeed succinct and relevant additions providing novel results and insights, further strengthening established relations between existing operators. Most notably among these, the invariance to permutations of the order of forgetting a set of atoms iteratively raises interesting questions with surprising results.

Original languageEnglish
Title of host publicationProgress in Artificial Intelligence - 18th EPIA Conference on Artificial Intelligence, EPIA 2017, Proceedings
PublisherSpringer Verlag
Number of pages14
Volume10423 LNAI
ISBN (Print)9783319653396
Publication statusPublished - 2017
Event18th EPIA Conference on Artificial Intelligence, EPIA 2017 - Porto, Portugal
Duration: 5 Sep 20178 Sep 2017

Publication series

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


Conference18th EPIA Conference on Artificial Intelligence, EPIA 2017


Dive into the research topics of 'Iterative variable elimination in ASP'. Together they form a unique fingerprint.

Cite this