Incremental Constraint Satisfaction for Equational Logic Programming

@article{Alpuente1995IncrementalCS,
  title={Incremental Constraint Satisfaction for Equational Logic Programming},
  author={Mar{\'i}a Alpuente and Moreno Falaschi and Giorgio Levi},
  journal={Theor. Comput. Sci.},
  year={1995},
  volume={142},
  pages={27-57}
}
In this paper we are concerned with an instance of the Constraint Logic Programming (CLP) scheme specialized in solving equations with respect to a Horn equational theory 8. The intended structure S/b is given by the finest partition induced by d on the Herbrand universe S over a finite one sorted alphabet. This work deals with the description of an incremental constraint solver as the kernel of an operational semantics for the language CLP(.%/b). The primary issues are: how to verify the… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 44 references

Completeness results for basic narrowing

Applicable Algebra in Engineering, Communication and Computing • 1994

An equational constraint logic approach to conceptual modelling

M. Alpuente, M. J. Ramirez
eds. Proe. 3rd Internat. Co& on Database and Expert Systems Applications DEXA • 1992

Rodriguez-Artalejo, Logic programming with functions and predicates: the language Babel

M.J.J. Moreno
J. Logic Programming • 1992

Extending SLDresolution to equational Horn clauses using Eunification

S. Raatz
Proc . 8 th Internat . Conf on Logic Programming • 1991

Similar Papers

Loading similar papers…