Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
M. Bojańczyk, C. David, A. Muscholl, T. Schwentick and L. Segoufin. Two-variable logic on words with data, Proc. LICS, Seattle, 2006, 7–16.
M. Bojańczyk. Two-way unary temporal logic over trees, Proc. LICS, Wrocław, 2007.
B. Borchert and P. Tesson. The atnext/atprevious hierarchy on the starfree languages, Report WSI-2004-11 (U. Tübingen 2004).
V. Diekert, P. Gastin and M. Kufleitner. A survey on small fragments of first-order logic over finite words, Int. J. Found. Comp. Sci., to appear.
K. Etessami, M.Y. Vardi and T. Wilke. First-order logic with two variables and unary temporal logic, Inf. Comput. 179, 2002, 279–295.
S.N. Krishna and P.K. Pandya. Modal strength reduction in quantified discrete duration calculus, Proc. FSTTCS, Hyderabad (R. Ramanujam and S. Sen, eds.), LNCS 3821, 2005, 444–456.
M. Kufleitner. Polynomials, fragments of temporal logic and the variety DA over traces, Theoret. Comp. Sci. 376, 2007, 89–100.
M. Kufleitner and P. Weil. On FO 2 quantifier alternation over words, Manuscript, Jan 2008.
C. Löding and W. Thomas. Alternating automata and logics over infinite words, Proc. IFIP TCS, Sendai J. van Leeuwen, O. Watanabe, M. Hagiya, P.D. Mosses, T. Ito, eds.), LNCS 1872, 2000, 521–535.
M. Mortimer. On language with two variables, Zeit. Math. Log. Grund. Math. 21, 1975, 135–140.
B.C. Moszkowski and Z. Manna. Reasoning in interval temporal logic, Proc. Logics of programs, Pittsburgh (E.M. Clarke and D. Kozen, eds.), LNCS 164, 1983, 371–382.
J.-E. Pin and P. Weil. Polynomial closure and unambiguous products, Theory Comput. Syst. 30, 1997, 383–422.
M.-P. Schützenberger. Sur le produit de concaténation non ambigu, Semigroup Forum 13, 1976, 47–75.
T. Schwentick, D. Thérien and H. Vollmer. Partially-ordered two-way automata: a new characterization of DA, Proc. DLT ’01, Vienna (W. Kuich, G. Rozenberg and A. Salomaa, eds.), LNCS 2295, 2002, 239–250.
S.S. Shah. FO 2 and related logics, Master’s thesis (TIFR, 2007).
I. Simon. Piecewise testable events, Proc. GI Conf. Autom. Theory and Formal Lang., Kaiserslautern (H. Barkhage, ed.), LNCS 33, 1975, 214–222.
L.J. Stockmeyer and A.R. Meyer. Word problems requiring exponential time, Proc. STOC, Austin 1973, 1–9.
P. Tesson and D. Thérien. Diamonds are forever: the variety DA, Semigroups, algorithms, automata and languages G.M.S. Gomes, P.V. Silva and J.-E. Pin, eds.), (World Scientific 2002) 475–500.
D. Thérien and T. Wilke. Over words, two variables are as powerful as one quantifier alternation: FO 2 = Σ2 ∩ Π2, Proc. STOC, Dallas, 1998, 41–47.
P. Weis and N. Immerman. Structure theorem and strict alternation hierarchy for FO 2 on words, Proc. CSL, Lausanne (J. Duparc and T. Henzinger, eds.), LNCS 4646, 2007, 343–357.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Lodaya, K., Pandya, P.K., Shah, S.S. (2008). Marking the chops: an unambiguous temporal logic. In: Ausiello, G., Karhumäki, J., Mauri, G., Ong, L. (eds) Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008. IFIP International Federation for Information Processing, vol 273. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09680-3_31
Download citation
DOI: https://doi.org/10.1007/978-0-387-09680-3_31
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09679-7
Online ISBN: 978-0-387-09680-3
eBook Packages: Computer ScienceComputer Science (R0)