The problem is sometimes reduced to the simplest case of recognizing matching pairs, often structured to allow for metric constraints.
Thereafter the new qualitative model is enlarged for allowing unary metric constraints on points and durations, subsuming in this way several point-based approaches to temporal reasoning.
By imposing metric constraints, a decent solution of the SFM problem for rigid objects can be achieved.
To support efficient reasoning, a large tractable subfragment is identified, among others, generalizing the well-known ORD Horn subfragment of the Interval Algebra (extended with metric constraints).
This model allows the representation and processing of many types of constraints discussed in the literature to date, including metric constraints (restricting the distance between time points) and qualitative, disjunctive constraints (specifying the relative position of temporal objects).
In [12], Xiao and Kanade pointed out that even enforcing both sets of linear metric constraints above could still lead to ambiguity, if there exist degenerate bases, which are not of full rank three.
Using this hypothesis, NMDS attempts to solve the following problem: P roblem 2.1 Given a set of similarities c ij (e.g. the contact frequency between i and j), find X ∈ R 3 × n such that (3) c i j ≥ c k ℓ ⇔ | | x i − x j | | 2 ≤ | | x k − x ℓ | | 2 Equation (3) is known as the non-metric constraint, or the ordinal constraint.
Furthermore, we argue that non-metric constraints are an inherent complexity of the sequence space and should not be overlooked.
However, non-metric constraints are inherent to the protein sequence space due to the modular nature of protein domains.
In this paper we introduce four classes of qualitative and metric size constraints, and we study their integration with the Region Connection Calculus RCC-8, a well-known approach to qualitative spatial reasoning with topological relations.
In this paper, a new metric called Triple Constraint Satisfaction probability (TCS) is proposed to evaluate the soft error vulnerability of combinational circuits.
