Prime Implicate Generation in Equational Logic (extended Abstract)
Abstract
A procedure is proposed to efficiently generate sets of ground implicates of first-order formulas with equality. It is based on a tuning of the superposition calculus, enriched with rules that add new hypotheses on demand during the proof search. Experimental results are presented, showing that the proposed approach is more efficient than state-of-the-art systems.
Cite
Text
Echenim et al. "Prime Implicate Generation in Equational Logic (extended Abstract)." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/790Markdown
[Echenim et al. "Prime Implicate Generation in Equational Logic (extended Abstract)." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/echenim2018ijcai-prime/) doi:10.24963/IJCAI.2018/790BibTeX
@inproceedings{echenim2018ijcai-prime,
title = {{Prime Implicate Generation in Equational Logic (extended Abstract)}},
author = {Echenim, Mnacho and Peltier, Nicolas and Tourret, Sophie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
pages = {5588-5592},
doi = {10.24963/IJCAI.2018/790},
url = {https://mlanthology.org/ijcai/2018/echenim2018ijcai-prime/}
}