Adaptive Constraint Satisfaction: The Quickest First Principle

DOI10.1007/978-3-642-01799-5_7MaRDI QIDQ3401730zbMATH OpenOpenAlexFDO

Authors James E. Borrett, Edward Tsang

Publication date 1 February 2010

Published in Intelligent Systems Reference Library (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01799-5_7

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Heuristics for dynamically adapting propagation in constraint satisfaction problems
• A complete adaptive algorithm for propositional satisfiability
• Adapting consistency in constraint solving
• Adaptive application of SAT solving techniques
• Automata, Languages and Programming
• Artificial Intelligence: Methodology, Systems, and Applications
• scientific article; zbMATH DE number 5510694
• An efficient algorithm for a class of constraint satisfaction problems
• On the efficient approximability of constraint satisfaction problems

Cited in

(3)

• Adapting consistency in constraint solving
• Intelligent search strategies based on adaptive Constraint Handling Rules
• Dynamic algorithm selection for Pareto optimal set approximation

Describes a project that uses

Uses Software

• SATzilla

This page was built for publication: Adaptive Constraint Satisfaction: The Quickest First Principle

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