An Automation-Friendly Set Theory for the B Method

@inproceedings{Bury2018AnAS,
  title={An Automation-Friendly Set Theory for the B Method},
  author={Guillaume Bury and Simon Cruanes and D. Delahaye and Pierre-Louis Euvrard},
  booktitle={ABZ},
  year={2018}
}
We propose an automation-friendly set theory for the B method. This theory is expressed using first order logic extended to polymorphic types and rewriting. Rewriting is introduced along the lines of deduction modulo theory, where axioms are turned into rewrite rules over both propositions and terms. We also provide experimental results of several tools able to deal with polymorphism and rewriting over a benchmark of problems in pure set theory (i.e. without arithmetic). 
Integrating rewriting, tableau and superposition into SMT
Proof Automation in the Theory of Finite Sets and Finite Set Relation Algebra

References

SHOWING 1-5 OF 5 REFERENCES
Theorem Proving Modulo
TFF1: The TPTP Typed First-Order Form with Rank-1 Polymorphism
The B-book - assigning programs to meanings