Author:
Baumgartner Peter,Massacci Fabio
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. BCC+99._A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. of ACM/IEEE DAC-99, pages 317–320. ACM Press, 1999.
2. B. Becker, R. Drechsler, and R. Werchner. On the relation between BDDs and FDDs. Inf. and Comp., 123(2):185–197, 1995.
3. K. Brace, R. Rudell, and R. Bryant. Efficient implementation of a BDD package. In Proc. of ACM/IEEE DAC-90, pages 40–45. IEEE Press, 1990.
4. R. Bayardo and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. of AAAI-97, pages 203–208. AAAI Press/TheMIT Press, 1997.
5. J. Crawford and L. Auton. Experimental results on the crossover point in random 3SAT. AIJ, 81(1–2):31–57, 1996.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Simulating Parity Reasoning;Logic for Programming, Artificial Intelligence, and Reasoning;2013
2. Classifying and Propagating Parity Constraints;Lecture Notes in Computer Science;2012
3. Conflict-Driven XOR-Clause Learning;Theory and Applications of Satisfiability Testing – SAT 2012;2012
4. When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way;Computer Aided Verification;2012
5. Variable Dependency in Local Search: Prevention Is Better Than Cure;Theory and Applications of Satisfiability Testing – SAT 2007;2007