Skip to main content
SpringerLink
Log in

Exploring the Rationality of Some Syntactic Merging Operators

  • Conference paper
Advances in Artificial Intelligence – IBERAMIA 2012 (IBERAMIA 2012)

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

Included in the following conference series:

  • 1835 Accesses

Abstract

Most merging operators are defined by semantics methods which have very high computational complexity. In order to have operators with a lower computational complexity, some merging operators defined in a syntactical way have been proposed. In this work we define some syntactical merging operators and explore its rationality properties. To do that we constrain the belief bases to be sets of formulas very close to logic programs and the underlying logic is defined through forward chaining rule (Modus Ponens). We propose two types of operators: arbitration operators when the inputs are only two bases and fusion with integrity constraints operators. We introduce a set of postulates inspired on postulates LS, proposed by Liberatore and Shaerf and then we analyze the first class of operators through these postulates. We also introduce a set of postulates inspired on postulates KP, proposed by Konieczny and Pino Pérez and then we analyze the second class of operators through these postulates.

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.E., Gärdenfors, P., Makinson, D.: On the Logic of Theory Change – Partial Meet Contraction and Revision Functions. Journal of Symbolic Logic 50, 510–530 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  2. Baral, C., Kraus, S., Minker, J.: Combining Multiple Knowledge Bases. IEEE Transactions on Knowledge and Data Engineering 3(2), 208–220 (1991)

    Article  Google Scholar 

  3. Bezzazi, H., Janot, S., Konieczny, S., Pino Pérez, R.: Analysing Rational Properties of Change Operators Based on Forward Chaining. In: Freitag, B., Decker, H., Kifer, M., Voronkov, A. (eds.) Dagstuhl Seminar 1997, DYNAMICS 1997, and ILPS-WS 1997. LNCS, vol. 1472, pp. 317–339. Springer, Heidelberg (1998)

    Chapter  MATH  Google Scholar 

  4. Creignou, N., Papini, O., Pichler, R., Woltran, S.: Belief Revision within Fragments of Propositional Logic. In: Brewka, G., Eiter, T., McIlraith, S.A. (eds.) 13th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2012), pp. 126–136. AAAI Press (2012)

    Google Scholar 

  5. Delgrande, J.P.: Horn Clause Belief Change – Contraction Functions. In: Brewka, G., Lang, J. (eds.) 11th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2008), pp. 156–165. AAAI Press (2008)

    Google Scholar 

  6. Delgrande, J.P., Peppas, P.: Revising Horn Theories. In: Walsh, T. (ed.) 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 839–844. IJCAI/AAAI (2011)

    Google Scholar 

  7. Delgrande, J.P., Schaub, T., Tompits, H., Woltran, S.: Merging Logic Programs under Answer Set Semantics. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 160–174. Springer, Heidelberg (2009)

    Chapter  MATH  Google Scholar 

  8. Delgrande, J.P., Wassermann, R.: Horn Clause Contraction Functions: Belief Set and Belief Base Approaches. In: 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2010), pp. 143–152 (2010)

    Google Scholar 

  9. Eiter, T., Gottlob, G.: On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals. Artificial Intelligence 57(2-3), 227–270 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  10. Falappa, M.A., Kern-Isberner, G., Reis, M., Simari, G.R.: Prioritized and Non-prioritized Multiple Change on Belief Bases. Journal of Philosophical Logic 41, 77–113 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Fuhrmann, A.: An Essay on Contraction. Studies in logic, language and information. CSLI Publications (1997)

    Google Scholar 

  12. Gärdenfors, P.: Knowledge in flux. MIT Press (1988)

    Google Scholar 

  13. Hansson, S.O.: What’s New Isn’t Always Best. Theoria 63, 1–13 (1998)

    Article  Google Scholar 

  14. Hué, J., Papini, O., Würbel, E.: Merging Belief Bases Represented by Logic Programs. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS, vol. 5590, pp. 371–382. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Hué, J., Würbel, E., Papini, O.: Removed Sets Fusion – Performing Off the Shelf. In: 18th European Conf. on Artificial Intelligence (ECAI 2008), pp. 94–98 (2008)

    Google Scholar 

  16. Katsuno, H., Mendelzon, A.O.: On the Difference Between Updating a Knowledge Base and Revising It. In: 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 387–394. Morgan Kaufmann (1991)

    Google Scholar 

  17. Katsuno, H., Mendelzon, A.O.: Propositional Knowledge Base Revision and Minimal Change. Artificial Intelligence 52, 263–294 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Konieczny, S., Pino Pérez, R.: Merging Information Under Constraints – A Logical Framework. Journal of Logic and Computation 12(5), 773–808 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  19. Konieczny, S., Pino Pérez, R.: Logic Based Merging. Journal of Philosophical Logic 40(2), 239–270 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  20. Konieczny, S.: On the Difference Between Merging Knowledge Bases and Combining Them. In: 7th International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), pp. 135–144. Morgan Kaufmann (2000)

    Google Scholar 

  21. Lang, J., Marquis, P.: Resolving Inconsistencies by Variable Forgetting. In: 8th International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 239–250. Morgan Kaufmann (2002)

    Google Scholar 

  22. Langlois, M., Sloan, R.H., Szörényi, B., Turán, G.: Horn Complements – Towards Horn-to-Horn Belief Revision. In: 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 466–471 (2008)

    Google Scholar 

  23. Liberatore, P., Schaerf, M.: A Commutative Operator for Belief Revision. In: 2nd World Conference on the Fundamentals of Artificial Intelligence (WOCFAI 1995), pp. 217–228. Angkor (1995)

    Google Scholar 

  24. Liberatore, P., Schaerf, M.: Arbitration or How to Merge Knowledge Bases. IEEE Transactions on Knowledge and Data Engineering 10(1), 76–90 (1998)

    Article  Google Scholar 

  25. Lin, J.: Integration of Weighted Knowledge Bases. Artificial Intelligence 83(2), 363–378 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  26. Lin, J., Mendelzon, A.O.: Merging Databases Under Constraints. International Journal of Cooperative Information System 7(1), 55–76 (1998)

    Article  Google Scholar 

  27. Lin, J., Mendelzon, A.O.: Knowledge Base Merging by Majority. In: Pareschi, R., Fronhofer, B. (eds.) Dynamic Worlds: From the Frame Problem to Knowledge Management. Kluwer (1999)

    Google Scholar 

  28. Nebel, B.: Belief Revision and Default Resoning – Syntax-Based Approaches. In: 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 417–428. Morgan Kaufmann (1991)

    Google Scholar 

  29. Pearl, J.: System Z – A Natural Ordering of Defaults with Tractable Applications to Nonmonotonic Reasoning. In: 3rd Conference on Theoretical Aspects of Reasoning About Knowledge (TARK 1990), pp. 121–135. Morgan Kaufmann (1990)

    Google Scholar 

  30. Revesz, P.Z.: On the Semantics of Arbitration. International Journal of Algebra and Computation 7(2), 133–160 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Facultad de Ciencias, Universidad de Los Andes, Mérida, Venezuela

    José Luis Chacón & Ramón Pino Pérez

Authors
  1. José Luis Chacón
    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. Facultad de Informática, Universidad Complutense de Madrid, c\ Profesor José García Santesmases, 28040, Madrid, Spain

    Juan Pavón  & Rubén Fuentes-Fernández  & 

  2. Universidad Nacional de Colombia, Carrera 30 No 45-03, Edificio 477, Bogotá, DC, Colombia

    Néstor D. Duque-Méndez

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chacón, J.L., Pino Pérez, R. (2012). Exploring the Rationality of Some Syntactic Merging Operators. In: Pavón, J., Duque-Méndez, N.D., Fuentes-Fernández, R. (eds) Advances in Artificial Intelligence – IBERAMIA 2012. IBERAMIA 2012. Lecture Notes in Computer Science(), vol 7637. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34654-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34654-5_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34653-8

  • Online ISBN: 978-3-642-34654-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation