Logic and computation: interactive proof with Cambridge LCF
Logic and computation: interactive proof with Cambridge LCF
Introduction to HOL: a theorem proving environment for higher order logic
Introduction to HOL: a theorem proving environment for higher order logic
On the modeling of search in theorem proving—towards a theory of strategy analysis
Information and Computation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
From LCF to HOL: a short history
Proof, language, and interaction
A machine program for theorem-proving
Communications of the ACM
Solution of the Robbins Problem
Journal of Automated Reasoning
Controlling Redundancy in Large Search Spaces: Argonne-Style Theorem Proving Through the Years
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
The Search Efficiency of Theorem Proving Strategies
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Distributed Theorem Proving by Peers
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Logic for Computable Functions: description of a machine implementation.
Logic for Computable Functions: description of a machine implementation.
The metaprl logical programming environment
The metaprl logical programming environment
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Efficient projection orders for CAD
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
Combined Decision Techniques for the Existential Theory of the Reals
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
IBM Journal of Research and Development
A proof method for quantification theory: its justification and realization
IBM Journal of Research and Development
CAV'07 Proceedings of the 19th international conference on Computer aided verification
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
A taxonomy of theorem-proving strategies
Artificial intelligence today
Satisfiability of non-linear (Ir)rational arithmetic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Satisfiability modulo theories: introduction and applications
Communications of the ACM
The Matita interactive theorem prover
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Cutting to the Chase solving linear integer arithmetic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A fast linear-arithmetic solver for DPLL(T)
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Specification of rewriting strategies
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Abstract partial cylindrical algebraic decomposition i: the lifting phase
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Using SMT solvers to automate design tasks for encryption and signature schemes
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
High-performance SMT solvers contain many tightly integrated, hand-crafted heuristic combinations of algorithmic proof methods. While these heuristic combinations tend to be highly tuned for known classes of problems, they may easily perform badly on classes of problems not anticipated by solver developers. This issue is becoming increasingly pressing as SMT solvers begin to gain the attention of practitioners in diverse areas of science and engineering. We present a challenge to the SMT community: to develop methods through which users can exert strategic control over core heuristic aspects of SMT solvers. We present evidence that the adaptation of ideas of strategy prevalent both within the Argonne and LCF theorem proving paradigms can go a long way towards realizing this goal.