A Generic Framework for Implicate Generation Modulo Theories
Logic in Computer Science
2018-07-13 v1
Abstract
The clausal logical consequences of a formula are called its implicates. The generation of these implicates has several applications, such as the identification of missing hypotheses in a logical specification. We present a procedure that generates the implicates of a quantifier-free formula modulo a theory. No assumption is made on the considered theory, other than the existence of a decision procedure. The algorithm has been implemented (using the solvers MiniSat, CVC4 and Z3) and experimental results show evidence of the practical relevance of the proposed approach.
Keywords
Cite
@article{arxiv.1807.04557,
title = {A Generic Framework for Implicate Generation Modulo Theories},
author = {Mnacho Echenim and Nicolas Peltier and Yanis Sellami},
journal= {arXiv preprint arXiv:1807.04557},
year = {2018}
}