Metraipolis › archive › dc_eeea39376db1

Backward through Time, Algebraically — arXiv:2608.17087

Source: arXiv (en)
Original: https://arxiv.org/abs/2608.17087
License (as archived): CC0-1.0
Archived: 2026-10-18T14:48:28.585Z
SHA-256 of the archived text: 4382d4f5541531bcb6c4f5f60355afd6ba8a379f5d7b2f1bb436464986c1e915
Stable URL of this page: https://metraipolis.com/documento/dc_eeea39376db1

How to cite

Backward through Time, Algebraically — arXiv:2608.17087 — arXiv (en), https://arxiv.org/abs/2608.17087 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eeea39376db1 (Metraipolis archive dc_eeea39376db1, sha256 4382d4f5541531bcb6c4f5f60355afd6ba8a379f5d7b2f1bb436464986c1e915)

BibTeX

@misc{dceeea39376db1,
  title = {Backward through Time, Algebraically — arXiv:2608.17087},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.17087},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eeea39376db1; sha256 4382d4f5541531bcb6c4f5f60355afd6ba8a379f5d7b2f1bb436464986c1e915},
  year = {2026}
}

Archived text

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

Linear temporal logic is a modal extension of propositional logic that allows one to state how a system should behave over time. Its canonical domain is the booleans, but discretely-valued judgements are of little use in steering softly-valued systems (neural policies, adaptive controllers, sequence models, etc). In such cases, the goal formula's (dis)satisfaction becomes a training signal, and differentiability becomes a prime concern. Candidate differentiable semantics abound, but navigating them is tricky. Implementations, where available, are shallow embeddings, demanding an upfront commitment to a single semantic algebra and its (usually implicit) conduct. The paper casts the reader as a functional programmer asked to come to terms with this predicament, and refusing. Out of that refusal comes an evaluation engine that is algebra-generic and amenable to differentiation, together with an executable specification of the algebras it can accept. Various algebras are implemented and audited for their behavior, both forward and backward. Each algebra turns out to be a choice of which direction to disappoint, and how. Everything described (and more) is part of the PyTorch library telos, to be found at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-19 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG) ; Logic in Computer Science (cs.LO); Programming Languages (cs.PL); Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2608.17087 — 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-18T14:47:59.380Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-19?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).