Let A be an idempotent algebra, α ∈ ConA such that A/α has few subpowers, and m be a fixed natural number. There is a polynomial time algorithm that can transform any constraint satisfaction problem over A with relations of arity at most m into an equivalent problem which is m consistent and in which each domain is inside an α block. Consequently if the induced algebras on the blocks of α gener...

It is well known that the constraint satisfaction problem over general relational structures can be reduced in polynomial time to digraphs. We present a simple variant of such a reduction and use it to show that the algebraic dichotomy conjecture is equivalent to its restriction to digraphs and that the polynomial reduction can be made in logspace. We also show that our reduction preserves the ...

We demonstrate how to solve constraint satisfaction problems (CSPs) with DNA computing. Assuming that DNA operations can be faulty, we estimate error probability of our algorithm. We show that for any k-CSP, there is a polynomial-time DNA algorithm with bounded probability of error. Thus, k-CSPs belong to a DNA analogue of BPP.

A real-time extension of ccs is described, based on true concurrency semantics and a determination to make composition the sole arbiter of real-time behaviour. The resultant calculus has a simple definition, encourages constraint-oriented specification and exhibits considerable expressive power.

This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programming approach, which includes a novel filtering algorithm and dedicated heuristics. The filtering algorithm uses a machine relaxation to produce a lower bound that can be obtained by solving a Just-In-Time Pert problem. I...

Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language. CHR-related research has surged during the decade following the previous survey by Frühwirth (1998). Covering more than 180 publications, this new survey pro...

Satisfiability (SAT) testing methods have been used effectively in many inference, planning and constraint satisfaction tasks and thus have been considered a contribution towards artificial general intelligence. However, since SAT constraints are defined over atomic propositions, domains with state variables that change over time can lead to extremely large search spaces. This poses both memory...

Decision making is indispensable to any optimization in intelligent computing. In this study, we discuss a mathematical foundation for bilateral decision making under synchronous and asynchronous time constraint. The problem on time constraint is to evaluate the cost of time or the value of the entire duration of certain decision process. We propose a formula to compute the cost of time by intr...

Large amount of digital content would be stored safely in peer-to-peer network, with encrypted format. Being requested, a cipher text is downloaded from certain peer and decrypted by a delegated decryptor to obtain the clear text. Observing the need for this new kind of delegation decryption service, we propose a novel time constraint delegation scheme for decrypting p2p data in this paper. The...

Many global constraints can be described by a regular expression or a DFA. Originally, the regular constraint, uses a DFA to describe the constraint, however, it can also be used to express a table constraint. Thus, there are many representations for an equivalent constraint. In this paper, we investigate the effect of different representations on natural extensions of the regular constraint fo...