The taming of the (X)OR

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

Volumn 1861, Issue , 2000, Pages 508-522

  Baumgartner, Peter ^a   Massacci, Fabio ^b  

^a University of Koblenz   (Germany)

^b UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AFFINE LOGIC; CIRCUIT VERIFICATION; DECISION PROCEDURE; SIMPLIFICATION RULES; VERIFICATION PROBLEMS;

LOGIC PROGRAMMING; MODEL CHECKING;

GAUSSIAN DISTRIBUTION;

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

References (25)

1. 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,R. Schrag Using CSP look-back techniques to solve real-world SAT instances In Proc. of AAAI-97 203-208. AAAI Press/TheMIT Press 1997.
5. J. Crawford and L. Auton. Experimental results on the crossover po int in random 3SAT. AIJ, 81(1-2):31-57, 1996.
6. C. Chang and R. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.
7. L. Claesen, ed. Formal VLSI Correctness Verification: VLSI Design Methods, volume II. Elsevier, 1990.
8. R. Drechsler, B. Becker, and S. Ruppertz. Manipulation algorithms for KBMDs. In Proc. of TACAS-97, LNCS 1217, pages 4-18. Springer-Verlag, 1997.
9. M. Davis, G. Logeman, and D. Loveland. A machine program for theorem proving. CACM, 5(7), 1962.
10. E. Giunchiglia, A. Massarotto, and R. Sebastiani. Act and the rest will follow: Expliting nondeterminismin planning as satisfiability. In Proc. of AAAI-98, pages 948-952. The MIT Press, 1998.
11. J. Groote and J. Warners. The propositional form ula checker HeerHugo. JAR, 2000. To appear.
12. U. Hustadt and R. Schmidt. Simplification and backjumping in modal tableau. In Proc. of TABLEAUX-98, LNAI 1397 , pages 187-201. Springer-Verlag, 1998.
13. D. Johnson and M. Trick, eds. Cliques, Coloring, satisfiability: the second DIMACS implementation challenge, volume 26 of AMS Series in Discr. Math. and TCS. AMS, 1996.
14. H. Kautz and B. Selman. Pushing the envelo pe: Planning, propositional logic and stocastic search. In Proc. of AAAI-96, pages 1194-1201. The MIT Press, 1996.
15. Chu-Min Li. A constraint-based approach to narrow search trees for satisfiability. IPL, 71(2):75-80, 1999.
16. Chun-Min Li. Integrating equivalency reasoning into Davis-Putnam procedure. To appear in Proc. of AAAI-00.
17. FabioMassacci. Simplification:A general constraint propagation technique for propositional and modal tableaux. In Proc. of TABLEAUX-98, LNAI 1397, pages 217-231. Springer-Verlag, 1998.
18. Fabio Massacci. Using Walk-SAT and Rel-sat for cryptographic key search. In Proc. of IJCAI-99, pages 290-295.Morgan Kaufmann, 1999.
19. Fabio Massacci and Laura Marraro. Logical cryptanalysis as a SAT-problem: Encoding and analysis of the u.s. Data Encryption Standard. JAR, 2000. To appear.
20. T. Schaefer. The complexity of satisfiability problems. In Proc. of STOC-78, pages 216-226. ACM Press, 1978.
21. Bart Selman, Henry Kautz, and David McAllester. Ten challenges in propositional resoning and search. In Proc. of IJCAI-97, pages 50-54. Morgan Kaufmann, 1997.
22. J. Wilson. Compact normal forms in propositional logics and integer programming formulations. Comp. and Op. Res., 17(3):309-314, 1990.
23. J. Warners and H. Van Maaren. A two phase algorithm for solving a class of hard satisfiability problems. Op. Res. Lett., 23(3-5):81-88, 1999.
24. J. Warners andH. VanMaaren. Recognition of tractable satisfiability problems through balanced polynomial representations. Discr. Appl. Math., 2000.
25. H. Zhang. SATO: An Efficient Propositional Theorem Prover. In Proc. of CADE 97, LNAI 1249, pages 272-275, 1997. Springer-Verlag.