Compiling constraint satisfaction problems

DOI10.1016/S0004-3702(99)00077-6MaRDI QIDQ1606322zbMATH OpenOpenAlexFDO

Authors Rainer Weigel, Boi Faltings

Publication date 24 July 2002

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0004-3702(99)00077-6

zbMATH Keywords

planningscheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
• scientific article; zbMATH DE number 1234562
• Basic techniques for creating an efficient CSP solver
• Constraint satisfaction problems: Algorithms and applications
• scientific article; zbMATH DE number 1094771

Cites work

• scientific article; zbMATH DE number 683337 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Decomposing constraint satisfaction problems using database techniques
• Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
• Network-based heuristics for constraint-satisfaction problems
• Networks of constraints: Fundamental properties and applications to picture processing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
• Refining the phase transition in combinatorial search
• Synthesizing constraint expressions
• Tree clustering for constraint networks
• `` Strong NP-Completeness Results

Cited in

(12)

• Learning cluster-based structure to solve constraint satisfaction problems
• Compiling CSPs into tree-driven automata for interactive solving
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• scientific article; zbMATH DE number 4164192 (Why is no real title available?)
• scientific article; zbMATH DE number 4187150 (Why is no real title available?)
• Interchangeability with thresholds and degradation factors for soft CSPs
• Hierarchical fault diagnosis for discrete-event systems under global consistency
• scientific article; zbMATH DE number 4112072 (Why is no real title available?)
• scientific article; zbMATH DE number 5510503 (Why is no real title available?)
• Principles and Practice of Constraint Programming – CP 2004
• Knowledge compilation using interval automata and applications to planning
• SmartClients: Constraint satisfaction as a paradigm for scaleable intelligent information systems

This page was built for publication: Compiling constraint satisfaction problems

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