A non-binary Constraint Satisfaction Problem (CSP) can be solved directly using extended versions of binary techniques. Alternatively, the non-binary problem can be translated into an equivalent binary one. In this case, it is generally accepted that the translated problem can be solved by applying well-established techniques for binary CSPs. In this paper we evaluate the applicability of the l...

1. The Issue Of recent changes in linguistic theory, the shift from derivations to constraints is among the most substantive. Central to this is Optimality Theory (OT; Prince & Smolenksy 1993), which – unlike, e.g., Chomsky & Lasnik’s Filters or Pān. ini’s As.t.ādhyāȳı – claims that structural well-formedness (grammaticality) is enforced by sharply conflicting, mutually incompatible constraints...

Traditionally, dependency theory has been developed for uninterpreted data. Specifically, the only assumption that is made about the data domains is that data values can be compared for equality. However, data is often interpreted and there can be advantages in considering it as such, for instance obtaining more compact representations as done in constraint databases. This paper considers depen...

Hartle’s generalized quantum mechanics in the sum-over-histories formalism is used to describe a nonabelian gauge theory. Predictions are made for certain alternatives, with particular attention given to coarse-grainings involving the constraint. In this way, the theory is compared to other quantum-mechanical descriptions of gauge theories in which the constraints are imposed by hand. The vanis...

Many existing algorithms for model checking of infinite-state systems operate on constraints which are used to represent (potentially infinite) sets of states. A general powerful technique which can be employed for proving termination of these algorithms is that of well quasi-orderings. Several methodologies have been proposed for derivation of new well quasi-ordered constraint systems. However...

Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint programming problems where problem construction and problem solving are interleaved, and fit naturally within constraint logic programming. However, in general, filtering that is sound for a global constraint can be unso...

In Constraint Programming, constraint propagation is a basic component of constraint satisfaction solvers. Here we study constraint propagation as a basic form of inference in the context of first-order logic (FO) and extensions with inductive definitions (FO(ID)) and aggregates (FO(AGG)). In a first, semantic approach, a theory of propagators and constraint propagation is developed for theorie...

The logic MMSNP is a restricted fragment of existential second-order logic which allows to express many interesting queries in graph theory and finite model theory. The logic was introduced by Feder and Vardi who showed that every MMSNP sentence is computationally equivalent to a finite-domain constraint satisfaction problem (CSP); the involved probabilistic reductions were derandomized by Kun ...

Constraint satisfaction problems are an important class of problems in complexity theory. They generalize many combinatorial problems as well as satisfiability problems and provide canonical complete problems for many complexity classes. The computational complexity of all Boolean constraint satisfaction problems was classified by Schaefer [Sch78] and reveals a dichotomic behavior that is conje...