2019
DOI: 10.1613/jair.1.11451
|View full text |Cite
|
Sign up to set email alerts
|

A Semantic Characterization ASP Base Revision

Abstract: The paper deals with base revision for Answer Set Programming (ASP). Base revision in classical logic is done by the removal of formulas. Exploiting the non-monotonicity of ASP allows one to propose other revision strategies, namely addition strategy or removal and/or addition strategy. These strategies allow one to define families of rule-based revision operators. The paper presents a semantic characterization of these families of revision operators in terms of answer sets. This semantic characterization allo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…If we compare this to belief change principles and operators, such a behaviour is typical of revision but is not desirable for updates. Garcia et al . (2019) introduced a family of revision operators for logic programs similar in spirit to the RVS-semantics, except that they allow both for the addition and/or removal of rules from a logic program to achieve coherence.…”
Section: The Rvs-semanticsmentioning
confidence: 99%
“…If we compare this to belief change principles and operators, such a behaviour is typical of revision but is not desirable for updates. Garcia et al . (2019) introduced a family of revision operators for logic programs similar in spirit to the RVS-semantics, except that they allow both for the addition and/or removal of rules from a logic program to achieve coherence.…”
Section: The Rvs-semanticsmentioning
confidence: 99%