Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Probabilistic Logic under Coherence: Complexity and Algorithms

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 under Coherence: Complexity and Algorithms
Id. 46244542
Idioma inglés
Titulo Probabilistic Logic under Coherence: Complexity and Algorithms
Autor(es) Veronica Biazzo
Angelo Gilio
Thomas Lukasiewicz
Localización http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.9192
Versión 1.0
Estado Final
Descripción We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore the relationship between coherence-based and classical modeltheoretic probabilistic logic. Interestingly, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Using these results, we analyze the computational complexity of probabilistic reasoning under coherence. Moreover, we present new algorithms for deciding g-coherence and for computing tight g-coherent intervals, which reduce these tasks to standard reasoning tasks in model-theoretic probabilistic logic. Thus, efficient techniques for model-theoretic probabilistic reasoning can immediately be applied for probabilistic reasoning under coherence, for example, column generation techniques. We then describe two other interesting techniques for efficient model-theoretic probabilistic reasoning in the conjunctive case.
Tipo application/postscript
Palabras clave probabilistic logic
Tipo de recurso Texto Narrativo
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
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.kr.tuwien.ac.at/staff/lukasiew/isipta01.ps.gz
[References] 10.1.1.47.8467
[References] 10.1.1.40.8860
[References] 10.1.1.32.7438
[References] 10.1.1.48.5649
[References] 10.1.1.48.49
[References] 10.1.1.44.3027
[References] 10.1.1.29.9023
[References] 10.1.1.21.2216
[References] 10.1.1.28.8152
[References] 10.1.1.19.562
[References] 10.1.1.44.2715
[References] 10.1.1.7.7250
[References] 10.1.1.23.5884
[References] 10.1.1.22.4485
[References] 10.1.1.21.2216
[References] 10.1.1.28.8152
[References] 10.1.1.7.7250
[References] 10.1.1.85.7361
[References] 10.1.1.12.1176
[References] 10.1.1.10.3239
[References] 10.1.1.15.7305
[References] 10.1.1.16.8544
[References] 10.1.1.63.8465
[References] 10.1.1.139.3483
[References] 10.1.1.72.776
[References] 10.1.1.83.8888
[References] 10.1.1.88.3467
[References] 10.1.1.91.1457
[References] 10.1.1.95.4742
[References] 10.1.1.135.1381
[References] 10.1.1.62.411
Fecha de contribución 22-jul-2009
Contacto

Valoración de los usuarios

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.