A simplifier for propositional formulas with many binary clauses

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 515-520

  Brafman, Ronen I ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; CONJUNCTIVE NORMAL FORMS; EXPERIMENTAL EVALUATION; IMPLICATION GRAPHS; LITERALS; PROPOSITIONAL FORMULAS;

AUTOMATIC TEST PATTERN GENERATION; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

EID: 84880866201     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. B. Aspvall, M. Plass, and R. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8:121-123, 1979.
2. R. J. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. AAAI-97, pages 203-208, 1997.
3. R. I. Brafman. Reachability, relevance, resolution, and the planning as satisfiability approach. In IJCAI'99, pages 976-981, 1999.
4. S. A. Cook. The complexity of theorem proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing. ACM, 1971.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communication of the ACM, 5(7):394-397, July 1962.
6. M. D. Ernst, T. D. Millstein, and D. S. Weld. Automatic SAT-compilation of planning problems. In Proceedings of the International Joint Conference on Artificial Intelligence, 1997.
7. C. P. Gomes, B. Selman, and H. Kautz. Boosting combinatorial search through randomization. In Proc. of 15th Nat. Conf. AI, pages 431-437, 1998.
8. H. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. of the 13th National Conference on AI (AAAI'96), pages 1194-1201, 1996.
9. H. Kautz and B. Selman. Unifying sat-based and graph-based planning. In Proc. 16th Intl. Joint Conf. on AI (IJCAI'99), pages 318-325, 1999.
10. T. Larrabee. Test pattern generation using boolean satisfiability. IEEE Transactions on Computer-Aided Design, pages 4-15, January 1992.
11. C. M. Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proc. IJCAI-97, 1997.
12. J. A. Robinson. Automatic deduction with hyper-resolution. Int. J. of Com. Math, 1:227-234, 1965.
13. B. Selman, H. J. Levesque, and D. Mitchell. Gsat: A new method for solving hard satisfiability problems. In Proc. of the 10th National Conf. on AI (AAAI '92), pages 440-446, 1992.
14. Bart Selman, Henry A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. Nat. Conf. on AI, pages 337-343, 1994.
15. O. Shtrichman. Tuning sat checkers for bounded model checking. In E.A. Emerson and A.P. Sistla, editors, Computer Aided Verification 2000, 2000.
16. A. Van Gelder and Y. K. Tsuji. Satisfiability testing with more reasoning and less guessing. In D. S. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. American Mathematical Society, 1996.