Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
Languages that capture complexity classes
SIAM Journal on Computing
Handbook of theoretical computer science (vol. B)
Model checking
Model Checking and Transitive-Closure Logic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
SIGACT news complexity theory column 49
ACM SIGACT News
A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL
Information Processing Letters
Games for Temporal Logics on Trees
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Succinctness of epistemic languages
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
On the relative succinctness of two extensions by definitions of multimodal logic
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Structure theorem and strict alternation hierarchy for FO2 on words
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
On the succinctness of some modal logics
Artificial Intelligence
On the complexity of existential positive queries
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We introduce a new Ehrenfeucht--Fraïssé game for proving lower bounds on the size of first-order formulas. Up until now, such games have only been used to prove bounds on the operator depth of formulas, not their size. We use this game to prove that the CTL+ formula, Occurn ≡ E[Fp1 ∧ Fp2 ∧ … ∧ Fpn], which says that there is a path along which the predicates p1 through pn all occur, requires size n! to express in CTL. Our lower bound is optimal. It follows that the succinctness of CTL+ with respect to CTL is exactly Θ(n)!. Wilke had shown that the succinctness was at least exponential [Wilke 1999].We also use our games to prove an optimal Ω(n) lower bound on the number of boolean variables needed for forward reachability logic (RLf) to polynomially embed the language CTL+. The number of booleans needed for full reachability logic RL and the transitive closure logic FO2(TC) remain open [Immerman and Vardi 1997; Alechina and Immerman 2000].