Enrico Lipparini, Stefan Ratschan. Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. // Journal of Automated Reasoning. – 2025. – DOI: 10.1007/s10817-024-09716-3. – URL: https://doi.org/10.1007/s10817-024-09716-3
Enrico Lipparini & Stefan Ratschan (2025). Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem. Journal of Automated Reasoning. https://doi.org/10.1007/s10817-024-09716-3
Enrico Lipparini and Stefan Ratschan. “Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem.” Journal of Automated Reasoning, 2025. doi:10.1007/s10817-024-09716-3.
@article{Lipparini2025,
title = {Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem},
author = {Lipparini, Enrico and Ratschan, Stefan},
journal = {Journal of Automated Reasoning},
year = {2025},
doi = {10.1007/s10817-024-09716-3},
url = {https://doi.org/10.1007/s10817-024-09716-3}
}