From pattern invocation networks to rule preconditions

DOI10.1007/978-3-030-23611-3_12MaRDI QIDQ2292980zbMATH OpenOpenAlexFDO

Authors Nils Weidmann, A. Anjorin, Florian Stolte, Florian Kraus

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23611-3_12

zbMATH Keywords

graph constraintsincremental pattern matchingpattern invocation networks

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Transformation systems with incremental negative application conditions
• Graph transformation with incremental updates
• Host-graph-sensitive RETE nets for incremental graph pattern matching
• Pattern-Based Graph Abstraction

Cited in

(2)

• Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation

This page was built for publication: From pattern invocation networks to rule preconditions

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