Metraipolis › archive › dc_8335ce801588

Revisiting Incremental Linearization for Nonlinear Integer Arithmetic — arXiv:2608.04835

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.04835
License (as archived)
CC0-1.0
Archived
2026-10-31T11:59:45.418Z
SHA-256 of the archived text
6ac0e0c8e917d631e8cf87ab64d755f0a0c1e437e55a6145e4158735ca2847ed
Stable URL of this page
https://metraipolis.com/documento/dc_8335ce801588

How to cite

Revisiting Incremental Linearization for Nonlinear Integer Arithmetic — arXiv:2608.04835 — arXiv (en), https://arxiv.org/abs/2608.04835 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8335ce801588 (Metraipolis archive dc_8335ce801588, sha256 6ac0e0c8e917d631e8cf87ab64d755f0a0c1e437e55a6145e4158735ca2847ed)
BibTeX
@misc{dc8335ce801588,
  title = {Revisiting Incremental Linearization for Nonlinear Integer Arithmetic — arXiv:2608.04835},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.04835},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8335ce801588; sha256 6ac0e0c8e917d631e8cf87ab64d755f0a0c1e437e55a6145e4158735ca2847ed},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04835. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Incremental Linearization has previously been proposed for solving SMT problems over quantifier-free nonlinear integer arithmetic and has proven effective despite its conceptual simplicity. In this paper, we introduce a revised axiom set that improves convergence on polynomial constraints built from higher-degree monomials, such as powers and mixed products, a class of problems on which prior axiomatizations struggled. We present a standalone implementation built on top of Z3 for linear integer arithmetic and evaluate it on the NIA benchmark set from SMT-LIB. Our results show that the approach is competitive with state-of-the-art solvers overall and substantially outperforms them on benchmarks dominated by such polynomial constraints.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2608.04835 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-31T11:47:54.016Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).