Completeness results for basic narrowing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4164127 (Why is no real title available?)
- scientific article; zbMATH DE number 4041327 (Why is no real title available?)
- scientific article; zbMATH DE number 4053008 (Why is no real title available?)
- scientific article; zbMATH DE number 4092758 (Why is no real title available?)
- scientific article; zbMATH DE number 4112560 (Why is no real title available?)
- scientific article; zbMATH DE number 177826 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- A rationale for conditional equational programming
- An Efficient Unification Algorithm
- Basic narrowing revisited
- Conditional rewrite rules
- Conditional rewrite rules: Confluence and termination
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Foundations of equational logic programming
- Kernel-LEAF: A logic plus functional language
- Modular properties of conditional term rewriting systems
- Narrowing vs. SLD-resolution
- On completeness of narrowing strategies
- Proving termination with multiset orderings
- Simplifying conditional term rewriting systems: Unification, termination and confluence
Cited in
(38)- A distribution semantics for probabilistic term rewriting
- Incremental constraint satisfaction for equational logic programming
- Conditional narrowing modulo a set of equations
- Inverse Unfold Problem and Its Heuristic Solving
- Local confluence of conditional and generalized term rewriting systems
- Proving weak properties of rewriting
- Termination of narrowing via termination of rewriting
- Termination of narrowing revisited
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- Determinization of conditional term rewriting systems
- Logicality of conditional rewrite systems
- scientific article; zbMATH DE number 4053009 (Why is no real title available?)
- Implementing conditional term rewriting by graph rewriting
- Reviving basic narrowing modulo
- Higher order unification via explicit substitutions
- Sentence-Normalized Conditional Narrowing Modulo in Rewriting Logic and Maude
- A new generic scheme for functional logic programming with constraints
- Strategies in conditional narrowing modulo SMT plus axioms
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- Modular Termination of Basic Narrowing
- Narrowing trees for syntactically deterministic conditional term rewriting systems
- A compact fixpoint semantics for term rewriting systems
- scientific article; zbMATH DE number 1418369 (Why is no real title available?)
- Proving confluence in the confluence framework with confident
- Symbolic analysis of Maude theories with Narval
- Basic narrowing revisited
- On completeness of narrowing strategies
- Reversible computation in term rewriting
- Shallow confluence of conditional term rewriting systems
- Induction for termination with local strategies
- Outermost ground termination
- Complete symbolic reachability analysis using back-and-forth narrowing
- Level-confluence of conditional rewrite systems with extra variables in right-hand sides
- Computational origami construction as constraint solving and rewriting
- scientific article; zbMATH DE number 4041327 (Why is no real title available?)
- scientific article; zbMATH DE number 1507237 (Why is no real title available?)
- A compositional semantic basis for the analysis of equational Horn programs
- Lazy narrowing: strong completeness and eager variable elimination
This page was built for publication: Completeness results for basic narrowing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328184)
