Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Probabilistic 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

Marcadores Sociales
Probabilistic Logic Programming
Id. 41671559
Idioma inglés
Titulo Probabilistic Logic Programming
Autor(es) Thomas Lukasiewicz
Localización http://citeseer.ist.psu.edu/236443.html
Versión 1.0
Estado Final
Descripción . We present a new approach to probabilistic logic programs with a possible worlds semantics. Classical program clauses are extended by a subinterval of [0; 1] that describes the range for the conditional probability of the head of a clause given its body. We show that deduction in the defined probabilistic logic programs is computationally more complex than deduction in classical logic programs. More precisely, restricted deduction problems that are Pcomplete for classical logic programs are already NP-hard for probabilistic logic programs. We then elaborate a linear programming approach to probabilistic deduction that is efficient in interesting special cases. In the best case, the generated linear programs have a number of variables that is linear in the number of ground instances of purely probabilistic clauses in a probabilistic logic program. 1 INTRODUCTION There is already a quite extensive literature on probabilistic propositional logics and their various dialects. The most fa...
Tipo ps
Palabras clave Thomas Lukasiewicz Probabilistic Logic Programming
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
unrestricted
Formatos ps
Requerimientos técnicos Browser: Any
Relación [IsBasedOn] http://www.kr.tuwien.ac.at/staff/lukasiew/ecai98.ps.gz
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.