Thomas Eiter, Georg Gottlob, Yuri Gurevich  Home/Search
Context
Related
| microsoft.com/~gurevich/Opera...134.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: microsoft.com/~gurevi...annotated (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Existential second-order logic (ESO) and monadic second-order logic (MSO) have attracted much interest in logic and computer science. ESO is a much moreexpressive logic over word structures than MSO. However, little was known about the relationship between MSO and syntactic fragments of ESO.Weshed light on this issue by completely characterizing this relationship for the prefix classes of ESO over strings, (i.e., finite word structures). Moreover, we determine the complexity of model checking... (Update)
Similar documents (at the sentence level):
23.2%: Existential Second-Order Logic over Strings - Eiter, Gottlob, Gurevich (1998) (Correct)
Active bibliography (related documents): More All
3.3: Existential Second-Order Logic over Strings (Extended.. - Eiter, Gottlob, Gurevich (Correct)
0.4: Descriptive Complexity, Lower Bounds and Linear Time - Schwentick (1998) (Correct)
0.4: Second-Order Logic over Strings: Regular and Non-Regular.. - Eiter, Gottlob.. (2001) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
T. Eiter, G. Gottlob, and Y. Gurevich. Existential Second-Order Logic over Strings. TR 9702, Institut fur Informatik, Univ. Gießen, Germany, December 1997. (Available at URL http://www.dbai.tuwien.ac.at/ftp/papers/eiter/ ifigrr-9702.ps.gz) http://citeseer.ist.psu.edu/article/eiter97existential.html More
@misc{ eiter97existential,
author = "T. Eiter and G. Gottlob and Y. Gurevich",
title = "Existential Second-Order Logic over Strings",
text = "T. Eiter, G. Gottlob, and Y. Gurevich. Existential Second-Order Logic over
Strings. TR 9702, Institut fur Informatik, Univ. Gießen, Germany, December
1997. (Available at URL http://www.dbai.tuwien.ac.at/ftp/papers/eiter/ ifigrr-9702.ps.gz)",
year = "1997",
url = "citeseer.ist.psu.edu/article/eiter97existential.html" }
Citations (may not include all citations):775 Foundations of Databases (context) - Abiteboul, Hull et al. - 1995
379 Complexity of Relational Query Languages (context) - Vardi - 1982
374 Automata on Infinite Objects (context) - Thomas - 1990
294 Finite Model Theory (context) - Ebbinghaus, Flum - 1995
245 Relational Queries Computable in Polynomial Time - Immerman - 1986
210 Generalized First-Order Spectra and Polynomial-Time Recogniz.. (context) - Fagin - 1974
176 a Decision Method in Restricted Second-Order Arithmetic (context) - Buchi - 1960
149 Logic and the Challenge of Computer Science (context) - Gurevich - 1988
131 and Logic (context) - Thomas, Automata - 1996
127 Counter-FreeAutomata (context) - McNaughton, Papert - 1971
100 Weak Second-Order Arithmetic and Finite Automata (context) - Buchi - 1960
76 Mona: Monadic Second-order Logic in Practice - Henriksen, Jensen et al. - 1996
70 The Classical Decision Problem (context) - Borger, Gradel et al. - 1997
69 The Polynomial-Time Hierarchy (context) - Stockmeyer - 1977
63 Varieties of Formal Languages (context) - Pin - 1986
57 and Circuit Complexity (context) - Straubing, Formal - 1994
46 Finite-Model Theory---A Personal Perspective - Fagin - 1993
36 Laws and Decision Problems for Fragments of Second-Order Log.. (context) - Kolaitis, Vardi - 1990
30 Fido: The LogicAutomaton Connection in Practice (context) - Klarlund - 1998
29 Hardware verification using monadic second-order logic - Basin, Klarlund - 1995
26 Monadic NP and Built-in Relations of Moderate Degree (context) - Schwentick - 1995
19 Regular Languages Defined with Generalized Quantifiers (context) - Straubing, Th'erien et al. - 1995
15 Finite Automata and the Logic of Monadic Predicates (context) - Trakhtenbrot - 1961
11 Universal quantifiers and time complexity of random access m.. (context) - Grandjean - 1985
10 Logics for context-free languages - Lautemann, Schwentick et al. - 1994
9 The quantifier structure of sentences that characterize nond.. (context) - Lynch - 1992
8 Existential Second-Order Logic over Strings - Eiter, Gottlob et al. - 1997
8 Semigroups and Automata on Words (context) - Pin - 1996
7 An Existential Fragment of Second Order Logic - Rosen - 1996
7 Second Order and Inductive Definability on Finite Structures (context) - de Rougemont - 1987
6 The ExpressivePower of Second-Order Horn Logic (context) - Gradel - 1991
6 Bulletin of the EATCS (context) - Pin, Words - 1994
6 Capturing Complexity Classes with Fragments of Second Order .. (context) - Gradel - 1992
5 A Conjunctive Logical Characterization of Nondeterministic L.. (context) - Olive - 1998
4 Descriptive Complexity Theory (context) - Immerman
4 Fragments of binary NP - Durand, Lautemann et al.
3 Law for the Existential Second-Orde Minimal Godel Sentences .. (context) - Pacholski, Szwast
3 the Expressiveness of Frame SatisfiabilityandFragments of Se.. (context) - Eiter, Gottlob
2 Generalized Monadic Spectra (context) - Fagin - 1975
Documents on the same site (http://research.microsoft.com/~gurevich/annotated.html): More
UsingAbstra Star Ma hinesa Microsoft: ACa Study.. - Yuri Gurevich Wolfram (Correct)
Spectra of Monadic Second-Order Formulas with One Unary Function - Gurevich, Shelah (2003) (Correct)
The Results - One Of The (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC