paper-with-me

홈 › Papers

Forgetting in Answer Set Programming -- A Survey

2021-07-14 · Ricardo Gonçalves, Matthias Knorr, João Leite

Forgetting - or variable elimination - is an operation that allows the removal, from a knowledge base, of middle variables no longer deemed relevant. In recent years, many different approaches for forgetting in Answer Set Programming have been proposed, in the form of specific operators, or classes of such operators, commonly following different principles and obeying different properties. Each such approach was developed to address some particular view on forgetting, aimed at obeying a specific set of properties deemed desirable in such view, but a comprehensive and uniform overview of all the existing operators and properties is missing. In this paper, we thoroughly examine existing properties and (classes of) operators for forgetting in Answer Set Programming, drawing a complete picture of the landscape of these classes of forgetting operators, which includes many novel results on relations between properties and operators, including considerations on concrete operators to compute results of forgetting and computational complexity. Our goal is to provide guidance to help users in choosing the operator most adequate for their application requirements.

📄 PDF Abstract BibTeX arXiv:2107.07016

Code (0)

등록된 구현이 없습니다.

Tasks

Survey

Similar Papers 제목 키워드 기반

When You Must Forget: beyond strong persistence when forgetting in answer set programming

2017-07-17 · Ricardo Gonçalves, Matthias Knorr, João Leite, Stefan Woltran

Among the myriad of desirable properties discussed in the context of forgetting in Answer Set Programming (ASP), strong persistence naturally captures its essence. Recently, it has been shown that it is not always possib…

Open-Ended Question Answering

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming

2023-12-13 · Zeynep G. Saribatur, Stefan Woltran

Answer Set Programming (ASP) is a prominent rule-based language for knowledge representation and reasoning with roots in logic programming and non-monotonic reasoning. The aim to capture the essence of removing (ir)relev…

A General Framework of Epistemic Forgetting and its Instantiation by Ranking Functions

2025-08-29 · Christoph Beierle, Alexander Hahn, Diana Howey, Gabriele Kern-Isberner 외 arxiv

Forgetting as a knowledge management operation deliberately ignores parts of the knowledge and beliefs of an agent, for various reasons. Forgetting has many facets, one may want to forget parts of the syntax, a propositi…

Historical Review of Variants of Informal Semantics for Logic Programs under Answer Set Semantics: GL'88, GL'91, GK'14, D-V'12

2024-07-09 · Yuliya Lierler

This note presents a historical survey of informal semantics that are associated with logic programming under answer set semantics. We review these in uniform terms and align them with two paradigms: Answer Set Programmi…

Survey

Answer Set Planning: A Survey

2022-02-11 · Tran Cao Son, Enrico Pontelli, Marcello Balduccini, Torsten Schaub

Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, i.e., solutions to planning problems, that transform a given state of the world to another state. The development of efficient and s…

Survey