3 papers
cs.LO2026
ocLTL: LTL Realizability and Synthesis Modulo ω-Categorical Structures
Ohad Asor
We introduce ocLTL, the case of LTL+P modulo ω-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The…
cs.LO2024
Guarded Successor: A Novel Temporal Logic
Ohad Asor
We present GS (Guarded Successor), a novel decidable temporal logic with several unique distinctive features. Among those, it allows infinitely many data values that come not only…
cs.AI2015
About Tau-Chain
Ohad Asor
Tau-chain is a decentralized peer-to-peer network having three unified faces: Rules, Proofs, and Computer Programs, allowing a generalization of virtually any centralized or decent…