Nonsystematic backtracking search
Nonsystematic backtracking search
An Open-Ended Finite Domain Constraint Solver
PLILP '97 Proceedings of the9th International Symposium on Programming Languages: Implementations, Logics, and Programs: Including a Special Trach on Declarative Programming Languages in Education
Generating Satisfiable Problem Instances
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Constraint Processing
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A hyperheuristic approach to select enumeration strategies in constraint programming
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
A hyperheuristic approach for dynamic enumeration strategy selection in constraint satisfaction
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation: new challenges on bioinspired applications - Volume Part II
On generators of random quasigroup problems
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Minimal perturbation problem in course timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Using autonomous search for generating good enumeration strategy blends in constraint programming
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
| Hi-index | 0.00 |
In this paper, we propose an extension of three incomplete depth-first search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards producing incomplete solutions. We also propose a new cutoff strategy for incomplete depth-first search motivated by a human style of problem solving. This technique, called limited assignment number (LAN) search, is based on limiting the number of attempts tried to assign a value to the variable. A linear worst-case time complexity of LAN Search leads to promising stable time behavior in all accomplished experiments. The techniques are studied in the context of constraint satisfaction problems.