A CLP View of Logic Programming
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
A CLP View of Logic Programming
|
| Id. |
41843762 |
| Idioma |
inglés
|
| Titulo |
A CLP View of Logic Programming |
| Autor(es) |
Michael J. Maher
|
| Localización |
http://citeseer.ist.psu.edu/408366.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
. We address the problem of determining those constraint domains
A for which the traditional logic programming semantics and the constraint
logic programming semantics CLP (A) coincide. This reduces to a study of
non-standard models of Clark's axioms and the notion of solution compactness
introduced in the CLP scheme. The results of this study include the
proof of the existence of a free product in the class of algebras defined by
Clark's axioms, a characterization of when Clark's axioms form a model complete
theory, and a limited characterization of those models of Clark's axioms
which form solution compact constraint domains.
1 Introduction
Appropriate semantics for definite logic programs are now largely agreed upon [17].
They involve a completed program, SLD-resolution, a one-step consequence function,
a least Herbrand model and numerous relationships between them: soundness and
completeness of SLD-refutations, soundness and completeness of the negation-asfailure
rule, .....
|
| Tipo |
ps
|
| Palabras clave |
Michael J. Maher A CLP View of Logic Programming
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.math.luc.edu/~mjm/pubs/free.ps
[References] oai:CiteSeerPSU:173753
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
