Analyses of unsatisfiability for equational logic programming
- 31 March 1995
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 22 (3) , 223-254
- https://doi.org/10.1016/0743-1066(94)00024-z
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Incremental constraint satisfaction for equational logic programmingTheoretical Computer Science, 1995
- Completeness results for basic narrowingApplicable Algebra in Engineering, Communication and Computing, 1994
- Narrowing based procedures for equational disunificationApplicable Algebra in Engineering, Communication and Computing, 1992
- Unification theoryJournal of Symbolic Computation, 1989
- Basic narrowing revisitedJournal of Symbolic Computation, 1989
- Extending SLD resolution to equational horn clauses using E-unificationThe Journal of Logic Programming, 1989
- Extended unification algorithms for the integration of functional programming into logic programmingThe Journal of Logic Programming, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- Unification in conditional-equational theoriesPublished by Springer Nature ,1985