Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems-Reference-Cited by-同舟云学术

Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems

Published:2005 Issue: Volume: Page:351-365
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
language:
Short-container-title:

Author:

Subbarayan Sathiamoorthy

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11493853_26.pdf

Reference22 articles.

1. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8, 677–691 (1986)

2. Subbarayan, S., Jensen, R.M., Hadzic, T., Andersen, H.R., Hulgaard, H., Møller, J.: Comparing two implementations of a complete and backtrack-free interactive configurator. In: CP 2004 CSPIA Workshop, pp. 97–111 (2004)

3. Gyssens, M., Jeavons, P.G., Cohen, D.A.: Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence 66, 57–89 (1994)

4. Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic CSPs-application to configuration. Artificial Intelligence 1-2, 199–234 (2002)

5. Madsen, J.N.: Methods for interactive constraint satisfaction. Master’s thesis, Department of Computer Science, University of Copenhagen (2003)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams;Logic Programming and Nonmonotonic Reasoning;2015

2. Recommendation Heuristics for Improving Product Line Configuration Processes;Recommendation Systems in Software Engineering;2013-12-20

3. Automated Analysis in Feature Modelling and Product Configuration;Safe and Secure Software Reuse;2013

4. Interactive Reconfiguration in Power Supply Restoration;Principles and Practice of Constraint Programming - CP 2005;2005