On the Expressive Power of Logics on Finite Models (2003)

Cached

Download Links

by Phokion G. Kolaitis
Citations:2 - 0 self

Documents Related by Co-Citation

1526 V.: Foundations of Databases – S Abiteboul, R Hull, Vianu - 1995
18 Reasoning on Regular Path Queries – D. Calvanese, G. De Giacomo, M. Lenzerini, M. Y. Vardi - 2003
14 Reachability and Connectivity Queries in Constraint Databases – Michael Benedikt , Martin Grohe , Leonid Libkin , Luc Segoufin
23 Rijke. Model checking hybrid logics, with an application to semistructured data – M Franceschet, M de
23 Second-order and inductive definability on finite structures. Zeitschr. f. math. Logik und Grundlagen d – Michel de Rougemont - 1987
21 MODEL THEORY OF MODAL LOGIC – Valentin Goranko, Martin Otto
3 Computation tree logic and path quantifiers in the monadic theory of the binary tree – T Hafer, W Thomas - 1987
4 Branching-time logics repeatedly referring to states – V Weber
3 Model theoretic methods for fragments of FO and special classes of (finite) structures – M Otto - 2011
4 Relative expressiveness of nested regular expressions – P Barceló, J Pérez, J L Reutter - 2012
1 Using modal logics to express and check global graph properties – M R F Benevides, L M Schechter
1 Bounded semantics of CTL and SAT-based verification – W Zhang
22 Definable Relations and First-Order Query Languages over Strings – Michael Benedikt, Leonid Libkin, Thomas Schwentick, Luc Segoufin
17 Counting on CTL*: On the Expressive Power of Monadic Path Logic – Faron Moller, Alexander Rabinovich - 2003
9 First-order definable languages – Volker Diekert, Paul Gastin - 2008
8 Automata vs. logics on data words – Michael Benedikt, Clemens Ley - 2010
12 Two-variable logic on data words – M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin
6 Counting Beyond a Yottabyte, or how SPARQL 1.1 Property Paths will Prevent Adoption of the Standard – Marcelo Arenas, Sebastián Conca, Jorge Pérez
4 The complexity of evaluating path expressions in SPARQL – K Losemann, W Martens - 2012