Inference for logical probabilistic languages

Probabilistic logic languages allow to model domains where there are complex and uncertain relationships between entities. Recently, several probabilistic logic languages have been proposed in the field of logic programming. The problem of reasoning with these languages is of great interest. In particular, in this project we will calculate the probability of a query given a program. The hybrid server will be used to measure the time taken by different algorithms for this problem. Algorithms developed by the group will be tested and compared with algorithms developed by other researchers. The large memory capacity of the server will allow testing the algorithms on problems of significant size.

Principal investigator: Fabrizio Riguzzi rzf@unife.it
http://www.ing.unife.it/docenti/FabrizioRiguzzi/
Promoters: Bellodi Elena blllne2@unife.it
http://sites.unife.it/ml/people/elena-bellodi
Project Home Page: http://sites.unife.it/ml