Variable Dependency in Local Search: Prevention Is Better Than Cure-Reference-Cited by-同舟云学术

Variable Dependency in Local Search: Prevention Is Better Than Cure

Published:2007 Issue: Volume: Page:107-120
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing – SAT 2007
language:
Short-container-title:

Author:

Prestwich Steven

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-72788-0_14

Reference35 articles.

1. Lecture Notes in Computer Science;C. Ansótegui,2005

2. Lecture Notes in Computer Science;O. Bailleux,2003

3. Lecture Notes in Artificial Intelligence;P. Baumgartner,2000

4. Crawford, J.M., Kearns, M.J., Shapire, R.E.: The Minimal Disagreement Parity Problem as a Hard Satisfiability Problem. Technical report, Computational Intelligence Research Laboratory and AT&T Bell Labs (1994)

5. Ernst, M., Millstein, T., Weld, D.S.: Automatic SAT-Compilation of Planning Problems. In: Fifteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, San Francisco (1997)

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

1. Parallel Maximum Satisfiability;Handbook of Parallel Constraint Reasoning;2018

2. Propositional SAT Solving;Handbook of Model Checking;2018

3. Solving MaxSAT by Successive Calls to a SAT Solver;Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016;2017-08-20

4. Logic-Based Encodings for Ricochet Robots;Progress in Artificial Intelligence;2017

5. Boolean Satisfiability-Based Routing and Its Application to Xilinx UltraScale Clock Network;Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays;2016-02-21