We consider existential rules (aka Datalog±) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive query (CQ) entailment is decidable. However, most of these classes cannot express transitivity of binary relations, a frequently used modelling construct. In this paper, we address the issue of whether transitivity ca...

An on-line "word detection" paradigm was used to assess the comprehension of thematic and transitive verb agreements during sentence processing in individuals diagnosed with probable Alzheimer's Disease (AD, n=15) and Frontotemporal Dementia (FTD, n=14). AD, FTD, and control participants (n=17) were asked to listen for a word in a sentence. Unbeknownst to the participants, the target word follo...

abstractthis study tried to examine the relationship between language strategies/sources and ideologies, and how ideologies are constructed and expressed through language strategies in different english newspapers with different political contexts. the focus of the study was on the style of representation of syrian civil war in tehran-times and asharq al-awsat newspapers. the data from these ne...

We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. We suggest the Reduced Transitivity Constraints (rtc) algorithm, that unlike the spar...

Much work has demonstrated that speakers of verb-final languages are able to construct rich syntactic representations in advance of verb information. This may reflect general architectural properties of the language processor, or it may only reflect a language-specific adaptation to the demands of verb-finality. The present study addresses this issue by examining whether speakers of a verb-medi...

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

In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...

In cluster analysis context is of major interest to induce an order that allow us to compare the groups generated by cluster analysis itself. Using the sample similarities obtained in this analysis like possibilities in fuzzy sets context provide us to induce a transitivity property in cluster analysis, producing a similarities matrix that meets to the transitivity conditions and that resembles...

It is important to see what kinds of properties of graphs can be transfer to the product of them. Here we will prove that the colour automorphism vertex transitivity can be transfer, and bring a special proof for vertex transitivity property of Cayley graphs of semigroups as well.

Fuzzy implicators are the basic ingredients of many applications. So it becomes essential to study the various features of an implicator before implementing it in any practical application. This paper discusses the properties of transitivity of a fuzzy relation on a given universe and measure of fuzzy transitivity defined in terms of the Reichenbach fuzzy implicator which is an s-implicator.