Corpus ID: 122838911

SMT Solving Modulo Tableau and Rewriting Theories

@inproceedings{Bury2018SMTSM,
  title={SMT Solving Modulo Tableau and Rewriting Theories},
  author={Guillaume Bury and Simon Cruanes and D. Delahaye},
  year={2018}
}
We propose an automated theorem prover that combines an SMT solver with tableau calculus and rewriting. [...] Key Method To deal with quantified first order formulas, we use metavariables and perform rigid unification modulo equalities and rewriting, for which we introduce an algorithm based on superposition, but where all clauses contain a single atomic formula. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both terms and propositions…Expand

References

SHOWING 1-10 OF 14 REFERENCES
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning
Automated Deduction in the B Set Theory using Typed Proof Search and Deduction Modulo
Theorem Proving Modulo
Theorem Proving with Bounded Rigid E-Unification
Satallax: An Automatic Higher-Order Prover
Special Cases and Substitutes for Rigid E-Unification
  • D. Plaisted
  • Mathematics, Computer Science
  • Applicable Algebra in Engineering, Communication and Computing
  • 2000
E - a brainiac theorem prover
Proving Theorems with the Modification Method
  • D. Brand
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1975
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
...
1
2
...