ABSTRACT
A survey of effective characterizations of tree logics. If L is a logic, then an effective characterization for L is an algorithm, which inputs a tree automaton and replies if the recognized language can be defined by a formula in L. The logics L considered include path testable languages, frontier testable languages, fragments of Core XPath, and fragments of monadic second-order logic.
Supplemental Material
- Pablo Barceló and Leonid Libkin. Temporal logics over unranked trees. In LICS, pages 31--40, 2005. Google Scholar
Digital Library
- Michael Benedikt and Luc Segoufin. Regular tree languages definable in FO. In STACS, pages 327--339, 2005. A corrected version can be found on http://www-rocq.inria.fr/ segoufin/PAPIERS. Google Scholar
Digital Library
- Mikoaj Bojańczyk. Forest expressions. In CSL, pages 146--160, 2007. Google Scholar
Digital Library
- Mikolaj Bojańczyk. Two-way unary temporal logic over trees. In LICS, pages 121--130, 2007. Google Scholar
Digital Library
- Mikolaj Bojańczyk and Luc Segoufin. Tree languages definable with one quantifier alternation. Submitted.Google Scholar
- Mikolaj Bojańczyk, Luc Segoufin, and Howard Straubing. Piecewise testable tree languages. LICS, 2008.Google Scholar
Digital Library
- Mikolaj Bojańczyk and Igor Walukiewicz. Characterizing EF and EX tree logics. Theor. Comput. Sci., 358(2-3):255--272, 2006. Google Scholar
Digital Library
- Mikolaj Bojańczyk and Igor Walukiewicz. Forest algebras. In Automata and Logic: History and Perspectives, pages 107 -- 132. Amsterdam University Press, 2007.Google Scholar
- J. R. Büchi. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math., 6:66--92, 1960.Google Scholar
Cross Ref
- Bruno Courcelle. The monadic second-order logic of graphs X: Linear orderings. Theor. Comput. Sci., 160(1&2):87--143, 1996. Google Scholar
Digital Library
- C. C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the AMS, 98:21--52, 1961.Google Scholar
Cross Ref
- Zoltán Ésik and Szabocs Ivan. Some varieties of finite tree automata related to restricted temporal logics. Fundamenta Informaticae, 82(1--2), 2008. Google Scholar
Digital Library
- Haim Gaifman. On local and non-local properties. In Proceedings of the Herbrand Symposium, Logic Colloquium '81, 1982.Google Scholar
Cross Ref
- Georg Gottlob and Christoph Koch. Monadic queries over tree-structured data. In LICS, pages 189--202, 2002. Google Scholar
Digital Library
- Thilo Hafer and Wolfgang Thomas. Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In ICALP, pages 269--279, 1987. Google Scholar
Digital Library
- J. A. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, Univ. of California, Los Angeles, 1968.Google Scholar
- Leonid Libkin. Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3), 2006.Google Scholar
- Maarten Marx. Conditional XPath. ACM Trans. Database Syst., 30(4):929--959, 2005. Google Scholar
Digital Library
- Robert McNaughton and Seymour A. Papert. Counter-Free Automata (M.I.T. research monograph no. 65). The MIT Press, 1971. Google Scholar
Digital Library
- Jean-Éric Pin. Logic, semigroups and automata on words. Ann. Math. Artif. Intell., 16:343--384, 1996.Google Scholar
Cross Ref
- Jean-Éric Pin. Logic on words. In Current Trends in Theoretical Computer Science, pages 254--273. 2001. Google Scholar
Digital Library
- Andreas Potthoff. First-order logic on finite trees. In TAPSOFT, pages 125--139, 1995. Google Scholar
Digital Library
- Andreas Potthoff and Wolfgang Thomas. Regular tree languages without unary symbols are star-free. In FCT, pages 396--405, 1993. Google Scholar
Digital Library
- Mefodie Rata. A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic. Discrete Mathematics and Applications, 12(3):279--290, 2002.Google Scholar
- Marcel Paul Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8(2):190--194, 1965.Google Scholar
- Imre Simon. Piecewise testable events. In Automata Theory and Formal Languages, pages 214--222, 1975. Google Scholar
Digital Library
- P. Tesson and D. Th´erien. Diamonds are forever: the variety DA. In Semigroups, Algorithms, Automata and Languages, pages 475--500, 2002.Google Scholar
- Wolfgang Thomas. Classifying regular events in symbolic logic. J. Comput. Syst. Sci., 25(3):360--376, 1982.Google Scholar
- Wolfgang Thomas. Logical aspects in the study of tree languages. In CAAP, pages 31--50, 1984. Google Scholar
Digital Library
- Wolfgang Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Language Theory, volume III, pages 389--455. Springer, 1997. Google Scholar
Digital Library
- B. A. Trakthenbrot. Finite automata and the logic of monadic second order predicates(russian). Doklady Academii Nauk SSSR, 140:326--329, 1961.Google Scholar
- Thomas Wilke. An algebraic characterization of frontier testable tree languages. Theor. Comput. Sci., 154(1):85--106, 1996. Google Scholar
Digital Library
- Thomas Wilke. Classifying discrete temporal properties. In STACS, pages 32--46, 1999. Google Scholar
Digital Library
- Zhilin Wu. A note on the characterization of TL{EF}. Inf. Process. Lett., 102(2-3):48--54, 2007. Google Scholar
Digital Library
Index Terms
Effective characterizations of tree logics
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Characterization of strongly equivalent logic programs in intermediate logics
The non-classical, nonmonotonic inference relation associated with the answer set semantics for logic programs gives rise to a relationship of strong equivalence between logical programs that can be verified in 3-valued Gödel logic, G3, the strongest ...
Three-valued Logics in Modal Logic
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-...








Comments