It is useful in a wide range of situations to find solutions which are diverse (or similar) to each other. We therefore define a number of different classes of diversity and similarity problems. For example, what is the most diverse set of solutions of a constraint satisfaction problem with a given cardinality? We first determine the computational complexity of these problems. We then propose a...

A central assumption of classical Optimality Theory (Prince and Smolensky 1993) is that constraint domination is strict. That is, if constraint A outranks constraints B and C (A >> B, C), then a candidate output that violates A can never be favored over one that satisfies A but violates B and/or C, no matter how many violations of B and C occur. Tableau (1) illustrates the familiar scenario of ...

In this paper we outline a theoretical framework for the combination of decision procedures for the satis ability of constraints with respect to a constraint theory. We describe a general combination method which, given a procedure that decides constraint satis ability with respect to a constraint theory T1 and one that decides constraint satis ability with respect to a constraint theory T2, is...

this paper deals with the problem of forbidden states in discrete event systems modeled by petri net. to avoid the forbidden states, some constraints which are called generalized mutual exclusion constraints can be assigned to them. enforcing these constraints on the system can be performed using control places. however, when the number of these constraints is large, a large number of control p...