Two results for prioritized 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
|
|
|
Two results for prioritized logic programming
|
| Id. |
42355150 |
| Idioma |
eng
|
| Titulo |
Two results for prioritized logic programming |
| Autor(es) |
Zhang, Yan, 1962-
|
| Localización |
http://handle.uws.edu.au:8081/1959.7/10021
http://ezproxy.uws.edu.au/login?url=http://dx.doi.org/10.1017/S1471068402001552
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Prioritized default reasoning has illustrated its rich expressiveness and flexibility in knowledge representation and reasoning. However, many important aspects of prioritized default reasoning have yet to be thoroughly explored. In this paper, we investigate two properties of prioritized logic programs in the context of answer set semantics. Specifically, we reveal a close relationship between mutual defeasibility and uniqueness of the answer set for a prioritized logic program. We then explore how the splitting technique for extended logic programs can be extended to prioritized logic programs. We prove splitting theorems that can be used to simplify the evaluation of a prioritized logic program under certain conditions.
|
| Tipo |
20
|
| Palabras clave |
Logic programming
|
| Tipo de recurso |
journal article
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Formatos |
20
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] Theory and practice of logic programming Vol. 3, no. 2 (Mar. 2003), pp. 223-242 Refereed
|
| Fecha de contribución |
02-jun-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
