Branching rules for satisfiability-Reference-Cited by-同舟云学术

Branching rules for satisfiability

Published:1995 Issue:3 Volume:15 Page:359-383
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Hooker J. N.,Vinay V.

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00881805.pdf

Reference26 articles.

1. Amini, M. M. and Racer, M.: A variable-depth-search heuristic for the generalized assignment problem,Management Science, to appear.

2. Technical report;H. Böhm,1992

3. Cook, S. A.: The complexity of theorem-proving procedures, inProc. 3rd Annual ACM Symp. on the Theory of Computing, 1971, pp. 151?158.

4. Crawford, J.: Problems contributed to DIMACS. For information contact Crawford at AT&T Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ, 07974-0636 USA, e-mail jc@research.att.com.

5. Davis, M. and Putnam, H.: A computing procedure for quantification theory,J. ACM 7 (1960), 201?215.

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

1. A Verified Implementation of the DPLL Algorithm in Dafny;Mathematics;2022-06-28

2. Chapter 34. Stochastic Boolean Satisfiability;Frontiers in Artificial Intelligence and Applications;2021-02-02

3. Chapter 8. Fundaments of Branching Heuristics;Frontiers in Artificial Intelligence and Applications;2021-02-02

4. Clause tableaux for maximum and minimum satisfiability;Logic Journal of the IGPL;2019-08-27

5. Research of Branching Heuristic Strategy for Implied Literal in Shortest Clause for SAT Problem;Proceedings of the 2017 International Conference on Deep Learning Technologies - ICDLT '17;2017