Boolean satisfiability (SAT) based methods have traditionally been popular for formally verifying properties for digital circuits. We present a novel methodology for formulating a...
Saurabh K. Tiwary, Anubhav Gupta, Joel R. Phillips...
Abstract. Despite the great amount of knowledge produced by the neuroscientific literature affective phenomena, current models tackling noncognitive aspects of behavior are often b...
Marco Mirolli, Francesco Mannella, Gianluca Baldas...
Background: Caenorhabditis elegans gene-based phenotype information dates back to the 1970’s, beginning with Sydney Brenner and the characterization of behavioral and morphologi...
Gary Schindelman, Jolene Fernandes, Carol Bastiani...
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for nondeterministic algorithms, such as branch and bound sea...
Robert L. Bocchino Jr., Stephen Heumann, Nima Hona...
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...