Merging Qualitative Constraints Networks Using Propositional Logic

  • Authors:
  • Jean-François Condotta;Souhila Kaci;Pierre Marquis;Nicolas Schwind

  • Affiliations:
  • Université d'Artois CRIL CNRS UMR 8188, Lens, F-62307;Université d'Artois CRIL CNRS UMR 8188, Lens, F-62307;Université d'Artois CRIL CNRS UMR 8188, Lens, F-62307;Université d'Artois CRIL CNRS UMR 8188, Lens, F-62307

  • Venue:
  • ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we address the problem of merging qualitative constraints networks (QCNs ). We propose a rational merging procedure for QCNs . It is based on translations of QCNs into propositional formulas, and take advantage of propositional merging operators.