The complexity of first-order and monadic second-order logic revisited

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 215-224

  Frick, Markus ^a   Grohe, Martin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZED COMPLEXITY THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

FORMAL LOGIC;

EID: 0036044725     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2002.1029830     Document Type: Conference Paper

References (17)

1. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs
2. Weak second-order arithmetic and finite automata
3. Graph rewriting: An algebraic and logic approach
4. Fixed-parameter tractability and completeness I: Basic results
5. Fixed-parameter tractability and completeness II: On completeness for W[1]
6. Deciding first-order properties of locally tree-decomposable structures
7. Model-theoretic methods in the study of elementary logic
8. Logics with counting and local properties
9. Finite state concurrent programs satisfy their linear specification
10. Linear time computable problems and first-order descriptions
11. Word problems requiring exponential time
12. The complexity of relational query languages