A strict constrained superposition calculus for graphs
From MaRDI portal
(Redirected from Publication:6091185)
Cites work
- A Hoare calculus for graph programs
- A term-graph clausal logic: completeness and incompleteness results ★
- An automated deductive verification framework for circuit-building quantum programs
- Confluence of graph rewriting with interfaces
- Correctness of high-level transformation systems relative to nested conditions
- Faster, higher, stronger: E 2.3
- Foundations of Software Science and Computation Structures
- Fundamentals of algebraic graph transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 7449972 (Why is no real title available?)
- scientific article; zbMATH DE number 46359 (Why is no real title available?)
- scientific article; zbMATH DE number 1303343 (Why is no real title available?)
- scientific article; zbMATH DE number 1765682 (Why is no real title available?)
- scientific article; zbMATH DE number 1437942 (Why is no real title available?)
- scientific article; zbMATH DE number 7559395 (Why is no real title available?)
- Inductively Sequential Term-Graph Rewrite Systems
- Quantomatic: a proof assistant for diagrammatic reasoning
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- String diagram rewrite theory. I: Rewriting with Frobenius structure
- The PBPO graph transformation approach
- Tutorial: Graphical Calculus for Quantum Circuits
- Verifying graph transformation systems with description logics
This page was built for publication: A strict constrained superposition calculus for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091185)