PDL for structured data: a graph-calculus approach

DOI10.1093/JIGPAL/JZU011MaRDI QIDQ4644610zbMATH OpenOpenAlexWikidataFDO

Authors Paulo A. S. Veloso, Sheila R. M. Veloso, Mario Benevides

Publication date 8 January 2019

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

Full work available at URL https://doi.org/10.1093/jigpal/jzu011

zbMATH Keywords

concurrencygraph calculuspropositional dynamic logicrefutationstructured data

Mathematics Subject Classification ID

Data structures (68P05) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A graph calculus for predicate logic
• Graph grammars for querying graph-like data
• A logic of reachable patterns in linked data-structures
• Foundations of Software Science and Computation Structures
• Representing multi-scale Datalog+/- using hierarchical graphs
• Predicate abstraction for linked data structures
• A declarative approach to graph based modeling
• Path logics for querying graphs: combining expressiveness and efficiency
• OODA of graph and tree-structured data

Cited in

(9)

• Extending propositional dynamic logic for Petri nets
• Simple dynamic logic with parallel composition and applications to planning
• On a graph calculus for modalities
• The flower calculus
• scientific article; zbMATH DE number 4143953 (Why is no real title available?)
• On Diagrams and General Model Checkers
• Probabilistic results for a mobile service scenario
• Propositional dynamic logic with storing, recovering and parallel composition
• Specification and verification for semi-structured data

This page was built for publication: PDL for structured data: a graph-calculus approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644610)