Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1861, Issue , 2000, Pages 553-567

  Junttila, Tommi A ^a   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; BOOLEAN CIRCUIT; COMPACT REPRESENTATION; DEDUCTION RULE; SATISFIABILITY CHECKING; SATISFIABILITY PROBLEMS; SEARCH HEURISTICS; SEARCH SPACES; SIMPLIFICATION RULES; SYMBOLIC MODEL CHECKING; TABLEAU METHOD;

BOOLEAN FUNCTIONS; HEURISTIC ALGORITHMS; MODEL CHECKING;

LOGIC PROGRAMMING;

EID: 84867831207     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-44957-4_37     Document Type: Conference Paper

References (19)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. InW. R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), volume 1579 of LNCS, pages 193-207. Springer, 1999.
2. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proceedings of the 36th ACM/IEEE Design Automation Conference (DAC'99), pages 317-320. ACM, 1999.
3. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying safety properties of a PowerPC microprocessor using symbolic model checking without BDDs. In N. Halbwachs and D. Peled, editors, Computer Aided Verification: 11th International Conference (CAV'99), volume 1633 of LNCS, pages 60-71. Springer, 1999.
4. A. Borälv. The industrial success of verification tools based on St-Almarck's method. In Proceeding of the 9th International Conference on Computer Aided Verification (CAV'97), volume 1254 of LNCS, pages 7-10, Haifa, Israel, June 1997. Springer.
5. R. Bryant Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 35 8 677-691 1986
6. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, 1992.
7. M. D'Agostino and M. Mondadori. The taming of the cut. Journal of Logic and Computation, 4:285-319, 1994.
8. L. Guerra e Silva, L. M. Silveira, and J. Marques-Silva. Algorithms for solving Boolean satis-Ability in combinatorial circuits. In Design, Automation and Test in Europe (DATE'99), pages 526-530. IEEE, 1999.
9. T. Junttila. BCSat | a satis-Ability checker for Boolean circuits. Available at http://www.tcs.hut.fi/~tjunttil/bcsat.
10. H. Kautz, D. McAllester, and B. Selman. Exploiting variable dep endency in local search. A draft available at http://www.cs.cornell.edu/home/selman/papers-ftp/papers.html, 1997.
11. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference on Artificial Intelligence, Portland, Oregon, July 1996.
12. C. Li and Anbulagan. Look-Ahead versus look-back for satis-Ability problems. In Prin ciples and Practice of Constraint Programming-CP97, volume 1330 of LNCS, pages 341-355. Springer, 1997.
13. F. Massacci. Simpli-cation | a general constraint propagation technique for propositional and mod al tableaux. In H. De Swart, editor, Proceedings of the Inter-national Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-98), pages 217-231. Springer, May 1998.
14. A. Nerode and R. A. Shore. Logic for Applications. Text and Monographs in Computer Science. Springer-Verlag, 1993.
15. I. Niemeläand P. Simons. Efficient implementation of the well-founded and stable model semantics . In M. Maher, editor, Proceedings of the Joint International Con-ference and Symposium on Logic Programming, pages 289-303. The MIT Press, 1996.
16. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1995.
17. R. Sebastiani. Applying GSAT to non-clausal formulas. Journal of Artificial In-telligence Research, 1:309-314, 1994.
18. P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research report A47, Helsinki University of Technology, Helsinki, Finland, August 1997. Availab le at http://www.tcs.hut.fi/pub/reports/A47.ps.gz.
19. H. Zhang. SATO: An efficient propositional prover. In Automated Deduction-CADE-14, volume 1249 of LNCS, pages 272-275. Springer, 1997.