Abstract
Revision programming was introduced as a formalism to describe and enforce updates of belief sets and databases. Revision programming was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify certainty (likelihood) that a revision atom holds. The main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition and to propose an alternative treatment of annotated revision programs. Our approach differs from that proposed by Fitting in two key aspects: we change the notion of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the case of annotated revision programs.
| Original language | English |
|---|---|
| Title of host publication | Logic Programming and Nonmonotonic Reasoning - 5th International Conference, LPNMR 1999, Proceedings |
| Editors | Nicola Leone, Gerald Pfeifer, Michael Gelfond |
| Pages | 49-62 |
| Number of pages | 14 |
| DOIs | |
| State | Published - 1999 |
| Event | 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 - El Paso, United States Duration: Dec 2 1999 → Dec 4 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1730 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 5th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 1999 |
|---|---|
| Country/Territory | United States |
| City | El Paso |
| Period | 12/2/99 → 12/4/99 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1999.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science