2000 character limit reached
Polarized Rewriting and Tableaux in B Set Theory
Published 22 Jun 2018 in cs.LO | (1806.08536v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
