scientific article; zbMATH DE number 4053008
From MaRDI portal
Publication:3789061
Recommendations
- A new approach to general E-unification based on conditional rewriting systems
- A completion-based method for mixed universal and rigid \(E\)-unification
- Completeness of E-unification with eager variable elimination
- scientific article; zbMATH DE number 3960989
- Publication:4503959
- Tight, consistent, and computable completions for unrestricted logic programs
- Efficient algorithms for bounded rigid E-unification
- A combinatory logic approach to higher-order E-unification
- Completeness in PVS of a nominal unification algorithm
- A note on semantics of logic programs with equality based on complete sets of E-unifiers
Cited in
(16)- Conditional narrowing modulo a set of equations
- Completeness results for basic narrowing
- Incremental constraint satisfaction for equational logic programming
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- Horn equational theories and paramodulation
- Logicality of conditional rewrite systems
- Kernel-LEAF: A logic plus functional language
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- scientific article; zbMATH DE number 1222433 (Why is no real title available?)
- scientific article; zbMATH DE number 2044516 (Why is no real title available?)
- Completion-time optimization of rewrite-time goal solving
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Completeness of combinations of conditional constructor systems
- A compositional semantic basis for the analysis of equational Horn programs
- Explanatory denotational semantics for complex event patterns
- Conditional equational theories and complete sets of transformations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789061)
