Compiling constraint satisfaction problems

DOI10.1016/S0004-3702(99)00077-6zbMATH Open0996.68185OpenAlexW1998893408MaRDI QIDQ1606322FDOQ1606322

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

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

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)

Cites Work

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

Cited In (12)

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

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)