A New Perspective on FO Model Checking of Dense Graph Classes (Q4635873): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5121279
 
description / endescription / en
 
scientific article; zbMATH DE number 7246557
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1446.68093 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/3383206 / rank
 
Normal rank
Property / published in
 
Property / published in: ACM Transactions on Computational Logic / rank
 
Normal rank
Property / publication date
 
11 September 2020
Timestamp+2020-09-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 September 2020 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7246557 / rank
 
Normal rank
Property / zbMATH Keywords
 
first-order logic
Property / zbMATH Keywords: first-order logic / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithmic metatheorems
Property / zbMATH Keywords: algorithmic metatheorems / rank
 
Normal rank
Property / zbMATH Keywords
 
bounded-degree graphs
Property / zbMATH Keywords: bounded-degree graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
fixed-parameter tractability
Property / zbMATH Keywords: fixed-parameter tractability / rank
 
Normal rank
Property / zbMATH Keywords
 
interpretations
Property / zbMATH Keywords: interpretations / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3040102297 / rank
 
Normal rank

Latest revision as of 10:19, 6 May 2024

scientific article; zbMATH DE number 7246557
Language Label Description Also known as
English
A New Perspective on FO Model Checking of Dense Graph Classes
scientific article; zbMATH DE number 7246557

    Statements

    A New Perspective on FO Model Checking of Dense Graph Classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2018
    0 references
    11 September 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    FO logic
    0 references
    logic interpretations
    0 references
    model checking
    0 references
    parameterized complexity
    0 references
    sparse graph classes
    0 references
    first-order logic
    0 references
    algorithmic metatheorems
    0 references
    bounded-degree graphs
    0 references
    fixed-parameter tractability
    0 references
    interpretations
    0 references
    0 references
    0 references
    0 references