A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
This work presents a visualization algorithm for defeasible logic rule bases as well as a software tool that applies this algorithm, according to which, a directed graph is produce...
Efstratios Kontopoulos, Nick Bassiliades, Grigoris...
In the field of biotechnologyand medicineit is of interest to modeland simulate metabolicprocesses. The usual methods to model metabolic pathwaysare chemicaldescriptions anddiffer...