Merging Qualitative Constraints Networks Using Propositional Logic

Jean-Francois Condotta; Souhila Kaci; Pierre Marquis; Nicolas Schwind

Acte de colloque

Merging Qualitative Constraints Networks Using Propositional Logic

Jean-Francois Condotta, Souhila Kaci, Pierre Marquis et Nicolas Schwind

10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'09), Vol.5590, pp.347-358

Lecture Notes in Computer Science (LNCS)

10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'09)

2009

Résumé

Artificial Intelligence

Computer Science

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.

Indicateurs

1 Consultations de la notice

Détails

Titre: Merging Qualitative Constraints Networks Using Propositional Logic
Créateurs - sans rôle: Jean-Francois Condotta - Centre de Recherche en Informatique de Lens
Souhila Kaci - Centre de Recherche en Informatique de Lens
Pierre Marquis - Centre de Recherche en Informatique de Lens
Nicolas Schwind - Centre de Recherche en Informatique de Lens
Détails de publication: 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'09), Vol.5590, pp.347-358
Colloque: 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'09)
Publications en série: Lecture Notes in Computer Science (LNCS)
Éditeur: Springer
Identifiants: 99136083109311
Unité académique: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Langue: English
Type de ressource: Conference proceeding