Results 21 to 30 of about 133,438 (232)
Extending boolean regulatory network models with answer set programming [PDF]
, 2010 Because of their simplicity, boolean networks are a popular formalism to model gene regulatory networks. However, they have their limitations, including their inability to formally and unambiguously define network behaviour, and their lack of the ...
Fayruzov, Timur +4 more
core +2 more sources
Exact Boolean Abstraction of Linear Equation Systems
Computation, 2021 We study the problem of how to compute the boolean abstraction of the solution set of a linear equation system over the positive reals. We call a linear equation system ϕ exact for the boolean abstraction if the abstract interpretation of ϕ over the ...
Emilie Allart +2 more
doaj +1 more source
Automated Problem Decomposition for the Boolean Domain with Genetic Programming [PDF]
, 2013 Researchers have been interested in exploring the regularities and modularity of the problem space in genetic programming (GP) with the aim of decomposing the original problem into several smaller subproblems.
A. Moraglio +6 more
core +2 more sources
Embedding boolean expressions into logic programming
Journal of Symbolic Computation, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Buttner, Wolfram, Simonis, Helmut
openaire +2 more sources
Boolean lexicographic optimization: algorithms & applications [PDF]
, 2011 Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints.
Argelich Romà, Josep +3 more
core +1 more source
SAT-Based Summarization for Boolean Programs [PDF]
, 2007 Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their stack is not bounded. The enabling technique is summarization of procedure calls.
Gérard Basler +2 more
openaire +3 more sources
Geometric semantic genetic programming for recursive boolean programs [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference, 2017 Geometric Semantic Genetic Programming (GSGP) induces a unimodal fitness landscape for any problem that consists in finding a function fitting given input/output examples. Most of the work around GSGP to date has focused on real-world applications and on improving the originally proposed search operators, rather than on broadening its theoretical ...
Alberto Moraglio, Krzysztof Krawiec
openaire +1 more source
From quantitative SBML models to Boolean networks
Applied Network Science, 2022 Modelling complex biological systems is necessary for their study and understanding. Biomodels is a repository of peer-reviewed models represented in the Systems Biology Markup Language (SBML).
Athénaïs Vaginay +2 more
doaj +1 more source
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem [PDF]
Computer Science Journal of Moldova, 2002 We consider a multiple criterion Boolean programming problem with MINMAX partial criteria. The extreme level of independent perturbations of partial criteria parameters such that efficient (Pareto optimal) solution preserves optimality was obtained.
Vladimir A. Emelichev +2 more
doaj +2 more sources
Efficient Groundness Analysis in Prolog [PDF]
, 2002 Boolean functions can be used to express the groundness of, and trace grounding dependencies between, program variables in (constraint) logic programs.
Howe, Jacob M., King, Andy
core +4 more sources