Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Equational problems anddisunification
Journal of Symbolic Computation
Communications of the ACM
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
RISC-CLP(CF) Constraint Logic Programming over Complex Functions
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
Extending RISC-CLP (Real) to Handle Symbolic Functions
DISCO '93 Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems
A Higher-Order Logic Programming Language with Constraints
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Constraint Logic Programming with Hereditary Harrop formulas
Theory and Practice of Logic Programming
Providing declarative semantics for HH extended constraint logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
Combining the logic of hereditary Harrop formulas HH with a constraint system, a logic programming language is obtained that extends Horn clauses in two different directions, th us enhancing substantially the expressivity of Prolog. The implementation of this new language requires the ability to test the satisfiability of constraints built up by means of terms and predicates belonging to the domain of the chosen constraint system, a nd by the connectives and quantifiers usual in first-order logic. In this paper we present a constraint system called RH for a hybrid domain that mixes Herbrand terms and real numbers. It arises when joining the axiomatization of the arithmetic of real numbers and the axiomatization of the algebra of finite trees. We have defined an algorithm to solve certain constraints of this kind. The novelty relies on the combination of two different mechanisms, based on elimination of quantifiers, o ne used for solving unification and disunification problems, the other used to solve polynomials. This combination provides a procedure to solve RH-constraints in the context of HH with constraints.