In this paper we study to what extent majorities based on difference in support leads to triple-acyclic collective decisions. These majorities, which take into account voters’ intensities of preference between pairs of alternatives through reciprocal preference relations, require to the winner alternative to exceed the support for the other alternative in a difference fixed before the election....

* We exhibit several problems complete for deterministic logarithmic space under NC' (i.e., log depth) reducibility. The list includes breadth-first search and depth-first search of an undirected tree, connectivity of undirected graphs known to be made up of one or more disjoint cycles, undirected graph acyclicity, and several problems related to representing and to operating with permutations ...

We study conditions for a concurrent construction of proof-nets in the framework developed by Andreoli in recent papers. We define specific correctness criteria for that purpose. We first study closed modules (i.e. validity of the execution of a logic program), then extend the criterion to open modules (i.e. validity during the execution) distinguishing criteria for acyclicity and connectabilit...

This paper introduces and illustrates BLOG, a formal language for defining probability models over worlds with unknown objects and identity uncertainty. BLOG unifies and extends several existing approaches. Subject to certain acyclicity constraints, every BLOG model specifies a unique probability distribution over first-order model structures that can contain varying and unbounded numbers of ob...

Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a choice function to be nonempty-valued and path independent (or satisfy the outcast axiom). An infinite extension of acyclicity is necessary and sufficient for the choice function to have nonempty values provided the und...

We present version 1.0 of the Norn SMT solver for string constraints. Norn is a solver for an expressive constraint language, including word equations, length constraints, and regular membership queries. As a feature distinguishing Norn from other SMT solvers, Norn is a decision procedure under the assumption of a set of acyclicity conditions on word equations, without any restrictions on the u...

We study two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models that have various interpretations and impose various additional restrictions on behavior. We show that t...

Multiply Sectioned Bayesian Networks (MSBN) provide a coherence framework for multi-agent distributed interpretation tasks. During the construction or dynamic formation of an MSBN, automatic verification of d-sepset and the acyclicity of the overall structure is desired. Although verification has been implemented in a time-sharing fashion, new issues must be resolved in order to perform such ve...

We continue the development of the homological theory of quantum general linear groups previously considered by the first author. The development is used to transfer information to the representation theory of quantised Schur algebras. The acyclicity of induction from some rank-one modules for quantised Borel-Schur subalgebras is deduced. This is used to prove the exactness of the complexes rec...

Since we already know (Theorem 1.3 in lecture notes 3) that the data complexity of FOL model checking is in LOGSPACE, we could use common complexity-theoretic assumptions (such as LOGSPACE 6=NP) to conclude that NP-complete properties of finite graphs such as Hamiltonicity, clique or independent set existence, etc. are not FO-definable. However, we might be interested in asking if properties th...