Skip to main content
SpringerLink
Log in

Two Revision Methods Based on Constraints: Application to a Flooding Problem

  • Conference paper
Artificial Intelligence and Symbolic Computation (AISC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3249))

Abstract

In this paper, we are interested in geographic information revision in the framework of a flooding problem. We show how to express and how to revise this problem by using simple linear constraints. We present two revision strategies based on linear constraints resolution: the partial revision and the global revision methods. We apply these approaches on both a real-world flooding problem and random flooding instances.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alchourròn, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: Partial meet functions for contraction and revision. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  2. Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and co., San Francisco (1979)

    MATH  Google Scholar 

  3. Khelfallah, M., Benhamou, B.: Geographic information revision based on constraints. Accepted in the 16th European Conference on Articifial Intelligence (ECAI 2004), Valencia, Spain, August 24-27 (2004)

    Google Scholar 

  4. Khelfallah, M., Benhamou, B.: Two revision methods based on constraints: Application to a flooding problem. Unpublished report available on request from the authors (2004)

    Google Scholar 

  5. Nebel, B.: How hard it is to revise a belief base? In: Gabbay, D., Smets, P. (eds.) Handbook on Defeasible Reasoning and Uncertainty Management Systems: Belief Change, vol. III, pp. 77–145. Kluwer Academic, Dordrecht (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire LSIS, Université de Provence, 39 Rue Joliot-Curie, 13453, Marseille, France

    Mahat Khelfallah & Belaïd Benhamou

Authors
  1. Mahat Khelfallah
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Belaïd Benhamou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria

    Bruno Buchberger

  2. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    John Campbell

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Khelfallah, M., Benhamou, B. (2004). Two Revision Methods Based on Constraints: Application to a Flooding Problem. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30210-0_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23212-4

  • Online ISBN: 978-3-540-30210-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation