scientific article; zbMATH DE number 4162307

zbMATH Open0707.68081MaRDI QIDQ3489503FDOQ3489503

Authors: Itay Meiri, Rina Dechter 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Backjump-based backtracking for constraint satisfaction problems
• Dynamic variable ordering in graph based backjumping algorithms for csps
• Constraint processing. Proceedings of workshops held in conjunction with the international congress on computer systems and applied mathematics (CSAM '93) in St. Petersburg, Russia and the European conference on artificial intelligence (ECAI '94) held in
• A theoretical evaluation of selected backtracking algorithms.
• Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search

zbMATH Keywords

constraint satisfaction problemsbacktrackingbackjumpingconsistency algorithms in constraint networks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30) Network design and communication in computer systems (68M10)

Cited In (6)

• Temporal constraint networks
• From local to global consistency
• Reasoning about qualitative temporal information
• Guarantees and limits of preprocessing in constraint satisfaction and reasoning
• Scheduling with neural networks -- the case of the Hubble Space Telescope
• Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3489503)