ocLTL reduces LTL+P realizability and synthesis modulo ω-categorical theories to propositional LTL+P via finite disjunctions over complete types, keeping 2-EXPTIME complexity plus theory-only blowup.
Two- variable logic on data words.ACM Transactions on Computational Logic, 12(4):27:1–27:26,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
ocLTL: LTL Realizability and Synthesis Modulo {\omega}-Categorical Structures
ocLTL reduces LTL+P realizability and synthesis modulo ω-categorical theories to propositional LTL+P via finite disjunctions over complete types, keeping 2-EXPTIME complexity plus theory-only blowup.