arXiv (All)
open access
A note on the reduction from LTLf to LTL
LTLf, a finite word variant of LTL, can be reduced to LTL by introducing a new atomic proposition indicating the prefix of the infinite words that correspond to the finite words that the original LTLf formula was considering. Such a reduction was originally proposed by De Giacomo and Vardi (IJCAI'13
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A note on the reduction from LTLf to LTL#809834
- Zero-Shot Instruction Following in RL via Structured LTL Representations#614917
- Zero-Shot Instruction Following in RL via Structured LTL Representations#613950
- A theory of truth for a class of mathematical languages and an application#739515
- Self-regulating the use of large language models in clinical practice: a risk-stratified approach.#161902
Record · ID 819830
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive