Polarized Rewriting and Tableaux in B Set Theory
Logic in Computer Science
2018-06-25 v1
Abstract
We propose and extension of the tableau-based first-order automated theorem prover Zenon Modulo to polarized rewriting. We introduce the framework and explain the potential benefits. The first target is an industrial benchmark composed of B Set Theory problems.
Cite
@article{arxiv.1806.08536,
title = {Polarized Rewriting and Tableaux in B Set Theory},
author = {Olivier Hermant},
journal= {arXiv preprint arXiv:1806.08536},
year = {2018}
}