• Publications
  • Influence
Towards digesting the alphabet-soup of statistical relational learning
This paper reports on our work towards the development of a probabilistic logic programming environment intended as a target language in which other probabilistic languages can be compiled, thereby
Dedicated Tabling for a Probabilistic Setting
By avoiding repeated subcomputations, the tabling approach not only improves the execution time of ProbLog programs, but also decreases accordingly the memory consumption.
ProbLog Technology for Inference in a Probabilistic First Order Logic
The paper defines a semantics for FOProbLog, develops a translation into ProbLog, a system that allows a user to compute the probability of a query in a similar setting restricted to Horn clauses, and reports on initial experience with inference.
Tabling, Rational Terms, and Coinduction Finally Together!
This paper reports the extension of YAP's Prolog tabling mechanism to support rational terms, and describes the internal representation of rational terms within the table space and proves its correctness.
Probabilistic abstract argumentation frameworks, a possible world view
It is proved that the probabilistic attack normal form is sufficient to represent any Probabilistic Abstract Argumentation Framework of the constellation semantics and its connection with Probabilism Logic Programming is illustrated and its equivalent properties are illustrated.
Analyzing the efficiency of context-based grouping on collaboration in VANETs with large-scale simulation
This work proposes a context-based routing scheme and grouping mechanism in which relevant information is shared in an intelligent way within and between the groups and evaluates this approach based on groups with common spatio-temporal characteristics.
Adaptive Sojourn Time HSMM for Heart Sound Segmentation
The proposed approach to adapt sojourn time parameters represents an effective solution for heart sound segmentation problems, even when the training data does not perfectly express the variability of the testing data.
Nesting Probabilistic Inference
In order to support nested probabilistic inference in ProbLog, the notion of a parametrised ProbLog engine is proposed and several extensions of ProbLog such as meta-calls, negation, and answers of probabilism goals are realised.
Tabling relevant parts of SLD proofs for ground goals in a probabilistic setting
This work investigates how the idea of tabling can be used in ProbLog: the challenge is that only the relevant probabilistic parts of the SLD proof tree are required, and outlines a direction to tabling ProbLog programs.
Probabilistic Argumentation Frameworks with MetaProbLog and ConArg
MetaProbLog is used, a ProbLog framework where facts in a logic program are annotated by probabilities, to compute the probability of possible worlds of arguments in Probabilistic Abstract Argumentation.