A Glimpse of Constraint Satisfaction

Authors:
Edward Tsang
Affiliations:
Department of Computer Science, University of Essex, Colchester, Essex CO4 3SQ, UK E-mail: edward@essex.ac.uk/ URL: http://cswww.essex.ac.uk/CSP
Venue:
Artificial Intelligence Review
Year:
1999

Citing 17
Cited 8

Network-based heuristics for constraint-satisfaction problems

Artificial Intelligence
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
An introduction to Prolog III

Communications of the ACM
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems

Artificial Intelligence - Special volume on constraint-based reasoning
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Tabu search

Modern heuristic techniques for combinatorial problems
GENET: a connectionist architecture for solving constraint satisfaction problems by iterative improvement

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Intelligent scheduling

Intelligent scheduling
Constraint-based reasoning

Constraint-based reasoning
Artificial Intelligence

Artificial Intelligence
Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens

IEEE Expert: Intelligent Systems and Their Applications
Applications of Constraint Programming

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The CHIP System and Its Applications

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Tackling car sequencing problems using a generic genetic algorithm

Evolutionary Computation
Systematic versus stochastic constraint satisfaction

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Fast local search and guided local search and their application to British Telecom's workforce scheduling problem

Operations Research Letters

Optimizing code parallelization through a constraint network based approach

Proceedings of the 43rd annual Design Automation Conference
Modified branch and bound algorithm

EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
Efficiency of parallel genetic algorithm for solving N-queens problem on multicomputer platform

EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Constraint satisfaction problem using modified branch and bound algorithm

WSEAS Transactions on Computers
Safe compositional network sketches: formal framework

Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Data locality and parallelism optimization using a constraint-based approach

Journal of Parallel and Distributed Computing
Floor plan design using block algebra and constraint satisfaction

Advanced Engineering Informatics
Constraint propagation as the core of local search

SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint satisfaction has become an important field in computer science.This technology is embedded in millions of pounds of software used bymajor companies. Many researchers or software engineers in the industrycould have benefited from using constraint technology without realizing it.The aim of this paper is to promote constraint technology by providingreaders with a fairly quick introduction to this field. The approach here isto use the well known 8-queens problem to illustrate the basic techniquesin constraint satisfaction (without going into great details), and leaveinterested readers with pointers to further study this field.