large constraint satisfaction problems
Conditional constraint satisfaction and configuration: A win-win proposition
... Cork Constraint Computation Centre, University College Cork, Ireland, developed the random CondCSP generator in 1996 when he was affiliated with the University of New Hampshire, ...solving problems of a ...
5
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
... algebraic constraint satisfaction problem for multivariate polynomials for which, unlike sACSP as defined above, PCPs as efficient are those of Ben-Sasson et ...but large) number of states of the ...
101
Automated static symmetry breaking in constraint satisfaction problems
... There exist stochastic search methods for CSPs [52]. These generally begin with a random assignment of values to variables then attempt to find a solution by searching from this initial seed point. This can be an ...
141
Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
... constraints satisfaction problems (in particular with the predicates of arity 2), such progress was not ...open problems in modern theoretical computer science because of the large number of ...
10
Prioritised fuzzy constraint satisfaction problems: axioms, instantiation and validation
... every constraint with the highest priority is forced to be assigned the priority ...ifa constraint with a priority higher than that ofany existing constraint in the PFCSP is added? What ifthe ...
38
Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns
... distance problems [6] we found that by using subset and symmetry inferences along with skipping replaceability checks for extreme values, we could reduce the time to find an irreplaceable set by three orders of ...
13
Applying quantum algorithms to constraint satisfaction problems
... arbitrarily large for large enough input sizes, choosing an extremely large input size will make the execution time of the quantum algorithm unacceptably long for practical ...
30
Solving Constraint Satisfaction Problems by Artificial Bee Colony with Greedy Scouts
... solving large-scale and hard constraint satisfaction problems ...Keywords: constraint satisfaction, search, meta- heuristics, artificial bee colony, phase ...
6
From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems
... sufficiently large N, there exists a (c − ε, s + ε)-integrality gap instance of size (number of variables) N, for any linear extended formulation of size at most N t/2 ...
33
Perturbed Message Passing for Constraint Satisfaction Problems
... We considered the challenge of efficiently producing assignments that satisfy hard combi- natorial problems, such as κ-SAT and q-COL. We focused on ways to use message passing methods to solve CSPs, and introduced ...
26
A Constraint Satisfaction Approach to Dependency Parsing
... We have presented a novel dependency parsing method based on a standard constraint satisfaction framework. First results on a set of ten different lan- guages have been promising, but so far no extensive ...
5
From Shallow to Deep Parsing Using Constraint Satisfaction
... We present in this paper a technique allowing to choose the parsing granularity within the same approach relying on a constraint-based formalism. Its main advantage lies in the fact that the same linguistic ...
7
Constraint Optimization for Highly Constrained Logistic Problems
... Many variations exist on how to represent the Storage Area Stowage Problem as a con- straint satisfaction problem. Three possibilities have been considered on how to model SASP as a CSP - namely ”Container as ...
136
Large parallel problems
... where algebraic preconditioner + Krylov-subspace solvers don’t work and direct solver (MUMPS) exceed sensible memory. resources[r] ...
26
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
An effective dichotomy for the counting constraint satisfaction problem
... The constraint satisfaction problem (CSP) is ubiquitous in computer ...science. Problems in such diverse areas as Boolean logic, graph theory, database query evaluation, type inference, scheduling ...
30
temporal pattern detection as temporal constraint satisfaction unpublished
... Abstract: Many software systems maintain vast temporal databases containing time-stamped records about events and activities. Experts need to analyze these databases for various purposes like diagnosis, surveillance, ...
12
Analysis of servo-constraint problems for underactuated multibody systems
... The coordinate transformation approach is inspired by di ff erential-geometric control theory, which is the basis of feedback linearization and can also be used for feedforward control design, see Isidori (1995); Sastry ...
17
Maximum constraint satisfaction on diamonds
... We study a standard parameterized version of the Max CSP , in which re- strictions may be imposed on the types of constraints allowed in the instances. The most well-known examples of such problems are Max k -Sat ...
19
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