Lazy narrowing: Strong completeness and eager variable elimination
- 31 December 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 167 (1-2) , 95-130
- https://doi.org/10.1016/0304-3975(96)00071-0
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Culture, Sports, Science and Technology
This publication has 9 references indexed in Scilit:
- Basic ParamodulationInformation and Computation, 1995
- The integration of functions into logic programming: From theory to practiceThe Journal of Logic Programming, 1994
- Completeness results for basic narrowingApplicable Algebra in Engineering, Communication and Computing, 1994
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Enumerating outer narrowing derivationsfor constructor-based term rewriting systemsJournal of Symbolic Computation, 1989
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965