SBSAT: a State-Based, BDD-Based Satisfiability Solver-Reference-Cited by-同舟云学术

SBSAT: a State-Based, BDD-Based Satisfiability Solver

Published:2004 Issue: Volume: Page:398-410
ISSN:0302-9743
Container-title:Theory and Applications of Satisfiability Testing
language:
Short-container-title:

Author:

Franco John,Kouril Michal,Schlipf John,Ward Jeffrey,Weaver Sean,Dransfield Michael,Vanfleet W. Mark

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24605-3_30

Reference25 articles.

1. Lecture Notes in Computer Science;A. Biere,1999

2. Brace, K.S., Rudell, R.L., Bryant, R.E.: Efficient Implementation of a BDD Package. In: ACM Proceedings of the 27th ACM/IEEE Design Automation Conference, pp. 40–45 (1990)

3. Bryant, R.E.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C 35, 677–691 (1986)

4. Cimatti, A., Giunchiglia, E., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV Version 2: BDD-Based + SAT-Based Symbolic Model Checking, Available from http://sra.itc.it/people/roveri/papers/IJCAR01.ps.gz

5. Coudert, O., Madre, J.C.: A Unified Framework for the Formal Verification of Sequential Circuits. In: Proc. of Int’l Conf. on Computer-Aided Design, pp. 126–129 (1990)

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

1. Generating Extended Resolution Proofs with a BDD-Based SAT Solver;ACM Transactions on Computational Logic;2023-07-25

2. Non-clausal Redundancy Properties;Automated Deduction – CADE 28;2021

3. Generating Extended Resolution Proofs with a BDD-Based SAT Solver;Tools and Algorithms for the Construction and Analysis of Systems;2021

4. Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2012

5. A More Efficient BDD-Based QBF Solver;Principles and Practice of Constraint Programming – CP 2011;2011