Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Descriptive characterizations of computational complexity
Journal of Computer and System Sciences
Some computational aspects of circumscription
Journal of the ACM (JACM)
0-1 laws and decision problems for fragments of second-order logic
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
The expressive power of second order Horn logic
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Theoretical Computer Science - Special issue on structure in complexity theory
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
The quantifier structure of sentences that characterize nondeterministic time complexity
Computational Complexity
Regular languages defined with generalized quantifiers
Information and Computation
Approximation properties of NP minimization classes
Journal of Computer and System Sciences
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
Languages, automata, and logic
Handbook of formal languages, vol. 3
Automata, Languages, and Machines
Automata, Languages, and Machines
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Varieties Of Formal Languages
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Mona: Monadic Second-Order Logic in Practice
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Hardware Verification using Monadic Second-Order Logic
Proceedings of the 7th International Conference on Computer Aided Verification
Logics For Context-Free Languages
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
A Conjunctive Logical Characterization of Nondeterministic Linear Time
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
Second-Order Logic over Strings: Regular and Non-regular Fragments
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Existential second-order logic over graphs: Charting the tractability frontier
Journal of the ACM (JACM)
Yuri, logic, and computer science
Fields of logic and computation
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
| Hi-index | 0.00 |
Existential second-order logic (ESO) and monadic second-order logic(MSO) have attracted much interest in logic and computer science. ESO is a much expressive logic over successor structures than MSO. However, little was known about the relationship between MSOand syntatic fragments of ESO. We shed light on this issue by completely characterizing this relationship for the prefix classes of ESO over strings, (i.e., finite successor structures). Moreover, we determine the complexity of model checking over strings, for all ESO-prefix classes. Let ESO( Q ) denote the prefix class containing all sentences of the shape ∃RQ4 , where R is a list of predicate variables, Q is a first-order predicate qualifier from the prefix set Q and 4 is quantifier-free. We show that ESO( ∃*∀∃* ) and ESO( ∃*∀∀ ) are the maximal standard ESO-prefix classes contained in MSO, thus expressing only regular languages. We further prove the following dichotomy theorem: An ESO prefix-class either expresses only regular languages (and is thus in MSO), or it expresses some NP-complete languages. We also give a precise characterization of those ESO-prefix classes that are equivalent to MSO over strings, and of the ESO-prefix classes which are closed under complementation on strings.