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.
Preview
Unable to display preview. Download preview PDF.
References
ALP+98. J.J. Alferes, J.A. Leite, L.M. Pereira, H. Przymusinska, and T.C. Przymusinski. Dynamic logic programming. In Proceedings of KRâ98: Sixth International Conference on Principles of Knowledge Representation and Reasoning, Trento, Italy, pages 98â110. Morgan Kaufmann, 1998.
Fit95. M. C. Fitting. Annotated revision specification programs. In Logic programming and nonmonotonic reasoning (Lexington, KY, 1995), volume 928 of Lecture Notes in Computer Science, pages 143â155. Springer-Verlag, 1995.
Fit99. M. C. Fitting. Fixpoint semantics for logic programming-a survey. Theoretical Computer Science, 1999. To appear.
Gin88. M.L. Ginsberg. Multivalued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265â316, 1988.
KS92. M. Kifer and V.S. Subrahmanian. Theory of generalized annotated logic programs and its applications. Journal of Logic Programming, 12:335â367, 1992.
LW92. V. Lifschitz and T.Y.C. Woo. Answer sets in general nonmonotonic reasoning. In Proceedings of the 3rd international conference on principles of knowledge representation and reasoning, KRâ 92, pages 603â614, San Mateo, CA, 1992. Morgan Kaufmann.
MPT99. W. Marek, I. Pivkina, and M. TruszczyĆski. Revision programming = logic programming + integrity constraints. In Computer Science Logic, 12th International Workshop, CSLâ98, volume 1584 of Lecture Notes in Computer Science, pages 73â89. Springer, 1999.
MT95. W. Marek and M. TruszczyĆski. Revision programming, database updates and integrity constraints. In Proceedings of the 5th International Conference on Database Theory â ICDT 95, volume 893 of Lecture Notes in Computer Science, pages 368â382. Springer-Verlag, 1995.
MT98. W. Marek and M. TruszczyĆski. Revision programming. Theoretical Computer Science, 190(2):241â277, 1998.
PT97. T. C. Przymusinski and H. Turner. Update by means of inference rules. Journal of Logic Programming, 30(2):125â143, 1997.
RS70. H. Rasiowa and R. Sikorski. The Mathematics of metamathematics. PWNâ Polish Scientific Publishers, Warsaw, 1970.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marek, V., Pivkina, I., TruszczyĆski, M. (1999). Annotated Revision Programs. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_4
Download citation
DOI: https://doi.org/10.1007/3-540-46767-X_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66749-0
Online ISBN: 978-3-540-46767-0
eBook Packages: Springer Book Archive