On completeness of narrowing strategies

DOI10.1016/0304-3975(90)90032-DzbMath0698.68027MaRDI QIDQ912605

Rachid Echahed

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

reductionalgebraic specificationscompleteness of narrowing strategiesE-unifiers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Categories of algebras (08C05)

Related Items (2)

Completeness results for basic narrowing ⋮ On the connection between narrowing and proof by consistency

Cites Work

• Conditional rewrite rules
• Basic narrowing revisited
• The relation between logic and functional languages: a survey
• Contributions to the Theory of Logic Programming
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Equality, types, modules, and (why not?) generics for logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On completeness of narrowing strategies