Extending GENET with lazy arc consistency
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Vol. 28 (5) , 698-703
- https://doi.org/10.1109/3468.709620
Abstract
Many important applications, such as graph coloring, scheduling and production planning, can be solved by GENET, a local search method which is used to solve binary constraint satisfaction problems (CSPs). Where complete search methods are typically augmented with consistency methods to reduce the search, local search methods are not. We propose a consistency technique, lazy arc consistency, which is suitable for use within GENET. We show it can improve the efficiency of the GENET search on some instances of binary CSPs, and does not suffer the overhead of full arc consistencyKeywords
This publication has 12 references indexed in Scilit:
- Extending GENET for non-binary CSP'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Extending GENET with lazy arc consistencyIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 1998
- A FRAMEWORK FOR INTEGRATING ARTIFICIAL NEURAL NETWORKS AND LOGIC PROGRAMMINGInternational Journal on Artificial Intelligence Tools, 1995
- Constraint logic programming: a surveyThe Journal of Logic Programming, 1994
- Solving the satisfiability problem by using randomized approachInformation Processing Letters, 1992
- A Generic Neural Network Approach For Constraint Satisfaction ProblemsPublished by Springer Nature ,1992
- Solving large combinatorial problems in logic programmingThe Journal of Logic Programming, 1990
- Boltzmann machines for travelling salesman problemsEuropean Journal of Operational Research, 1989
- Arc and path consistency revisitedArtificial Intelligence, 1986
- Consistency in networks of relationsArtificial Intelligence, 1977