general constraint-satisfaction problems
Maximum constraint satisfaction on diamonds
... non-Boolean constraint problems (including decision, quantified, and counting problems) have been actively studied in the last years, with many classification results obtained (see, ...of ...
19
Can You Beat Treewidth?
... that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time n O(k) if the treewidth of the primal graph of the instance is at most k and n is the size of the ...every ...
28
Applying quantum algorithms to constraint satisfaction problems
... in general be slower than modern-day classical hardware) but also the overhead from fault- tolerance, which could correspond to an increase of several orders of magnitude in the number of qubits required, and a ...
30
Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns
... It might be argued that since there is no phase transition in this case, this cannot be considered a complexity peak. Although I can’t yet be certain that there is a genuine asympototic complexity effect, for some ...
13
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
... for general computation are much needed, ...the problems of computing on encrypted data [Gen09, GH11b, GH11a, BGV12, GSS12b, GSS12a], computing on authenticated data [GW12], delegation of computation ...
101
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
... global satisfaction degree of a PFCSP should ...local satisfaction degree of a prioritised constraint should ful4l (but, as we shall show, one ofthese properties is ...more general Sugeno ...
38
Automated static symmetry breaking in constraint satisfaction problems
... in constraint satisfaction problems can be broken by adding lexicographic ordering ...Existing general methods of gener- ating such sets of ordering constraints can produce a huge number of ...
141
Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
... In general, the predicates can be replaced with actual payoff functions, and the goal is to maximize the total ...tion problems, such as Max Cut and Max k-Sat, there are examples of CSP ...
10
A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
... more general class of graph problems and constraint satisfaction problems, that the approximation guarantee has a tighter dependency on the threshold used in the definition of threshold ...
16
Constant query testability of assignments to constraint satisfaction problems
... This theorem generalizes characterizations of the constant-query testable List H- homomorphism problems [34] and Boolean CSPs [6] to general CSPs. In Section 3 we will describe the particularly nice ...
27
From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems
... The study of unconditional lower bounds for general families of LP relaxations was initiated by Arora, Bollobás and Lovász [2] (see also [3]). They studied the Lovász-Schrijver [25] LP hierarchy and proved lower ...
33
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems
... a general inapproximability result for OCSPs which, similar to results for classic CSPs, permit us to deduce hardness of approximation based on the existence of certain simple ...ordering problems, we may ...
27
A Constraint Satisfaction Approach to Dependency Parsing
... weighted constraint satisfaction framework: an overpredicted constraint may still be left unsatis- fied if other, conflicting constraints outweigh its own ...
5
Resolving deictic references with fuzzy CSPs
... Bacchus, F. & van Beek, P. (1998). On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. In Proceedings of the 15th National Conference on Artificial Intelligence ...
39
Conditional constraint satisfaction and configuration: A win-win proposition
... adapted constraint satisfaction and its conditional variant to the planning domain 4,5 and hardware test ...benchmark problems are almost nonexistent, compounding this ...
5
Teaching Artificial Intelligence Across the Computer Science Curriculum using Sudoku as a Problem Domain
... Artificial Intelligence (AI) has directly influenced many areas of computer science and produced a plethora of techniques. Thus, determining the important topics for a single semester undergraduate AI course is a non- ...
6
An effective dichotomy for the counting constraint satisfaction problem
... counting constraint satisfaction problem ...a constraint language Γ, a fixed, finite set of relations over a finite domain ...rectangular constraint languages, due to Bulatov and Dalmau ...
30
Constraint Propagation in Kimmo Systems
... In general, the guiding assumption is that morphological analysis problems actually have the kind of modular and superpositional information structure that will allow constraint propagat[r] ...
8
Planning texts by constraint satisfaction
... a Constraint Satisfaction Prob- lem, so that all solutions respecting constraints on text-structure formation and structural compatibil- ity can be eciently ...
7
Sharp Thresholds for a Random Constraint Satisfaction Problem
... in constraint satisfaction problems (CSPs) plays a crucial role in the field of artificial intelligence and computational com- plexity ...and constraint tightness p ...different ...
11