Annotated revision programs

Authors:
Victor Marek;Inna Pivkina;Mirosław Truszczyński
Affiliations:
Univ. of Kentucky, Lexington, KY;Univ. of Kentucky, Lexington, KY;Univ. of Kentucky, Lexington, KY
Venue:
Artificial Intelligence
Year:
2002

Citing 9
Cited 3

Quantitative deduction and its fixpoint theory

Journal of Logic Programming
Theory of generalized annotated logic programming and its applications

Journal of Logic Programming
Stable semantics for probabilistic deductive databases

Information and Computation
Revision programming

Theoretical Computer Science - Special issue: database theory
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)
Fixpoint semantics for logic programming a survey

Theoretical Computer Science
Revision Programming, Database Updates and Integrity Constraints

ICDT '95 Proceedings of the 5th International Conference on Database Theory
Annotated Revision Specification Programs

LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Revision Programming = Logic Programming + Integrity Constraints

Proceedings of the 12th International Workshop on Computer Science Logic

Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
Approximating answer sets of unitary lifschitz-woo programs

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Revision programs with explicit negation

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms. Annotations provide a way to quantify the confidence (probability) 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 annotated case.