Advertisement
Published in:
2014 | OriginalPaper | Chapter
Incrementally Building Partially Path Consistent Qualitative Constraint Networks
Authors : Michael Sioutis, Jean-François Condotta
Published in: Artificial Intelligence: Methodology, Systems, and Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The Interval Algebra (
IA
) and a fragment of the Region Connection Calculus (
RCC
), namely,
RCC
-8, are the dominant Artificial Intelligence approaches for representing and reasoning about qualitative temporal and topological relations respectively. In this framework, one of the main tasks is to compute the path consistency of a given Qualitative Constraint Network (
QCN
). We concentrate on the partial path consistency checking problem problem of a
QCN
, i.e., the path consistency enforced on an underlying chordal constraint graph of the
QCN
, and propose an algorithm for maintaining or enforcing partial path consistency for growing constraint networks, i.e., networks that grow with new temporal or spatial entities over time. We evaluate our algorithm experimentally with
QCNs
of
IA
and
RCC
-8 and obtain impressive results.