Full Dynamic Substitutability by SAT Encoding-Reference-Cited by-同舟云学术

Full Dynamic Substitutability by SAT Encoding

Published:2004 Issue: Volume: Page:512-526
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming – CP 2004
language:
Short-container-title:

Author:

Prestwich Steven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-30201-8_38.pdf

Reference35 articles.

1. Bacchus, F., van Beek, P.: On the Conversion Between Non-Binary and Binary Constraint Satisfaction Problems Using the Hidden Variable Method. In: Fifteenth National Conference on Artificial Intelligence, Madison, Wisconsin, USA, pp. 311–318 (1998)

2. Lecture Notes in Computer Science;R. Backofen,1999

3. Lecture Notes in Artificial Intelligence;A.M. Beckwith,2001

4. Bellicha, A., Habib, M., Vilarem, M.C., Capelle, C., Kokeny, T.: CSP Techniques Using Partial Orders on Domain Values. In: Schiex, T., Bessière, C. (eds.) ECAI 1994 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam (1994)

5. Benhamou, B.: Study of Symmetry in Constraint Satisfaction Problems. Principles and Practice of Constraint Programming (1994)

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

1. Beyond Consistency and Substitutability;Lecture Notes in Computer Science;2014

2. Representative Encodings to Translate Finite CSPs into SAT;Integration of AI and OR Techniques in Constraint Programming;2014

3. Value Interchangeability in Scenario Generation;Lecture Notes in Computer Science;2013

4. Propagation in CSP and SAT;Principles and Practice of Constraint Programming - CP 2006;2006