A fundamental assumption often made in supervised classification is that the problem is static, i.e. the description of the classes does not change with time. However many practi...
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
Electronic patient records (EPRs) are a valuable resource for research but for confidentiality reasons they cannot be used freely. In order to make EPRs available to a wider group...
A relational probability tree (RPT) is a type of decision tree that can be used for probabilistic classification of instances with a relational structure. Each leaf of an RPT cont...
Accessing structured data in the form of ontologies requires training and learning formal query languages (e.g., SeRQL or SPARQL) which poses significant difficulties for non-expe...