general constraint satisfaction problem
Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns
... most general form of substitutability that allows inferences from local to global versions of this ...the problem space as the complexity areas for consistency or full search ...
13
Service robot planning via solving constraint satisfaction problem
... That said, we will concentrate on two types of services, that is, moving between locations (S1) and opening/ closing (S2) services. Both of these service types cov- ers a wide range of objects, thus is important to ...
17
Question Answering Using Constraint Satisfaction: QA By Dossier With Contraints
... the general sales manager of Houseman, a supplier of water treatment ...the problem of word sense disambiguation has returned in a particularly nasty ...
8
Maximum constraint satisfaction on diamonds
... The algebraic combinatorial property of supermodularity (see Section 2) is a well-known source of tractable maximization problems [5, 15]. In combinatorial optimization, this property (or the dual property of ...
19
Optimal Approximation Algorithms for Reoptimization of Constraint Satisfaction Problems
... CSP problem Q is defined by a set of predicates over a finite domain q 1, 2, , q ...of problem Q consists of a set of variables V and a set of constraints on ...In general, the predicates ...
10
Applying quantum algorithms to constraint satisfaction problems
... apply general-purpose quantum algorithms for solving constraint satisfaction problems to two families of prototypical NP-complete prob- lems: boolean satisfiability and graph colour- ...dom ...
30
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 structure of ...
27
Conditional constraint satisfaction and configuration: A win-win proposition
... Sanjay Mittal and Brian Falkenhainer introduced the dynamic CSP formalism and its original application domain, product configuration. 1 Sabin and Eugene C. Freuder further developed this formalism and renamed it ...
5
temporal pattern detection as temporal constraint satisfaction unpublished
... The problem now is to select and assign an appropriate interval to each vertex such that the IA relationships associated with every edge label are ...temporal constraint satisfaction problem ...
12
An effective dichotomy for the counting constraint satisfaction problem
... algebraic properties, which can be derived from tame congruence theory [21] and commutator theory [18]. Bulatov constructs an algorithm for the polynomial-time cases, based on decomposing this congruence lattice and ...
30
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems
... The problem L ABEL C OVER (LC) is a common starting point of strong inapproximability results. An LC instance L = (U,V, E,L, R,Π) consists of a bipartite graph (U ∪ V,E) associating with every edge {u,v} a ...
27
Automated static symmetry breaking in constraint satisfaction problems
... second problem class is the equidistant frequency permutation array problem (EFPD) ...the problem is to find one (or all) EFPDs with those ...
141
From Shallow to Deep Parsing Using Constraint Satisfaction
... a constraint implements the complementation relation) or some exclusion that indicate cooccurrency restriction between a noun and a pronoun or a proper noun and a ...requirement constraint, both of them ...
7
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
... given problem instance, and are clearly of paramount importance for the success of a portfolio approach ...the problem specification) and dynamic (computed at runtime by monitoring the problem ...
6
Automatic Problem Generation in Constraint Based Tutors
... If the unit being measured (constraints in this case) is a valid abstraction of what is being learned, we expect to see a “power curve”. We fitted a power curve to each plot, giving an equation for the curve where the ...
11
Free Search Applied to Large Constraint Optimisation Problem
... Abstract. The article presents experimental results achieved by Free Search on optimisation of 100 dimensional version of so called bump test problem. Free Search is adaptive heuristic algorithm. It operates on a ...
9
Train Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
... Electromagnetism-like mechanism (EM) is a population based meta-heuristic which simulates the attraction– repulsion mechanism of electromagnetism theory that is based on Coulomb’s law. EM embodies some attractive ...
8
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration
... The conditional probability of the unknown vector given the noisy observations takes the form of a graphical model, i. e., factorizes according to a hypergraph whose nodes correspond to variables and hyperedges ...
31
Chance constraint problem having parameters as pareto random variables
... chance constraint programming problem using geometric inequality, assuming the coefficients of the decision variables in the chance constraints as Pareto random ...chance constraint programming ...
15
A Constraint Programming Approach for the Team Orienteering Problem with Time Windows
... a constraint propagation mechanism designed to filter out the values in (integer) variable domains that cause infeasible solutions [38, ...the constraint model, algorithms are triggered every time a change ...
33