We study the constraint satisfaction problem (CSP) parameterized by a language Γ (CSPΓ) and how choice of affects its worst-case time complexity. Under exponential-time hypothesis (ETH), we rule out existence subexponential algorithms for finite-domain NP-complete CSPΓ problems. This extends to certain infinite-domain CSPs structurally restricted For with finite domain D where all unary relatio...

We propose a new algorithmic framework, multiply sectioned constraint networks (MSCNs), for solving distributed constraint satisfaction problems (DisCSPs) with complex local problems. An MSCN is converted into a linked junction forest (LJF) and is solved by a complete algorithm. Its time complexity is linear on the number and size of local problems (each in charge by an agent) and is exponentia...

Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the time complexity of the parameterized SAT(·) problem correlates to the lattice of strong partial clones. With this ordering they isolated a relation R such that SAT(R) can be solved at least as fast as any other NP-har...

This paper presents extensions for temporal constraints satisfaction in MIndiGolog [KP06], for both agent-time and real-time constraints. An implementation is provided in Prolog, which enables users to specify their constraints as arguments to a single entry point predicate. The results are demonstrated with practical examples, and limitations of our implementation are discussed in depth. Final...

This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...