Results 61 to 70 of about 133,438 (232)
On binary decision hypertree (hyperdiagram) [PDF]
AUT Journal of Mathematics and ComputingIn computer science, a binary decision diagram is a data structure that is used to represent a Boolean function and to consider a compressed representation of relations.
Mohammad Hamidi, Marzieh Rahmati
doaj +1 more source
Quantum programming of the satisfiability problem with Rydberg atom graphs
Physical Review Research, 2023 Finding a quantum computing method to solve nondeterministic polynomial time (NP)-complete problems is currently of paramount importance in quantum information science. Here we propose and experimentally demonstrate a Rydberg atom approach to program the
Seokho Jeong +4 more
doaj +1 more source
A Boolean network control algorithm guided by forward dynamic programming.
PLoS ONE, 2019 Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state.
Mohammad Moradi +2 more
doaj +1 more source
Probabilistic call by push value [PDF]
Logical Methods in Computer Science, 2019 We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF encompassing both
Thomas Ehrhard, Christine Tasson
doaj +1 more source
, 2018 We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function.
De Micheli, Giovanni +3 more
core +1 more source
Quantitative Information Flow in Boolean Programs [PDF]
, 2014 The quantitative information flow bounding problem asks, given a program P and threshold q, whether the information leaked by P is bounded by q. When the amount of information is measured using mutual information, the problem is known to be PSPACE-hard and decidable in EXPTIME.
Rohit Chadha +2 more
openaire +1 more source
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work
, 2011 This is the first of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers.
Dixon, H. E. +2 more
core +1 more source
MERIDA: a novel Boolean logic-based integer linear program for personalized cancer therapy [PDF]
, 2021 Kerstin Lenhof +5 more
openalex +1 more source
Repairing Boolean logical models from time-series data using Answer Set Programming
Algorithms for Molecular Biology, 2019 Background Boolean models of biological signalling-regulatory networks are increasingly used to formally describe and understand complex biological processes. These models may become inconsistent as new data become available and need to be repaired.
Alexandre Lemos +2 more
doaj +1 more source
Synthesizing Functional Reactive Programs [PDF]
, 2019 Functional Reactive Programming (FRP) is a paradigm that has simplified the construction of reactive programs. There are many libraries that implement incarnations of FRP, using abstractions such as Applicative, Monads, and Arrows.
Finkbeiner, Bernd +3 more
core +1 more source