A strict constrained superposition calculus for graphs

DOI10.1007/978-3-031-30829-1_7OpenAlexW4323273902MaRDI QIDQ6091185

Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier, Rachid Echahed

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-30829-1_7

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Verifying graph transformation systems with description logics
• The PBPO graph transformation approach
• An automated deductive verification framework for circuit-building quantum programs
• Faster, higher, stronger: E 2.3
• Fundamentals of algebraic graph transformation
• Confluence of Graph Rewriting with Interfaces
• Tutorial: Graphical Calculus for Quantum Circuits
• Quantomatic: A Proof Assistant for Diagrammatic Reasoning
• Inductively Sequential Term-Graph Rewrite Systems
• Correctness of high-level transformation systems relative to nested conditions
• A term-graph clausal logic: completeness and incompleteness results ★
• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Handbook of Graph Grammars and Computing by Graph Transformation
• A Hoare Calculus for Graph Programs
• Handbook of Graph Grammars and Computing by Graph Transformation
• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
• Foundations of Software Science and Computation Structures

This page was built for publication: A strict constrained superposition calculus for graphs