Complexity of constraint satisfaction
Replaceability for Constraint Satisfaction Problems: Algorithms, Inference, and Complexity Patterns
... Building from the results reported in [6], the present work extends the analysis of this property. In the first place, we consider other algorithms that have been proposed in recent years to determine whether they are ...
13
Log-supermodular functions, functional clones and counting CSPs.
... computational complexity of counting constraint satisfaction problems (counting CSPs), particularly the complexity of approximation, we study functional clones of functions on the Boolean ...
26
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems
... While there are many cryptographic protocols for which efficient reductions from BH RAM are de- sirable, we choose to focus on the problem of constructing efficient reductions from BH RAM for proof systems for NP . Also, ...
101
An effective dichotomy for the counting constraint satisfaction problem
... 1.1. Our proofs. Our proofs are almost entirely self-contained and should be accessible to readers with no knowledge of universal algebra and very little background in CSP. We use reductions from two previous papers on ...
30
Conditional Random Fields, Planted Constraint Satisfaction, and Entropy Concentration
... At an algorithmic level, the problem of finding the smallest cut in a graph with two equally sized groups, i. e., the min-bisection problem, is well-known to be NP-hard [26]. Concerning average-case complexity, ...
31
Applying quantum algorithms to constraint satisfaction problems
... Next, the requirement of broad utility rules out the exponential speedups discussed above. In general, quantum algorithms that are broadly applicable to ac- celerating classical algorithms tend to achieve at best ...
30
Sharp Thresholds for a Random Constraint Satisfaction Problem
... DOI: 10.4236/ojapps.2017.710041 576 Open Journal of Applied Sciences and a reinforced belief propagation algorithm [23] to solve the random instances of RB model. Furthermore, they identify the connection between the ...
11
Perturbed Message Passing for Constraint Satisfaction Problems
... solving Constraint Satisfaction Prob- lems (CSPs), which uses stochastic perturbation of Belief Propagation (BP) and Survey Propagation (SP) messages to bypass decimation and directly produce a single ...
26
Question Answering Using Constraint Satisfaction: QA By Dossier With Contraints
... We had initially thought that use of constraints would obviate the need for much of the complexity inherent in NLP. As mentioned earlier, with the case of “The Beatles” being the reciprocal answer to the auxiliary ...
8
Structural competition in second language production : towards a constraint-satisfaction model
... overview), one of which can be the perceptual salience of the element in question. While functional morphemes in general have low salience compared to content words, English articles are perceptually more salient than ...
52
Maximum constraint satisfaction on diamonds
... both complexity classifications and approximation properties (see, ...and complexity for subproblems of non-Boolean Max CSP has started only very recently [8, 21], and the present paper is a contribution ...
19
Constant query testability of assignments to constraint satisfaction problems
... In constraint satisfaction problems (for short, CSPs), one is given a set of variables and a set of constraints imposed on the variables, and the task is to find an assignment of the variables that ...
27
Planning texts by constraint satisfaction
... Much recent work on language generation (Rosner and Stede, 1992; Hovy, 1993; Mellish et al., 1998) has made use of discourse representations based on Rhetorical Structure Theory (RST) (Mann and Thompson, 1988). Interest ...
7
From Shallow to Deep Parsing Using Constraint Satisfaction
... Moreover, the study of the maximal complexity of the deep parser has to be treated as another problem. Usually, such a study must have to be done taking care of the size of the grammar. But with property grammars, ...
7
CONSTRAINT SATISFACTION PROBLEM: A CASE STUDY Jyoti 1, Tarun Dalal2
... computational complexity theory and finite model ...of constraint relations), or where the constraints have arbitrary form but there exist essentially non-unary polymorphisms [clarification needed] of the ...
6
A Method for Relating Multiple Newspaper Articles by Using Graphs, and Its Application to Webcasting
... In our algorithm for constructing a similarity matrix, shown in Figure 4, the complexity of constructing a graph structure for an article set by using a constraint is On.. The following [r] ...
7
An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems
... Portfolio solvers have proven to be very efficient, especially for solving the Boolean satisfiability (SAT) problem. For instance, the SAT portfolio solvers 3S [21] and CSHC [30] won gold medals in the SAT Competition ...
6
temporal pattern detection as temporal constraint satisfaction unpublished
... temporal constraint satisfaction problem (TCSP) onto the classic constraint satisfaction problem (CSP) ...a constraint on a given pair of intervals and therefore each edge label ...
12
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 ...for constraint ...
38
Service robot planning via solving constraint satisfaction problem
... through constraint satisfaction problem (CSP) is developed to create a language that allows users to express goals with- out having to know about the details and interdependen- cies between services ...
17