Implementing a prioritized logic programming system : thesis
|
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
|
|
|
Implementing a prioritized logic programming system : thesis
|
| Id. |
42530332 |
| Idioma |
eng
|
| Titulo |
Implementing a prioritized logic programming system : thesis |
| Autor(es) |
Wu, Cheng-min
University of Western Sydney, Nepean
School of Computing and Information Technology
|
| Localización |
http://handle.uws.edu.au:8081/1959.7/188
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Rule based knowledge representation and reasoning often face a problem of conflict with rules. One common way of solving conflicts is to introduce priorities associate with rules. The thesis describes the underlying algorithm to implement prioritized logic programs (PLPs) proposed by Zhang and Foo in 1997. PLPs are proposed as an extension of Gelfond and Lifschitz's extended logic programs by introducing preferences associatied with rules to the program, where answer sets provide a semantics of PLPs. Major algorithms are presented in detail, and how answer sets can be derived from the algorithm demonstrated. Under this implementation, a PLP is computed efficiently based on previous Niemela and Simons' method of computing stable models of logic programs. Finally, world wide web interface has been employed and embedded to the system to provide great accessibility to the public.
|
| Palabras clave |
logic
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] THESIS_XXX_CIT_Wu_C.xml
|
| Fecha de contribución |
13-oct-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
