49 citations · 71 across the 13 of their papers we have counts for
Showing 2011 · cs.AIShow all
2 papers · 2 filters
cs.AI2011★ 1 cited
Solving the Satisfiability Problem Through Boolean Networks
Andrea Roli, Michela Milano
In this paper we present a new approach to solve the satisfiability problem (SAT), based on boolean networks (BN). We define a mapping between a SAT instance and a BN, and we solve…
cs.AI2011
Boolean network robotics: a proof of concept
Andrea Roli, Mattia Manfroni, Carlo Pinciroli +1
Dynamical systems theory and complexity science provide powerful tools for analysing artificial agents and robots. Furthermore, they have been recently proposed also as a source of…