Abstract
In [6, 7], we presented syntactic characterizations and algorithms for computing the result of updating and revising a logical database under various approaches proposed in the literature. In this paper we focus on the design of versions of these algorithms able to provide an approximate answer if interrupted before completion. We use the PMA approach to update [18] as the main example, but the results readily generalize to a wide family of update operators.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Serge Abiteboul. Updates, a new frontier. In Proceedings of the Second International Conference on Data Base Theory, 1988.
Marco Cadoli and Marco Schaerf. Approximate reasoning and non-omniscient agents. In Proceedings of the Third Conference on Theoretical Aspects of Reasoning about Knowledge, 1992.
Timothy SC Chou and Marianne Winslett. Immortal: A model-based belief revision system. In Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, 1991.
Timothy SC Chou and Marianne Winslett. A model-based belief revision system. Journal of Automated Reasoning, 1993. To appear.
Thomas Dean and Mark Boddy. An analysis of time dependent planning. In Proceedings of the Seventh Conference of the AAAI, 1988.
Alvaro del Val. Computing knowledge base updates. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 1992.
Alvaro del Val. Syntactic characterizations of belief change operators. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993.
Alvaro del Val. Belief update and minimal change temporal projection: Scaling up. Submitted, 1994.
Alvaro del Val and Yoav Shoham. Deriving properties of belief update from theories of action (II). In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993.
Thomas Eiter and Georg Gottlob. On the complexity of propositional knowledge base revision, updates, and counterfactuals. Technical Report CD-TR 91/23, Christian Doppler Labor fur Expertensysteme, Technische Universitat Wien, July 1991.
Gösta Grahne and Alberto O. Mendelzon. Updates and subjunctive queries. Technical Report KRR-TR-91-4, Computer Science Department, University of Toronto, July 1991.
Hirofumi Katsuno and Alberto O. Mendelzon. On the difference between updating a knowledge database and revising it. In Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning, 1991.
Henry Kautz and Bart Selman. Forming concepts for fast inference. In Proceedings of the Tenth Conference of the AAAI, 1992.
Raymond Reiter. On specifying database updates. Technical Report KRR-TR-92-5, Computer Science Department, University of Toronto, 1992.
Raymond R. Reiter. On formalizing database updates: Preliminary report. In Proceedings of the Third International Conference on Extending Database Technology, 1992.
Bart Selman and Henry Kautz. Knowledge compilation using Horn approximations. In Proceedings of the Ninth Conference of the AAAI, 1991.
S.V. Vrbsky and J.W.S. Liu. Approximate: A query processor that produces monotonically improving approximate answers. Submitted, 1992.
Marianne Winslett. Reasoning about action using a possible models approach. In Proceedings of the Seventh Conference of the AAAI, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
del Val, A. (1995). Approximate Update of Logical Databases. In: Natarajan, S. (eds) Imprecise and Approximate Computation. The Springer International Series in Engineering and Computer Science, vol 318. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-26870-5_8
Download citation
DOI: https://doi.org/10.1007/978-0-585-26870-5_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9579-9
Online ISBN: 978-0-585-26870-5
eBook Packages: Springer Book Archive