Social networks and discovery in the enterprise (SaND)
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
We investigate extensions of temporal logic by connectives defined by finite automata on infinite words. We consider three different logics, corresponding to three different types of acceptance conditions (finite, looping, and repeating) for the automata. It turns out, however that these logics all have the same expressive power and that their decision problems are all PSPACE-complete. We also investigate connectives defined by alternating automata and show that they do not increase the expressive power of the logic or the complexity of the decision problem. © 1994 Academic Press, Inc.
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science
Michael D. Moffitt
ICCAD 2009