Skip to main content
SpringerLink
Log in
Book cover

European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty

ECSQARU 1999: Symbolic and Quantitative Approaches to Reasoning and Uncertainty pp 233–244Cite as

Merging with Integrity Constraints

  • Conference paper
  • First Online:

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

Abstract

We consider, in this paper, the problem of knowledge base merging with integrity constraints. We propose a logical characterization of those operators and give a representation theorem in terms of pre- orders on interpretations. We show the close connection between belief revision and merging operators and we show that our proposal extends the pure merging case (i.e. without integrity constraints) we study in a previous work. Finally we show that Liberatore and Schaerf commutative revision operators can be seen as a special case of merging.

The proofs have been omitted for space requirements but can be found in the ex- tended version of this work [12].

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. K. J. Arrow. Social choice and individual values. Wiley, New York, second edition, 1963.

    Google Scholar 

  3. C. Baral, S. Kraus, J. Minker, and V. S. Subrahmanian. Combining knowledge bases consisting of first-order theories. Computational Intelligence, 8(1):45–71, 1992.

    Article  Google Scholar 

  4. S. Benferhat, D. Dubois, J. Lang, H. Prade, A. Saffioti, and P. Smets. A general approach for inconsistency handling and merging information in prioritized knowledge bases. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 466–477.

    Google Scholar 

  5. S. Benferhat, D. Dubois, and H. Prade. A computational model for belief change and fusing ordered belief bases. In Frontiers in Belief revision. Kluwer, 1999. To appear.

    Google Scholar 

  6. M. Dalal. Investigations into a theory of knowledge base revision: preliminary report. In Proceedings of AAAI-88, pages 475–479, 1988.

    Google Scholar 

  7. P. Gärdenfors. Knowledge in ux. MIT Press, 1988.

    Google Scholar 

  8. J. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319–379, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  9. H. Katsuno and A. O. Mendelzon. Propositional knowledge base revision and minimal change. Artificial Intelligence, 52:263–294, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. S. Kelly. Arrow impossibility theorems. Series in economic theory and mathematical economics. Academic Press, New York, 1978.

    Google Scholar 

  11. S. Konieczny and R. Pino Pérez. On the logic of merging. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98), pages 488–498, 1998.

    Google Scholar 

  12. S. Konieczny and R. Pino Pérez. Merging with integrity constraints. Technical Report 99-01, LIFL, 1999. http://www.li.fr/GNOM/articles/it9901.ps.

  13. P. Liberatore and M. Schaerf. Arbitration: A commutative operator for belief revision. In Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, pages 217–228, 1995.

    Google Scholar 

  14. P. Liberatore and M. Schaerf. Arbitration (or how to merge knowledge bases). IEEE Transactions on Knowledge and Data Engineering, 10(1):76–90, 1998.

    Article  Google Scholar 

  15. J. Lin. Integration of weighted knowledge bases. Artificial Intelligence, 83(2):363–378, 1996.

    Article  MathSciNet  Google Scholar 

  16. J. Lin and A. O. Mendelzon. Knowledge base merging by majority. Manuscript.

    Google Scholar 

  17. H. Moulin. Axioms of cooperative decision making. Monograph of the Econometric Society. Cambridge University Press, 1988.

    Google Scholar 

  18. P. Z. Revesz. On the semantics of theory change: arbitration between old and new information. In Proceedings of the 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases, pages 71–92, 1993.

    Google Scholar 

  19. P. Z. Revesz. On the semantics of arbitration. International Journal of Algebra and Computation, 7(2):133–160, 1997.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d’Informatique Fondamentale de Lille, Université de Lille 1, 59655, Villeneuve d’Ascq, France

    Sébastien Konieczny

Authors
  1. Sébastien Konieczny
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ramón Pino Pérez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Konieczny, S., Pérez, R.P. (1999). Merging with Integrity Constraints. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation