El Lenguaje CLP(H/E): Una Aproximación basada en Restricciones a la Integración de la Programación Lógica y Funcional
One of the most challenging problems in Computational Logic is the integration of two of the most popular families of declarative languages: logical languages and equational languages. A relevant approach to address this problem is based on considering an equational logic program (P, E) as a positiv...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | text (thesis) |
| Lenguaje: | spa |
| Publicado: |
Universitat Politècnica de València (España)
1991
|
| Materias: | |
| Acceso en línea: | https://dialnet.unirioja.es/servlet/oaites?codigo=24220 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | One of the most challenging problems in Computational Logic is the integration of two of the most popular families of declarative languages: logical languages and equational languages. A relevant approach to address this problem is based on considering an equational logic program (P, E) as a positive logic program P that is augmented by a Horn equational theory E. The advantage of this approach is that, since the equational theory E is also a set of defined Horn clauses, the program (P, E) fulfills the well-known property of model intersection, and thus generates an smallest equational congruence on the Herbrand universe associated with the program. On the interpretation domain, that is, the quotient of the Herbrand universe module this congruence, the equational logic program admits a minimal model semantics and a fixpoint semantics as well. Thus, the main semantic properties of traditional logic programs are preserved in the more general, integrated, logic-equational programming paradigm. Specifically, it maintains the existence of a canonical computation domain on which you can define several formal semantics that are not only simple and elegant but also do coincide.
On the other hand, the pure logic programming paradigm has recently been generalized to a broader context of Constraint Logic Programming (CLP). CLP is a general framework, a generic scheme for the introduction of constraints in logic programming. Each instance CLP(C) of the scheme is a programming language that is obtained by specifying a computing structure C. The CLP scheme ensures that the semantic properties of conventional logic programs are inherited by any language that can be formalized as an instance of the schema. The main argument discussed in this thesis is that, in the context of CLP, it is possible to formalize the desired integration between logic programming and equational programming by a suitable treatment of the equality relation. The thesis defines an instance of the CLP scheme that is specialized in solving equations in an equational Horn theory E. The computer structure is given just by the smallest partition H/E induced by E on the Herbrand universe H for the program. The equality = is the only predicate symbol for constraints, that is interpreted as semantic equality in this domain. The proposed language, CLP (H/E), combines the logic programming paradigm with (conditional) equations and Constraint programming. The advantage of this new integration approach is that, since the language is defined as an instance of the CLP(C) scheme, all the semantic properties mentioned above are automatically inherited within it. Furthermore, an efficient procedure for solving constraints in the structure H/E can be easily incorporated into a general CLP system and cooperate with other constraint solving algorithms. |
|---|