Metraipolis › archive › dc_dbfe2d242e2b

Solving quantified constraint satisfaction problems with applications to control — arXiv:2610.39776

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.39776
License (as archived): CC0-1.0
Archived: 2026-11-01T02:47:53.100Z
SHA-256 of the archived text: b143308ba58701221c37871aa3a2212bc05cf52e66c99ac50bb502b2aecfc580
Stable URL of this page: https://metraipolis.com/documento/dc_dbfe2d242e2b

How to cite

Solving quantified constraint satisfaction problems with applications to control — arXiv:2610.39776 — arXiv (en), https://arxiv.org/abs/2610.39776 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbfe2d242e2b (Metraipolis archive dc_dbfe2d242e2b, sha256 b143308ba58701221c37871aa3a2212bc05cf52e66c99ac50bb502b2aecfc580)

BibTeX

@misc{dcdbfe2d242e2b,
  title = {Solving quantified constraint satisfaction problems with applications to control — arXiv:2610.39776},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39776},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbfe2d242e2b; sha256 b143308ba58701221c37871aa3a2212bc05cf52e66c99ac50bb502b2aecfc580},
  year = {2026}
}

Archived text

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

Many problems in control can be expressed as quantified constraints, such as robust forward and backward reachability, synthesis of controllers, solutions to motion planning problems. In this paper, we develop a method for computing inner and outer approximations of global solutions to very general quantified constraints, generalizing widely the state of the art on similar problems, usually restricted to at most one alternation of quantifiers or to local solutions. By global solutions, we mean characterizing accurately the entire set of solutions, within some prescribed bounds. For this, our approach uses a set inversion technique relying on oracles for set inclusion using local solutions to related quantified reachability problems. We exemplify the approach throughout the paper on different examples related to control problems.

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.39776 — 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.668Z dalla pagina https://arxiv.org/list/cs.LO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).