14 research outputs found
On redundant topological constraints
© 2015 Elsevier B.V. All rights reserved. Redundancy checking is an important task in the research of knowledge representation and reasoning. In this paper, we consider redundant qualitative constraints. For a set Î of qualitative constraints, we say a constraint (xRy) in Î is redundant if it is entailed by the rest of Î. A prime subnetwork of Î is a subset of Î which contains no redundant constraints and has the same solution set as Î. It is natural to ask how to compute such a prime subnetwork, and when it is unique. We show that this problem is in general intractable, but becomes tractable if Î is over a tractable subalgebra S of a qualitative calculus. Furthermore, if S is a subalgebra of the Region Connection Calculus RCC8 in which weak composition distributes over nonempty intersections, then Î has a unique prime subnetwork, which can be obtained in cubic time by removing all redundant constraints simultaneously from Î. As a by-product, we show that any path-consistent network over such a distributive subalgebra is minimal and globally consistent in a qualitative sense. A thorough empirical analysis of the prime subnetwork upon real geographical data sets demonstrates the approach is able to identify significantly more redundant constraints than previously proposed algorithms, especially in constraint networks with larger proportions of partial overlap relations
On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi
Qualitative calculi play a central role in representing and reasoning about
qualitative spatial and temporal knowledge. This paper studies distributive
subalgebras of qualitative calculi, which are subalgebras in which (weak)
composition distributives over nonempty intersections. It has been proven for
RCC5 and RCC8 that path consistent constraint network over a distributive
subalgebra is always minimal and globally consistent (in the sense of strong
-consistency) in a qualitative sense. The well-known subclass of convex
interval relations provides one such an example of distributive subalgebras.
This paper first gives a characterisation of distributive subalgebras, which
states that the intersection of a set of relations in the subalgebra
is nonempty if and only if the intersection of every two of these relations is
nonempty. We further compute and generate all maximal distributive subalgebras
for Point Algebra, Interval Algebra, RCC5 and RCC8, Cardinal Relation Algebra,
and Rectangle Algebra. Lastly, we establish two nice properties which will play
an important role in efficient reasoning with constraint networks involving a
large number of variables.Comment: Adding proof of Theorem 2 to appendi
Indexing large geographic datasets with compact qualitative representation
© 2015 Taylor & Francis. This paper develops a new mechanism to efficiently compute and compactly store qualitative spatial relations between spatial objects, focusing on topological and directional relations for large datasets of region objects. The central idea is to use minimum bounding rectangles (MBRs) to approximately represent region objects with arbitrary shape and complexity and only store spatial relations that cannot be unambiguously inferred from the relations of corresponding MBRs. We demonstrate, both in theory and practice, that our approach requires considerably less construction time and storage space, and can answer queries more efficiently than the state-of-the-art methods
Efficient path consistency algorithm for large qualitative constraint networks
We propose a new algorithm called DPC+ to enforce partial path consistency (PPC) on qualitative constraint networks. PPC restricts path consistency (PC) to a triangulation of the underlying constraint graph of a network. As PPC retains the sparseness of a constraint graph, it can make reasoning tasks such as consistency checking and minimal labelling of large qualitative constraint networks much easier to tackle than PC. For qualitative constraint networks defined over any distributive subalgebra of well-known spatio-temporal calculi, such as the Region Connection Calculus and the Interval Algebra, we show that DPC+ can achieve PPC very fast. Indeed, the algorithm enforces PPC on a qualitative constraint network by processing each triangle in a triangulation of its underlying constraint graph at most three times. Our experiments demonstrate significant improvements of DPC+ over the state-of-the-art PPC enforcing algorithm
Efficiently characterizing non-redundant constraints in large real world qualitative spatial networks
RCC8 is a constraint language that serves for qualitative spatial representation and reasoning by encoding the topological relations between spatial entities. We focus on efficiently characterizing non-redundant constraints in large real world RCC8 networks and obtaining their prime networks. For a RCC8 network N a constraint is redundant, if removing that constraint from N does not change the solution set of N. A prime network of N is a network which contains no redundant constraints, but has the same solution set as N. We make use of a particular partial consistency, namely, Gâ-consistency, and obtain new complexity results for various cases of RCC8 networks, while we also show that given a maximal distributive subclass for RCC8 and a network N defined on that subclass, the prunning capacity of Gâ-consistency and â-consistency is identical on the common edges of G and the complete graph of N, when G is a triangulation of the constraint graph of N. Finally, we devise an algorithm based on Gâ-consistency to compute the unique prime network of a RCC8 network, and show that it significantly progresses the state-of-the-art for practical reasoning with real RCC8 networks scaling up to millions of nodes
On redundancy in simple temporal networks
© 2016 The Authors and IOS Press. The Simple Temporal Problem (STP) has been widely used in various applications to schedule tasks. For dynamical systems, scheduling needs to be efficient and flexible to handle uncertainty and perturbation. To this end, modern approaches usually encode the temporal information as an STP instance. This representation contains redundant information, which can not only take a significant amount of storage space, but also make scheduling inefficient due to the non-concise representation. In this paper, we investigate the problem of simplifying an STP instance by removing redundant information. We show that such a simplification can result in a unique minimal representation without loss of temporal information, and present an efficient algorithm to achieve this task. Evaluation on a large benchmark dataset of STP exhibits a significant reduction in redundant information for the involved instances
Modeling Rare Interactions in Time Series Data Through Qualitative Change: Application to Outcome Prediction in Intensive Care Units
Many areas of research are characterised by the deluge of large-scale
highly-dimensional time-series data. However, using the data available for
prediction and decision making is hampered by the current lag in our ability to
uncover and quantify true interactions that explain the outcomes.We are
interested in areas such as intensive care medicine, which are characterised by
i) continuous monitoring of multivariate variables and non-uniform sampling of
data streams, ii) the outcomes are generally governed by interactions between a
small set of rare events, iii) these interactions are not necessarily definable
by specific values (or value ranges) of a given group of variables, but rather,
by the deviations of these values from the normal state recorded over time, iv)
the need to explain the predictions made by the model. Here, while numerous
data mining models have been formulated for outcome prediction, they are unable
to explain their predictions.
We present a model for uncovering interactions with the highest likelihood of
generating the outcomes seen from highly-dimensional time series data.
Interactions among variables are represented by a relational graph structure,
which relies on qualitative abstractions to overcome non-uniform sampling and
to capture the semantics of the interactions corresponding to the changes and
deviations from normality of variables of interest over time. Using the
assumption that similar templates of small interactions are responsible for the
outcomes (as prevalent in the medical domains), we reformulate the discovery
task to retrieve the most-likely templates from the data.Comment: 8 pages, 3 figures. Accepted for publication in the European
Conference of Artificial Intelligence (ECAI 2020
Efficiently reasoning about qualitative constraints through variable elimination
© 2016 ACM. We introduce, study, and evaluate a novel algorithm in the context of qualitative constraint-based spatial and temporal reasoning, that is based on the idea of variable elimination, a simple and general exact inference approach in probabilistic graphical models. Given a qualitative constraint network M, our algorithm enforces a particular directional local consistency on M, which we denote by â-consistency. Our discussion is restricted to distributive subclasses of relations, i.e., sets of relations closed under converse, intersection, and weak composition and for which weak composition distributes over non-empty intersections for all of their relations. We demonstrate that enforcing â-consistency on a given qualitative constraint network defined over a distributive subclass of relations allows us to decide its satisfiability. The experimentation that we have conducted with random and real-world qualitative constraint networks defined over a distributive subclass of relations of the Region Connection Calculus, shows that our approach exhibits unparalleled performance against competing state-of-the-art approaches for checking the satisfiability of such constraint networks
Indexing large geographic datasets with compact qualitative representation
This paper develops a new mechanism to efficiently compute and compactly store qualitative
spatial relations between spatial objects, focusing on topological and directional relations
for large datasets of region objects. The central idea is to use minimum bounding
rectangles (MBRs) to approximately represent region objects with arbitrary shape and complexity
and only store spatial relations which cannot be unambiguously inferred from the
relations of corresponding MBRs. We demonstrate, both in theory and practice, that our
approach requires considerably less construction time and storage space, and can answer
queries more efficiently than the state-of-the-art methods