2 citations · 2 across the 4 of their papers we have counts for
4 papers
Boolean constraint satisfaction problems for reaction networks
Alessandro Seganti
This Thesis presents research at the boundary between Statistical Physics and Biology. First, we have devised a class of Boolean constraint satisfaction problems (CSP) whose soluti…
NLPR@SRPOL at SemEval-2019 Task 6 and Task 5: Linguistically enhanced deep learning offensive sentence classifier
Alessandro Seganti, Helena Sobol, Iryna Orlova +4
The paper presents a system developed for the SemEval-2019 competition Task 5 hat-Eval Basile et al. (2019) (team name: LU Team) and Task 6 OffensEval Zampieri et al. (2019b) (team…
Searching for feasible stationary states in reaction networks by solving a Boolean constraint satisfaction problem
Alessandro Seganti, Federico Ricci-Tersenghi, Andrea De Martino
We analyze the solutions, on single network instances, of a recently introduced class of constraint-satisfaction problems (CSPs), describing feasible steady states of chemical reac…
Boolean constraint satisfaction problems for reaction networks
Alessandro Seganti, Andrea De Martino, Federico Ricci-Tersenghi
We define and study a class of (random) Boolean constraint satisfaction problems representing minimal feasibility constraints for networks of chemical reactions. The constraints we…