On the Implementation of the CLP(BN) Language

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2010

Autores

Vitor Santos Costa (Autor) FCUP

Ata de Conferência Internacional

Título: PRACTICAL ASPECTS OF DECLARATIVE LANGUAGES, PROCEEDINGS

Páginas: 234-248

12th International Symposium on Practical Aspects of Declarative Languages

Madrid, SPAIN, JAN 18-19, 2010

Indexação

ISI Web of Knowledge - 1 Citação

Scopus - 2 Citações

Classificação Científica

FOS: Ciências exactas e naturais > Ciências da computação e da informação

Outras Informações

ID Authenticus: P-003-CBN

DOI: 10.1007/978-3-642-11503-5_20

Abstract (EN): The last few years have seen great interest in developing models that can describe real-life large-scale structured systems. A popular approach is to address these problems by using logic to describe the patterns or structure of the problems, and by using a calculus of probabilities to address the uncertainty so often found in real life situations. The CLP(BN) language is an extension of Prolog that allows the representation, inference, and learning of bayesian networks. The language was inspired on Koller's Probabilistic Relational Models, and is close to other probabilistic relational languages based in Prolog, such as Sato's PRISM. We present the implementation of CLP(BN), showing how bayesian networks are represented in CLP(BN) and presenting the implementation of three different inference algorithms: Gibbs Sampling, Variable Elimination, and Junction Trees. We show that these algorithms can be implemented effectively by using a matrix library and a graph manipulation library, and study how the system performs on real-life applications.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Notas: ISBN: 978-3-642-11502-8. - Editors Manuel Carro and Ricardo Peña. - Publisher: Springer

Nº de páginas: 15