Reachability logic: an efficient fragment of transitive closure logic

DOI10.1093/jigpal/8.3.325zbMath0948.03022OpenAlexW2069044506MaRDI QIDQ4487265

Natasha Alechina, Neil Immerman

Publication date: 14 November 2000

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9d7db8249836e0c61945b056873ab37edd8e0956

zbMATH Keywords

reachability logicPDL\(\text{CTL}^\star\)complexity of model checkinggraph query languages

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Comparing the succinctness of monadic query languages over finite trees ⋮ Querying linguistic trees ⋮ Foundations of RDF Databases ⋮ PDL for ordered trees ⋮ Quantified computation tree logic