Sen [6] proved that by confining voters to value restricted (acyclic) domains voting paradoxes (intransitive relations) can be avoided in aggregation by majority. We generalize this result to any neutral monotone aggregation. In addition, we show that acyclicity is neither necessary nor sufficient for transitivity for neutral non-monotone aggregation: we construct a cyclic transitive domain and...

We study portfolios of parallel strategies for Boolean Satisfiability (SAT) based solving of Hamiltonian Cycle Problems (HCPs). The strategies are based on our techniques for relative SAT encoding of permutations with constraints, and exploit: 1) encodings that eliminate half of the ordering Boolean variables and two-thirds of the transitivity constraints; 2) 12 triangulation heuristics for min...

The present study aims to investigate the system of the visual transitivity by analyzing the images of American English file (2014) and Cutting edge (2005) series based on Halliday’s (1976) systemic functional linguistics and Kress and van leuween’s (1997-2006) social semiotics. The system of visual transitivity refers to a type of process which determines how represented participants are label...

In this work we study different properties of graph symmetry. The first, is vertex transitivity, which informally says, that each vertex has the same global view of the graph. We give a simple one-sided error testing algorithm for vertex transitivity in the dense-graphs model, whose query complexity is Θ̃(n). In addition, we prove that any one-sided error testing algorithm for vertex transitivit...

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...

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...