Advertisement

Approximate Update of Logical Databases

  • Alvaro del Val
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 318)

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.

Keywords

State Constraint Partial Model Belief Change Wide Family Approximate Answer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Serge Abiteboul. Updates, a new frontier. In Proceedings of the Second International Conference on Data Base Theory, 1988.Google Scholar
  2. [2]
    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.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    Timothy SC Chou and Marianne Winslett. A model-based belief revision system. Journal of Automated Reasoning, 1993. To appear.Google Scholar
  5. [5]
    Thomas Dean and Mark Boddy. An analysis of time dependent planning. In Proceedings of the Seventh Conference of the AAAI, 1988.Google Scholar
  6. [6]
    Alvaro del Val. Computing knowledge base updates. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 1992.Google Scholar
  7. [7]
    Alvaro del Val. Syntactic characterizations of belief change operators. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 1993.Google Scholar
  8. [8]
    Alvaro del Val. Belief update and minimal change temporal projection: Scaling up. Submitted, 1994.Google Scholar
  9. [9]
    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.Google Scholar
  10. [10]
    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.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    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.Google Scholar
  13. [13]
    Henry Kautz and Bart Selman. Forming concepts for fast inference. In Proceedings of the Tenth Conference of the AAAI, 1992.Google Scholar
  14. [14]
    Raymond Reiter. On specifying database updates. Technical Report KRR-TR-92-5, Computer Science Department, University of Toronto, 1992.Google Scholar
  15. [15]
    Raymond R. Reiter. On formalizing database updates: Preliminary report. In Proceedings of the Third International Conference on Extending Database Technology, 1992.Google Scholar
  16. [16]
    Bart Selman and Henry Kautz. Knowledge compilation using Horn approximations. In Proceedings of the Ninth Conference of the AAAI, 1991.Google Scholar
  17. [17]
    S.V. Vrbsky and J.W.S. Liu. Approximate: A query processor that produces monotonically improving approximate answers. Submitted, 1992.Google Scholar
  18. [18]
    Marianne Winslett. Reasoning about action using a possible models approach. In Proceedings of the Seventh Conference of the AAAI, 1988.Google Scholar

Copyright information

© Kluwer Academic Publishers 1995

Authors and Affiliations

  • Alvaro del Val
    • 1
  1. 1.Departamento de Ingenieria InformaticaUniversidad Autonoma de MadridMadridSpain

Personalised recommendations