×

zbMATH — the first resource for mathematics

The semantics of equational logic programming as an instance of CLP. (English) Zbl 0832.68013
Apt, K. R. (ed.) et al., Logic programming languages. Constraints, functions, and objects. London: MIT Press. 49-81 (1993).
Summary: We show how functional (i.e. equational) and logic programming can be integrated within the Constraint Logic Programming paradigm. The resulting language \(\text{CLP} ({\mathcal H}/{\mathcal E})\) is specialized in solving equations with respect to a Horn equational theory \(\mathcal E\). \(\text{CLP} ({\mathcal H} /{\mathcal E})\) inherits all the semantic properties of the CLP scheme, including a new semantics which models answer constraints. The operational semantics of \(\text{CLP} ({\mathcal H}/{\mathcal E})\) is defined by a constraint solver based on conditional narrowing. Several strategies to obtain an incremental constraint solver are considered.
For the entire collection see [Zbl 0831.68011].

MSC:
68N17 Logic programming
68Q55 Semantics in the theory of computing
Software:
BABEL
PDF BibTeX XML Cite