A dynamic constraint-directed ordered search algorithm for solving constraint satisfaction problems

Proceedings of the 1st International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, IEA/AIE 1988

Volumn 1, Issue , 1988, Pages 116-125

  Chu, Wesley W ^a   Ngai, Patrick H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; EXPERT SYSTEMS; FORESTRY; JOB SHOP SCHEDULING; OPTIMIZATION; PROBLEM SOLVING;

BACKTRACK FREE; DYNAMIC CONSTRAINTS; ENGINEERING PROBLEMS; GRAPH COLORING PROBLEM; NETWORK CONSISTENCIES; SEARCH ALGORITHMS; SEARCH TREES; SECOND ORDERS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84864700490     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/51909.52120     Document Type: Conference Paper

References (10)

1. Bitner, J.R. and Reingold, E.M., "Backtrack Programming Techniques", Communications of the ACM, Vol 18, No. 11, Nov 1975, 651-656.
2. Dechter, R., "Learning whiler Searching in Constraint Satisfaction Problems", Technical Report #CSD-860049, Computer Science Dept, UCLA, 1986.
3. Dechter, R., "An Integrated Strategy for Improved Backtrack", Technical Report R-77, Computer Science Dept, UCLA, January 1987.
4. Freuder, E.C., "Synthesizing Constraint Expressions", Comm. of ACM, Nov 78, Vol 21, Num 11, 958-966.
5. Freduer, E.C., "A Sufficient Condition for Backtrack-Free Search", ACM, Vol. 29, No. 1, Jan 1982, 24-32.
6. Mackworth, A.K., "Consistency in Networks of Relations", Artificial Intelligence 8, 1977, 99-118.
7. Mackworth, A.K. and Freuder, E.C., "The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems", Artificial Intelligence 25, 1985, 65-74.
8. Montanari, U., "Networks of Constraints: Fundamental Properties and Applications to Picture Processing", Information Sciences 7, 95-132, 1974.
9. Purdom, P.W. Jr., Brown, C.A., and Robertson, E.L., "Backtracking with Multi-Level Dynamic Search Rearrangement", Acta Informatica 15, 99-113, 1981.
10. Stone, H.S., "Efficient Search Techniques - An Empirical Study of the N-Queens Problem", RC 120557 (#54343), IBM T.J. Watson Research Center, Yorktown Heights, NY, 8/6/86.