(Enter summary)
Abstract: A constraint satisfaction problem (CSP) involves a set of variables, a domain of potential values for each variable, and a set of constraints, which specifies the acceptable combinations of values. One popular approach is to represent the original problem as a constraint network where nodes represent variables and arcs represent constraints between variables. Node consistency and arc consistency techniques are first applied to prune the domains of variables. Constraint propagation techniques... (Update)
Context of citations to this paper: More
...eliminative parsing. In CDG, the decision criteria for deletion of parse structures is formulated as a constraint satisfaction problem (CSP) [37] where the constraints are the grammar rules and the solutions are the parses. Thus, ambiguity is successively reduced towards a...
Cited by: More
Rapid Grammar Development and Parsing: Constraint Dependency.. - White (2000)
(Correct)
Active bibliography (related documents): More All
0.5: Support for Managing Design-Time Decisions - Alexander Egyed Member
(Correct)
0.3: Autour Du Problème De Satisfaction De Contraintes - Bellicha, Neveu, Trousse.. (1994)
(Correct)
0.3: Intelligent Backtracking On Constraint Satisfaction Problems.. - Baker (1995)
(Correct)
Similar documents based on text: More All
0.0: Hybrid Load Value Predictors - Burtscher, Zorn (2000)
(Correct)
0.0: Hybrids - Page
(Correct)
0.0: Optimizing Global-Local Search Hybrids - Goldberg, Voessner (1999)
(Correct)
BibTeX entry: (Update)
Christopher C. Yang and Ming-Hsuan Yang. Constraint networks: A survey. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, volume 2, pages 1930-1935, 1997. http://citeseer.ist.psu.edu/187605.html More
@inproceedings{ yang97constraint,
Author = {{Christopher C. Yang} and {Ming-Hsuan Yang}},
Title = {Constraint networks: {A} survey},
BookTitle = {I{EEE} {I}nternational {C}onference on {S}ystems,
{M}an and {C}ybernetics},
Volume = {2},
Pages = {1930-1935},
year = 1997,
url = {citeseer.ist.psu.edu/187605.html} }
Citations (may not include all citations):
416
A new method for solving hard satisfiability problems
- Selman, Mitchell - 1992
334
A truth maintenance system (context) - Doyle - 1979
307
Networks of constraints: Fundamental properties and applicat.. (context) - Montanari - 1974
267
Network-based heuristics for constraint-satisfaction problem.. (context) - Dechter, Pearl - 1989
265
Increasing tree search efficiency for constraint satisfactio.. (context) - Haralick, Elliot - 1980
210
Minimizing conflicts: A heuristic repair method for constrai..
- Minton, Johnston et al. - 1992
185
The complexity of some polynomial network consistency algori.. (context) - Mackworth, Freuder - 1985
166
Synthesizing constraint expressions (context) - Freuder - 1978
155
Forward reasoning and dependency-directed backtracking in a .. (context) - Stallman, Sussman - 1977
142
Constraint propagation with interval labels (context) - Davis - 1987
141
Tree clustering for constraint networks (context) - Pearl - 1989
132
An assumption-based tms (context) - de Kleer - 1986
83
Building Problem Solvers (context) - Forbus, de - 1993
70
Genet: A connectionist architecture for solving constraint s..
- Daveport, Tsang et al. - 1984
56
Backtrack programming techniques (context) - Binter, Reingold - 1975
53
Constraint reasoning based on interval arithmetic: the toler.. (context) - Hyvonen - 1992
49
Constraint satisfaction using constraint logic programming (context) - Hentenryck, Dinebas - 1992
34
Effective solution of qualitative interval constraint proble.. (context) - Ladkin, Reinefeld - 1992
32
The logic of constraint satisfaction (context) - Mackworth - 1992
32
A comparison of atms and csp techniques (context) - de Kleer - 1989
32
Deduction revision by intelligent backtracking (context) - Bruynooghe, Pereira - 1984
31
An outlook on truth maintenance (context) - McAllester - 1980
16
Constraint satisfaction from a deductive viewpoint (context) - Bibel - 1988
13
Taking advantage of stable sets of variables in constraintsa.. (context) - Freuder, Quinn - 1985
10
Decomposition of domains based on the micro-structure of fin.. (context) - Jegou - 1993
9
Applying genetic algorithms to constraint satisfaction probl.. (context) - Tsang, Warwick - 1990
9
Finding backtrack points for intelligent backtracking (context) - Cox - 1984
6
The many paths to satisfaction (context) - Freuder - 1995
6
An algebraic approach to constraint satisfaction problems (context) - Rivin, Zabig - 1989
5
Intelligent backtracking in plan-based deduction (context) - Matwin, Pietrzykowski - 1985
3
Solving constraint satisfaction problem using finite automat.. (context) - Vempaty - 1992
2
A perspective on assumptionbased truth maintenance (context) - de - 1993
1
Tolerance design by interval constraint networks (context) - Yang, Ciarallo - 1997
1
Constraint networks with integer, real, and interval values .. (context) - Yang, Ciarallo - 1997
1
Experimental case studies of backtrack vs. waltz-type vs. ne.. (context) - Gasching - 1978
1
Tolerance analysis and synthesis by interval constraint netw.. (context) - Yang, Ciarallo - 1997
1
A general backtracking algorithm that eliminates most redund.. (context) - Gasching - 1977
Documents on the same site (http://uirvli.ai.uiuc.edu/mhyang/pubs.html): More
Gaussian Mixture Model for Human Skin Color and Its.. - Yang, Ahuja (1999)
(Correct)
Extraction and Classification of Visual Motion Patterns for.. - Yang, Ahuja (1998)
(Correct)
Constraint-Based Feature Recognition: Handling Non-uniqueness.. - Yang, Marefat (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC