Methods for Interactive Constraint Satisfaction
Explore this paper's citation graph
Summary
A method of offline compilation is proposed to circumvent this intractability and achieve short response times for these fundamental operations of an interactive constraint solver, based on existing methods for tree clustering and solution synthesis.
- Type
- article
- Published
- 2003-01-01
- Cited by
- 19
- References
- 93
- OpenAlex
- https://openalex.org/W60599022
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7290825
Keywords
Constraint satisfaction problem, Constraint satisfaction dual problem, Constraint satisfaction, Computer science, Constraint learning
References
- Graph Minors: XV. Giant Steps
- Solving Constraint Satisfaction Problems Using Finite State Automata
- Belief Maintenance in Dynamic Constraint Networks
- Dynamic Constraint Satisfaction Problems
- Eliminating Interchangeable Values in Constraint Satisfaction Problems
- An Efficient Cross Product Representation of the Constraint Satisfaction Problem Search Space
- Configuration as Composite Constraint Satisfaction
- An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
- Arc-Consistency and Arc-Consistency Again
- Comments on Mohr and Henderson's Path Consistency Algorithm
- Why AC-3 is Almost Always Better than AC4 for Establishing Arc Consistency in CSPs
- Sorting and Searching on the Word RAM
- PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS *
- Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
- HOW GOOD IS THE SIMPLEX ALGORITHM
- A Survey of Tractable Constraint Satisfaction Problems
- Essays in computing science
- Refining the Basic Constraint Propagation Algorithm
- Decomposing Constraint Satisfaction Problems Using Database Techniques
- Different perspectives of the N-Queens problem
Cited by
- A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
- FAST BACKTRACK-FREE PRODUCT CONFIGURATION USING A PRECOMPILED SOLUTION SPACE REPRESENTATION
- Calculating Valid Domains for BDD-Based Interactive Configuration
- Efficient interactive configuration of unbounded modular systems
- Penjadwalan Matakuliah Dengan Menggunakan Algoritma Genetika Dan Metode Constraint Satisfaction
- DEVELOPMENT OF INDUSTRIAL VISUALIZATION TOOLS FOR VALIDATION OF VEHICLE CONFIGURATION RULES
- Proceedings of the CP 2006 Doctoral Programme
- Optimasi Penjadwalan Damping Mahasiswa Difabel Menggunakan Algoritma Genetik (Studi Kasus Psld Universitas Brawijaya)
- Constraint Solver Requirements for Interactive Configuration
- Solver Requirements for Interactive Configuration
- Semantic knowledge in generation of 3D layouts for decision-making
- Constraint satisfaction approach to product configuration with cost estimation
- Interactive Model Expansion in an Observable Environment
- Interactive Distributed Configuration
- Comparing Two Implementations of a Complete and Backtrack-Free Interactive Configurator
- Linear Functions for Interactive Configuration Using Join Matching and CSP Tree Decomposition
- Interactive Reconfiguration in Power Supply Restoration
- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
- Comparing T w o Implementations of a Complete and B ack track-Free Interactiv e Confi g u rator
Related papers
- Graph-Based Algorithms for Boolean Function Manipulation
- FAST BACKTRACK-FREE PRODUCT CONFIGURATION USING A PRECOMPILED SOLUTION SPACE REPRESENTATION
- Constraint satisfaction, databases, and logic
- Constraint satisfaction problems: Algorithms and applications
- Solving very large distributed constraint satisfaction problems