PURPOSE Deformable image registration (DIR) is necessary for accurate dose accumulation between multiple radiotherapy image sets. DIR algorithms can suffer from inverse and transitivity inconsistencies. When using deformation vector fields (DVFs) that exhibit inverse-inconsistency and are nontransitive, dose accumulation on a given image set via different image pathways will lead to different a...

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictive.

Section 2. Then we present ProtoNet. ProtoNet is centered around the concept of homology transitivity. ProtoNet clusters protein sequences into a hierarchy based on sequence similarity and homology transitivity. Thus the hierarchy parallels the evolutionary history of these protein sequences. We then illustrate—using Histone proteins—the application of ProtoNet to detect remote protein relatives.

In this paper we propose a reconfiguration model based on switched flat system. The interest to have flat subsystems is to assure the property of transitivity. Transitivity is one the key points of a resilient system keeping the dependability. To reconfigure the system in the case of unexpected phenomena we use default logic.

In light of research indicating that individual behavior may violate standard rationality assumptions, we introduce a model of preference aggregation in which neither individual nor collective preferences must satisfy transitivity or other coherence conditions. We introduce an ordinal rationality measure to compare preference relations. Using this measure, we introduce a new axiom, monotonicity...

It is argued that if we take grounding to be univocal, then there is a serious tension between truthgrounding and one commonly assumed structural principle for grounding, namely transitivity. The primary claim of the paper is that truth-grounding cannot be transitive. Accordingly, it is either the case that grounding is not transitive or that truth-grounding is not grounding, or both.

According to the classical result by Segerberg and Maksimova, a modal logic containing K4 is locally tabular i↵ it is of finite height. The notion of finite height can also be defined for logics, in which the master modality is expressible (‘pretransitive’ logics). We observe that every locally tabular logic is a pretransitive logic of finite height. Then we prove some semantic criteria of loca...