Ricardo Rocha

Prof. Ricardo Rocha

orcid

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 January 2011 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
AKAngelika Kimmig
Angelika Kimmig
BDBart Demoen
Bart Demoen
LRLuc DE Raedt
Luc DE Raedt
VCVitor Santos Costa
Vitor Santos Costa
RRRicardo Rocha
Ricardo Rocha
The past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with probabilities. These facts are treated as mutually independent random variables that indicate whether these facts belong to a randomly sampled program. Different kinds of queries can be posed to ProbLog programs. We introduce algorithms that allow the efficient execution of these queries, discuss their implementation on top of the YAP-Prolog system, and evaluate their performance in the context of large networks of biological entities.

1 May 2009 in The American Journal of Human Genetics
Verified
Journal Article
Closed access
LPLuisa Luisa Pereira
Luisa Luisa Pereira
FFFernando Freitas
Fernando Freitas
VFveronica fernandes
veronica fernandes
JPJoana B. Pereira
Joana B. Pereira
MCMarta Costa
Marta Costa
DSDavid C. Samuels
David C. Samuels

18 October 2011 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
VCVitor Santos Costa
Vitor Santos Costa
RRRicardo Rocha
Ricardo Rocha
LDLuís Damas
Luís Damas
Yet Another Prolog (YAP) is a Prolog system originally developed in the mid-eighties and that has been under almost constant development since then. This paper presents the general structure and design of the YAP system, focusing on three important contributions to the Logic Programming community. First, it describes the main techniques used in YAP to achieve an efficient Prolog engine. Second, most Logic Programming systems have a rather limited indexing algorithm. YAP contributes to this area by providing a dynamic indexing mechanism, or just-in-time indexer. Third, a important contribution of the YAP system has been the integration of both or-parallelism and tabling in a single Logic Programming system.

10 January 2005 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
RRRicardo Rocha
Ricardo Rocha
FSFernando Silva
Fernando Silva
VCVitor Santos Costa
Vitor Santos Costa
Logic programming languages, such as Prolog, provide a high-level, declarative approach to programming. Logic Programming offers great potential for implicit parallelism, thus allowing parallel systems to often reduce a program's execution time without programmer intervention. We believe that for complex applications that take several hours, if not days, to return an answer, even limited speedups from parallel execution can directly translate to very significant productivity gains. It has been argued that Prolog's evaluation strategy – SLD resolution – often limits the potential of the logic programming paradigm. The past years have therefore seen widening efforts at increasing Prolog's declarativeness and expressiveness. Tabling has proved to be a viable technique to efficiently overcome SLD's susceptibility to infinite loops and redundant subcomputations. Our research demonstrates that implicit or-parallelism is a natural fit for logic programs with tabling. To substantiate this belief, we have designed and implemented an or-parallel tabling engine – OPTYap – and we used a shared-memory parallel machine to evaluate its performance. To the best of our knowledge, OPTYap is the first implementation of a parallel tabling engine for logic programming systems. OPTYap builds on Yap's efficient sequential Prolog engine. Its execution model is based on the SLG-WAM for tabling, and on the environment copying for or-parallelism. Preliminary results indicate that the mechanisms proposed to parallelize search in the context of SLD resolution can indeed be effectively and naturally generalized to parallelize tabled computations, and that the resulting systems can achieve good performance on shared-memory parallel machines. More importantly, it emphasizes our belief that through applying or-parallelism and tabling to logic programs the range of applications for Logic Programming can be increased.

1 January 2008
Verified
Book Chapter
Closed access
PDF file
AKAngelika Kimmig
Angelika Kimmig
VCVitor Santos Costa
Vitor Santos Costa
RRRicardo Rocha
Ricardo Rocha
BDBart Demoen
Bart Demoen
LRLuc De Raedt
Luc De Raedt

13 November 2001 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RRRicardo Rocha
Ricardo Rocha
FSFernando Silva
Fernando Silva
VCVitor Santos Costa
Vitor Santos Costa