The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59259582, #quickstatements; #temporary_batch_1705018876894
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MONA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Lixto / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-15025-8_13 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1570464944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4799290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Second‐Order Arithmetic and Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for second-order logic over finite structures, and classification of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential second-order logic over strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Problems of Finite Automata Design and Related Arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog and the expressive power of languages for Web information extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existential second-order logic over graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic datalog over finite structures of bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantifiers and time complexity of random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational aspects of circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: A descriptive characterisation of even linear languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive characterizations of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantifier structure of sentences that characterize nondeterministic time complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4318987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic, semigroups and automata on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages defined with generalized quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the presence of disjoint subgraphs of a specified type / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:26, 3 July 2024

scientific article
Language Label Description Also known as
English
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
scientific article

    Statements

    The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2010
    0 references
    finite model theory
    0 references
    Gurevich's classifiability theorem
    0 references
    model checking
    0 references
    monadic second-order logic
    0 references
    regular languages
    0 references
    second-order logic
    0 references
    survey paper
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references