Incremental constraint satisfaction for equational logic programming
From MaRDI portal
Publication:1367535
DOI10.1016/0304-3975(94)00224-7zbMath0884.68032OpenAlexW1985929555WikidataQ57978312 ScholiaQ57978312MaRDI QIDQ1367535
María Alpuente, Moreno Falaschi, Giorgio Levi
Publication date: 29 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00224-7
Related Items (4)
Modular Termination of Basic Narrowing ⋮ A modular order-sorted equational generalization algorithm ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Termination of narrowing revisited
Uses Software
Cites Work
- A rationale for conditional equational programming
- Conditional equational theories and complete sets of transformations
- Conditional rewrite rules
- Narrowing vs. SLD-resolution
- Conditional rewrite rules: Confluence and termination
- Unification theory
- Completeness results for basic narrowing
- Foundations of equational logic programming
- Horn equational theories and paramodulation
- Basic narrowing revisited
- Kernel-LEAF: A logic plus functional language
- Login: a logic programming language with built-in inheritance
- The relation between logic and functional languages: a survey
- Extended unification algorithms for the integration of functional programming into logic programming
- Logic programming with equations
- Extending SLD resolution to equational horn clauses using E-unification
- Logic programming with functions and predicates: The language Babel
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Incremental constraint satisfaction for equational logic programming
