Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row-Reference-Cited by-同舟云学术

Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row

Published:2015 Issue: Volume: Page:330-340
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Nightingale Peter,Spracklen Patrick,Miguel Ian

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-23219-5_23

Reference29 articles.

1. Lecture Notes in Computer Science;I Araya,2008

2. Audemard, G., Katsirelos, G., Simon, L.: A restriction of extended resolution for clause learning sat solvers. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)

3. Lecture Notes in Computer Science;C Barrett,2011

4. Biere, A., Heule, M., van Maaren, H.: Handbook of Satisfiability, vol. 185. IOS Press (2009)

5. Cocke, J.: Global common subexpression elimination. ACM Sigplan Notices 5(7), 20–24 (1970)

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

1. A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models;Lecture Notes in Computer Science;2024

2. Single Constant Multiplication for SAT;Lecture Notes in Computer Science;2024

3. Conjure: Automatic Generation of Constraint Models from Problem Specifications;Artificial Intelligence;2022-09

4. Coupling Different Integer Encodings for SAT;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2022

5. Exploring Lifted Planning Encodings in Essence Prime;Frontiers in Artificial Intelligence and Applications;2021-10-14