Metraipolis › archive › dc_a27de2c1bc9d
On Deciding the Constraint Loop Problem in Dimension Two — arXiv:2610.40378
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40378
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:47:54.615Z
- SHA-256 of the archived text
42d06c8c51334b5c0867a3c697549ac8436b9b3e9d2718b7a02f07e470d407ee- Stable URL of this page
https://metraipolis.com/documento/dc_a27de2c1bc9d
How to cite
On Deciding the Constraint Loop Problem in Dimension Two — arXiv:2610.40378 — arXiv (en), https://arxiv.org/abs/2610.40378 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a27de2c1bc9d (Metraipolis archive dc_a27de2c1bc9d, sha256 42d06c8c51334b5c0867a3c697549ac8436b9b3e9d2718b7a02f07e470d407ee)
BibTeX
@misc{dca27de2c1bc9d,
title = {On Deciding the Constraint Loop Problem in Dimension Two — arXiv:2610.40378},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40378},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a27de2c1bc9d; sha256 42d06c8c51334b5c0867a3c697549ac8436b9b3e9d2718b7a02f07e470d407ee},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40378. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Recently, Guilmant, Lefaucheux, Ouaknine, and Worrell [2] proved decidability of the termination problem for linear constraint loops over two real-valued variables, thus settling a wellknown open problem. Their algorithm is based on a theoretical result that such a loop does not terminate if and only if it has a witness of an infinite run of a specific shape. By analysing the structure of the witness carefully, we show that termination such loops can be decided in polynomial time, improving on the polynomial space bound argued by Guilmant et al. We also present an efficient implementation of the polynomial-time algorithm based on the satisfiability modulo theories (SMT) solver Z3. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.LO, nuovi lavori del giorno). Categorie arXiv: Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2610.40378 — 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-11-01T02:18:13.673Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).