Theorem Proving Using Lazy Proof Explication
Cormac Flanagan A, Rajeev Joshi, Xinming Ou et al. · Lecture notes in computer science · 2003
Cited by 112 works. doi:10.1007/978-3-540-45069-6_34
Authors
References
- A Computing Procedure for Quantification Theory
- Chaff
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Simplification by Cooperating Decision Procedures
- GRASP: a search algorithm for propositional satisfiability
- SATO: An efficient propositional prover
- Efficient Conflict Driven Learning in a Boolean Satisfiability Solver
- Fast Decision Procedures Based on Congruence Closure
- Techniques for program verification
- Deciding Combinations of Theories