Combining binary constraint networks in qualitative reasoning
Jason Jingshi Li, Tomasz Kowalski, Jochen Renz, Sanjiang Li · Frontiers in artificial intelligence and applications · 2008
Constraint networks in qualitative spatial and temporal reasoning are always complete graphs. When one adds an extra element to a given network, previously unknown constraints are derived by intersections and compositions of other constraints, and this may introduce inconsistency to the overall network. Likewise, when combining two consistent networks that share a common part, the combined network may become inconsistent.