Expressiveness and complexity of graph logic
type: Item
instance of: scholarly article
title: Expressiveness and complexity of graph logic
zbMATH Open document ID: 1114.03028
author: Anuj Dawar
author: Philippa Gardner
author: G. Ghelli
published in: Information and Computation
publication date: 2007-03-12T00:00:00Z
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5133055
zbMATH Keywords: spatial logics
zbMATH Keywords: graphs
zbMATH Keywords: complexity
Wikidata QID: Q58215601
MaRDI profile type: Publication
full work available at URL: j.ic.2006.10.006
OpenAlex ID: W2029632316
cites work: Q4673420
cites work: Weak Second‐Order Arithmetic and Finite Automata
cites work: Q4474211
cites work: Deciding validity in a spatial logic for trees
cites work: Q4737192
cites work: TQL: a query language for semistructured data based on the ambient logic
cites work: Anytime, anywhere
cites work: Model checking mobile ambients
cites work: Foundations of Software Science and Computation Structures
cites work: A logic you can count on
cites work: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4255575
cites work: Q4058132
cites work: The directed subgraph homeomorphism problem
cites work: Adjuncts elimination in the static ambient logic
cites work: Q5641083
cites work: Q4783297
cites work: Q4531380
cites work: Q3221403
cites work: Alternating finite automata and star-free languages
cites work: The polynomial-time hierarchy
cites work: A note on model checking the modal \(\nu\)-calculus
DOI: 10.1016/J.IC.2006.10.006
description: scientific article; zbMATH DE number 5133055