Sciweavers

491 search results - page 5 / 99
» An Interpolating Theorem Prover
Sort
View
CSL
2010
Springer
13 years 10 months ago
A Formalisation of the Normal Forms of Context-Free Grammars in HOL4
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
Aditi Barthwal, Michael Norrish
SAT
2010
Springer
125views Hardware» more  SAT 2010»
14 years 21 days ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
TPHOL
2003
IEEE
14 years 2 months ago
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
Hasan Amjad
TPHOL
2000
IEEE
14 years 1 months ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin
TABLEAUX
2005
Springer
14 years 2 months ago
Proof Output and Transformation for Disconnection Tableaux
For applications of first-order automated theorem provers in a wider verification context it is essential to provide a means of presenting and checking automatically found proofs...
Philipp Correll, Gernot Stenz