We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Abstract. Recent experimental observations of spiketiming-dependent synaptic plasticity (STDP) have revitalized the study of synaptic learning rules. The most surprising aspect of ...
Motivated by the matchmaking problem in electronic marketplaces, we study abduction in Description Logics. We devise suitable definitions of the problem, and show how they can mod...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
In order to manage the knowledge representation of European law we have proposed the Legal Taxonomy Syllabus methodology (Ajani et al., 2007a; Ajani et al., 2007b). In this paper ...
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...