A note on semantics of logic programs with equality based on complete sets of E-unifiers
- 30 September 1996
- journal article
- research article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 28 (3) , 207-216
- https://doi.org/10.1016/0743-1066(96)00049-0
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the completeness of SLDENF-resolutionJournal of Automated Reasoning, 1996
- The integration of functions into logic programming: From theory to practiceThe Journal of Logic Programming, 1994
- SLDNF-resolution with equalityJournal of Automated Reasoning, 1992
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Extending SLD resolution to equational horn clauses using E-unificationThe Journal of Logic Programming, 1989
- Conditional rewrite rulesTheoretical Computer Science, 1984
- A theory of complete logic programs with equalityThe Journal of Logic Programming, 1984
- ALGEBRAIC SYSTEMSBulletin of the London Mathematical Society, 1974
- Subdirect unions in universal algebraBulletin of the American Mathematical Society, 1944