Logic programming as hypergraph rewriting
From MaRDI portal
Recommendations
- A hypergraph rewriting language and its semantics
- scientific article; zbMATH DE number 638303
- scientific article; zbMATH DE number 3988745
- scientific article; zbMATH DE number 1696789
- Graph grammars and logic programming
- scientific article; zbMATH DE number 65531
- scientific article; zbMATH DE number 4018389
- Parametrized logic programming
Cited in
(14)- Context-free hypergraph grammars have the same term-generating power as attribute grammars
- A kernel language for programmed rewriting of (hyper)graphs
- Mapping Fusion and Synchronized Hyperedge Replacement into logic programming
- Relativized hyperequivalence of logic programs for modular programming
- scientific article; zbMATH DE number 3978424 (Why is no real title available?)
- Graph grammars and logic programming
- Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
- scientific article; zbMATH DE number 919850 (Why is no real title available?)
- Decidability of safety in graph-based models for access control
- Logic based structure rewriting systems
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- Graph rewriting for a partial ordering semantics of concurrent constraints programming
- Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programming
This page was built for publication: Logic programming as hypergraph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2736348)
