Sentence examples for contraction operation from inspiring English sources

Though foundational contractions constitute a new kind of belief contractions, incompatible with AGM postulates, a broad class of preferential AGM contractions is shown to be revision-equivalent to foundational contractions and can actually be produced using a modification of the contraction operation on epistemic states.

For any sentence p, a p-kernel is a minimal p-implying set, i.e. a set that implies p but has no proper subset that implies p. A contraction operation ÷ can be based on the simple principle that no p-kernel should be included in A÷p.

We give the definitions of removal and contraction operations in the generalized maps framework.

We propose a filtering algorithm based on graph contraction operations and inference of simple boolean constraints, that has a linear time complexity in O |E|+|V|).

It is shown that the symmetry of the back stress is strongly related to its treatment as a truly spatial tensor, where contraction operations are to be conducted using the current metric.

Revised GBD and NGBD frameworks are proposed to incorporate bound contraction operations or/and range reduction calculations, which can reduce the variable bounds and therefore improve the convergence rate and expedite the solution of nonconvex subproblems.

We discuss reducing the number of steps involved in computing the Tutte polynomial of a matroid by using series and parallel reductions in conjunction with the usual deletion and contraction operations.

The simplex vertices are changed through reflection, expansion, shrinkage, and contraction operations in order to find an improved solution to estimate the parameters.

Similarly, denote by contcost (w) the cost of the edit script from w to w ~ which reduces each run α p  in w by applying p - 1 contraction operations over α.

□ We now describe a O(n) algorithm to compute the MRF of an n-leaf MUL-tree T. In the previous section, the MRF was defined as the tree obtained by applying information-preserving pruning and contraction operations to T, in any order, until it is no longer possible.

The operation of contraction (referring to the removal of knowledge from a knowledge base) has been extensively studied in the research field of belief change, and different postulates (e.g., the AGM postulates with recovery, or relevance) have been proposed, as well as several constructions (e.g., partial meet) that allow the definition of contraction operators satisfying said postulates.