Efficient SAT engines for concise logics: Accelerating proof search for zero-one linear constraint systems

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

Volumn 2850, Issue , 2003, Pages 302-316

  Fränzle, Martin ^a   Herde, Christian ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Acceleration techniques; Non clausal propositional logic; Proof search; Satisfiability; Zero one linear constraint systems

Indexed keywords

AUTOMATION; BOOLEAN ALGEBRA; COMPUTER AIDED DESIGN; COMPUTER PROGRAMMING LANGUAGES; FORMAL LOGIC; LEARNING SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL LINGUISTICS; ENGINES; MODEL CHECKING;

ACCELERATION TECHNIQUES; NON-CLAUSAL PROPOSITIONAL LOGIC; PROOF SEARCH; SATISFIABILITY; ZERO-ONE LINEAR CONSTRAINT SYSTEMS;

LINEAR SYSTEMS; FORMAL LOGIC;

ACCELERATION TECHNIQUE; LINEAR CONSTRAINTS; PROOF SEARCH; PROPOSITIONAL LOGIC; SATISFIABILITY;

EID: 9444262563     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39813-4_22     Document Type: Conference Paper

References (22)

1. Fadi A. Aloul, Arathi Ramani, Igor L. Markov, and Karem A. Sakallah. Generic ILP versus specialized 0-1 ILP: An update. In Proc. ACM/IEEE Intl. Conf. Comp.-Aided Design (ICCAD), pages 450-457, November 2002.
2. L. Baptista, I. Lynce, and J. Marques-Silva. Complete search restart strategies for satisfiability. In Proc. of the IJCAI'01 Workshop on Stochastic Search Algorithms (IJCAI-SSA), August 2001.
3. L. Baptista and J. P. Marques-Silva. Using randomization and learning to solve hard real-world instances of satisfiability. In Proc. of the 6th International Conference on Principles and Practice of Constraint Programming, 2000.
4. Peter Barth. A Davis-Putnam based enumeration algorithm for linear pseudoboolean optimization. Technical Report MPI-I-95-2-003, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1995.
5. A. Biere, A. Cimatti, and Y. Zhu. Symbolic model checking without BDDs. In TACAS'99, volume 1579 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
6. Donald Chai and Andreas Kuehlmann. A fast pseudo-boolean constraint solver. In Proc. of the 40th Design Automation Conference (DAC 2003), pages 830-835, Anaheim (California, USA), June 2003. ACM.
7. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
8. Martin Fränzle. Take it NP-easy: Bounded model construction for duration calculus. In Ernst-Rüdiger Olderog and Werner Damm, editors, International Symposium on Formal Techniques in Real-Time and Fault-Tolerant systems (FTRTFT 2002), volume 2469 of Lecture Notes in Computer Science, pages 245-264. Springer-Verlag, 2002.
9. J. F. Groote and J. P. Warners. The propositional formula checker HeerHugo. Technical report SEN-R9905, CWI, 1999.
10. David Harel and Michal Politi. Modeling Reactive Systems with Statecharts. McGraw-Hill Inc., 1998.
11. Rainer Lochmann. Boosting the verification power of the statemate verification engine: on the perfomance benefits of integrating ProverCL. In preparation, 2003.
12. J. P. Marques-Silva. The impact of branching heuristics in propositional satisfiability algorithms. In Proc. of the 9th Portuguese Conference on Artificial Intelligence (EPIA), September 1999.
13. J. P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, May 1999.
14. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), June 2001.
15. Andreas Nonnengart and Christoph Weidenbach. Computing small clause normal forms. In Alen Robinson and Andrei Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science B.V., 1999.
16. J. H. Owen and S. Mehrotra. On the value of binary expansions for general mixedinteger linear programs. Operations Research, 50(5):810-819, 2002.
17. G. Tseitin. On the complexity of derivations in propositional calculus. In A. Slisenko, editor, Studies in Constructive Mathematics and Mathematical Logics, 1968.
18. Joost P. Warners. A linear-time transformation of linear inequalities into conjunctive normal form. Information Processing Letters, 68(2):63-69, 1998.
19. Jesse Whittemore, Joonyoung Kim, and Karem Sakallah. SATIRE: A new incremental satisfiability engine. In Proc. of the 38th Design Automation Conference (DAC 2001), pages 542-545, Las Vegas (Nevada, USA), June 2001.
20. H. Zhang. SATO: An efficient propositional prover. In Proc. of the International Conference on Automated Deduction (CADE), volume 1249 of LNAI, pages 272-275. Springer, 1997.
21. H. Zhang and M. Stickel. An efficient algorithm for unit-propagation. In Proc. of the International Symposium on Artificial Intelligence and Mathematics (AIMATH' 96), pages 166-169, Fort Lauderdale (Florida USA), 1996.
22. L. Zhang, C. F. Madigan, M. W. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proc. of the International Conference on Computer-Aided Design (ICCAD'01), pages 279-285, November 2001.