Theofrastos Mantadelis

Theofrastos Mantadelis
University of Porto | UP · Artificial Intelligence and Computer Science Laboratory

PhD in Computer Engineering

About

18
Publications
1,460
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
75
Citations

Publications

Publications (18)
Article
After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in extending the Dung's semantics in order to describe more complex or real life situations. Several of these approaches take the direction of weighted or probabilistic extensions. One of the most prominent probabilistic approaches is that of constella...
Chapter
After Dung’s founding work in Abstract Argumentation Frameworks there has been a growing interest in extending the Dung’s semantics in order to describe more complex or real life situations. Several of these approaches take the direction of weighted or probabilistic extensions. One of the most prominent probabilistic approaches is that of constella...
Preprint
Full-text available
After Dung's founding work in Abstract Argumentation Frameworks there has been a growing interest in extending the Dung's semantics in order to describe more complex or real life situations. Several of these approaches take the direction of weighted or probabilistic extensions. One of the most prominent probabilistic approaches is that of constella...
Article
Full-text available
Heart sounds are difficult to interpret due to events with very short temporal onset between them (tens of millisec- onds) and dominant frequencies that are out of the human audi- ble spectrum. Computer assisted decision systems may help but they require robust signal processing algorithms. In this paper, we propose a new algorithm for heart sound...
Conference Paper
Full-text available
In Probabilistic Abstract Argumentation, arguments and attacks (nodes and edges) in a graph instance are associated with a probability value. These probabilities can be interpreted in different ways: for instance, in the constellation approaches, the probabilities introduce uncertainty in the topology of the graph. In this paper we use MetaProbLog,...
Conference Paper
Auscultation is a widely used technique in clinical activity to diagnose heart diseases. However, heart sounds are difficult to interpret because a) of events with very short temporal onset between them (tens of milliseconds) and b) dominant frequencies that are out of the human audible spectrum. In this paper, we propose a model to segment heart s...
Conference Paper
Full-text available
This paper presents an interdisciplinary study joining insights of landscape architecture and computer vision. In this work we used a dataset of contemplative landscape images that was collected and evaluated by experts in landscape architecture. We used the dataset to develop nine k-means clustering and one K-nearest neighbors models that are able...
Conference Paper
Full-text available
Knowledge compilation converts Boolean formulae for which some inference tasks are computationally expensive into a representation where the same tasks are tractable. ProbLog is a state-of-the-art Probabilistic Logic Programming system that uses knowledge compilation to reduce the expensive probabilistic inference to an efficient weighted model cou...
Article
Full-text available
This paper, presents ongoing work that extends MetaProbLog with Most Probable Explanation (MPE) inference method. The MPE inference method is widely used in Hidden Markov Models in order to derive the most likely states of a model. Recently, we started developing an application that uses MetaProbLog to models phonocardiograms. We target to use this...
Article
Full-text available
To appear in Theory and Practice of Logic Programming (TPLP) Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with a...
Article
To appear in Theory and Practice of Logic Programming (TPLP). Tabling is a commonly used technique in logic programming for avoiding cyclic behavior of logic programs and enabling more declarative program definitions. Furthermore, tabling often improves computational performance. Rational term are terms with one or more infinite sub-terms but with...
Conference Paper
Full-text available
ProbLog is a probabilistic framework that extends Prolog with probabilistic facts. Inference in ProbLog is based on calculations over the SLD proof tree of a query. Tabling is a well known technique to avoid re-computation. We investigate how the idea of tabling can be used in ProbLog: the challenge is that we are not just interested in the answers...

Network

Cited By

Projects

Project (1)
Project
The goal is to build a computer software based on the artificial neural networks, that will automatically score the given landscape digital images accoring to their level of contemplativeness. That can help private and public institutions interested in having the healing environment to automatically diagnose and improve their landscapes, so they can have an evidence-based influence on people's mental health and well-being.