Merging Qualitative Constraints Networks Using Propositional Logic

14 years 11 months ago

Download www.cril.univ-artois.fr

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.

Jean-François Condotta, Souhila Kaci, Pierr

Real-time Traffic

Artificial Intelligence | ECSQARU 2009 | Propositional Merging Operators | Qualitative Constraints Networks | Rational Merging Procedure |

claim paper

» Merging Qualitative Constraint Networks in a Piecewise Fashion

» On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics

» Metric Propositional Neighborhood Logics Expressiveness Decidability and Undecidability

» Spacecontained conflict revision for geographic information

» Temporal constraints in the logical analysis of regulatory networks

» Modelling and solving temporal reasoning as propositional satisfiability

» Modelbased belief merging without distance measures

» Modeling a Controlled Conveyor Network with Merging Configuration

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	ECSQARU
Authors	Jean-François Condotta, Souhila Kaci, Pierre Marquis, Nicolas Schwind

Comments (0)

Sciweavers

Merging Qualitative Constraints Networks Using Propositional Logic

Artificial Intelligence | ECSQARU 2009 | Propositional Merging Operators | Qualitative Constraints Networks | Rational Merging Procedure |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers