Constraint satisfaction

Known as: Constraint, List of constraint satisfaction toolkits 
In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
We provide a full characterization of applicability of The Local Consistency Checking algorithm to solving the non-uniform… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This paper presents a multi-agent oriented method for solving CSPs (Constraint Satisfaction Problems). In this method… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Mathematical Structures in Computer Science / Volume 12 / Issue 04 / August 2002, pp 403 422 DOI: 10.1017/S0960129501003577… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper provides a computational characterization of coherence that applies to a wide range of philosophical problems and… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Multi-tac is a learning system that synthesizes heuristic constraint satisfaction programs. The system takes a library of generic… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
This paper introduces CCS, a Co-evolutionary approach to Constraint Satisfaction. Two types of objects constraints and solutions… (More)
  • figure 1
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We describe a computational model o f how analogs are retrieved from memory using simultaneous satisfaction o f a set o f… (More)
  • figure I
  • figure 2
  • figure 3
  • table 1
  • figure 9
Is this relevant?
Highly Cited
1989
Highly Cited
1989
similarity. Units not yet reached asymptote: 0 Goodness of network: 0.61 Calculating the best mappings after 72 cycles. Best… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Is this relevant?