Results 41 to 50 of about 4,684,489 (303)

Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]

, 2011
This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang, Tingting Han, Andy King, Han, Tingting, Brauer, Jorg, Zhang, Lijun, Hahn, Ernst Moritz, Ernst Moritz Hahn, Jörg Brauer, King, Andy   +9 more
core   +1 more source

Boolean Network Control with Ideals [PDF]

, 2021
A method is given for finding controls to transition an initial state x0 to a target set in deterministic or stochastic Boolean network control models. The algorithms use multivariate polynomial algebra.
Dinwoodie, Ian H.
core   +2 more sources

Algorithms for extracting subsystems from a multilevel representation of a system of Boolean functions for joint minimization

Informatika
Objectives. The purpose of experimental research is to determine the effectiveness of new algorithms for extracting the so-called connected subsystems from formula descriptions of the original system of Boolean functions.
P. N. Bibilo, N. A. Kirienko, V. I. Romanov   +2 more
doaj   +1 more source

Physical random analysis of Boolean chaos

Tongxin xuebao, 2019
To analyze the physical randomness of Boolean chaos,the model for chaotic circuit system based on autonomous Boolean network was established.In addition,the equations of the Boolean network with phase noise were deduced.By considering the phase noise,the
Lishuang GONG, Erlin HOU, Haifang LIU, Kaikai LI, Yuncai WANG   +4 more
doaj   +2 more sources

A full bayesian approach for boolean genetic network inference. [PDF]

PLoS ONE, 2014
Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks.
Shengtong Han, Raymond K W Wong, Thomas C M Lee, Linghao Shen, Shuo-Yen R Li, Xiaodan Fan   +5 more
doaj   +1 more source

Dynamics of boolean networks

Discrete and Continuous Dynamical Systems - S, 2011
Boolean networks are special types of finite state time-discrete dynamical systems. A Boolean network can be described by a function from an n-dimensional vector space over the field of two elements to itself. A fundamental problem in studying these dynamical systems is to link their long term behaviors to the structures of the functions that define ...
openaire   +2 more sources

Stability of linear Boolean networks

Physica D: Nonlinear Phenomena, 2023
18 pages, 3 ...
Karthik Chandrasekhar, Claus Kadelka, Reinhard Laubenbacher, David Murrugarra   +3 more
openaire   +3 more sources

Optimization of ANN Structure Using Adaptive PSO & GA and Performance Analysis Based on Boolean Identities [PDF]

, 2013
In this paper, a novel heuristic structure optimization technique is proposed for Neural Network using Adaptive PSO & GA on Boolean identities to improve the performance of Artificial Neural Network (ANN).
Sahu, Amaresh, Panigrahi, Sushanta, Pattnaik, Sabyasachi, Amaresh Sahu, Sushanta Panigrahi, Sabyasachi Pattnaik   +5 more
core   +1 more source

SAILoR: Structure-Aware Inference of Logic Rules.

PLoS ONE
Boolean networks provide an effective mechanism for describing interactions and dynamics of gene regulatory networks (GRNs). Deriving accurate Boolean descriptions of GRNs is a challenging task.
Žiga Pušnik, Miha Mraz, Nikolaj Zimic, Miha Moškon   +3 more
doaj   +1 more source

On the Design of Boolean Network Robots [PDF]

, 2011
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 design principles and guidelines. Boolean networks are a prominent example of complex dynamical systems and they have been shown to effectively capture important phenomena ...
Andrea Roli, Mattia Manfroni, Carlo Pinciroli, Mauro Birattari   +3 more
openaire   +3 more sources