Detecting Unsolvable Queries for Definite Logic Programs
|
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
|
|
|
Detecting Unsolvable Queries for Definite Logic Programs
|
| Id. |
46254222 |
| Idioma |
inglés
|
| Titulo |
Detecting Unsolvable Queries for Definite Logic Programs |
| Autor(es) |
Maurice Bruynooghe
Henk Vandecasteele
D. Andre De Waal
Marc Denecker
Marc
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.5390
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
. In solving a query, the SLD proof procedure for definite programs sometimes searches an infinite space for a non existing solution. For example, querying a planner for an unreachable goal state. Such programs motivate the development of methods to prove the absence of a solution. Considering the definite program and the query / Q as clauses of a first order theory, one can apply model generators which search for a finite interpretation in which the program clauses as well as the clause false / Q are true. This paper develops a new approach which exploits the fact that all clauses are definite. It is based on a goal directed abductive search in the space of finite pre-interpretations for a pre-interpretation such that Q is false in the least model of the program based on it. Several methods for efficiently searching the space of pre-interpretations are presented. Experimental results confirm that our approach find solutions with less search than with the use of a first order model generator. Keywords: Logic Programming, Termination, Pre-interpretation, Abduction, Tabulation, Constraint Logic Programming. 1
|
| Tipo |
application/postscript
|
| Palabras clave |
Logic Programming
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Formatos |
application/postscript
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.cs.kuleuven.ac.be/~dtai/publications/files/19892.ps.gz
[References] 10.1.1.13.7065
[References] 10.1.1.48.4048
[References] 10.1.1.54.5318
[References] 10.1.1.49.5297
[References] 10.1.1.21.6503
[References] 10.1.1.17.4575
[References] 10.1.1.47.3888
[References] 10.1.1.60.886
[References] 10.1.1.51.1576
[References] 10.1.1.42.5531
[References] 10.1.1.34.4119
[References] 10.1.1.54.6161
[References] 10.1.1.21.6084
[References] 10.1.1.63.2779
[References] 10.1.1.42.5531
[References] 10.1.1.133.6116
[References] 10.1.1.109.7687
[References] 10.1.1.10.3438
[References] 10.1.1.2.8459
[References] 10.1.1.5.7509
[References] 10.1.1.130.4677
|
| Fecha de contribución |
23-jul-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
