Search
Search Results
-
Learning to select SAT encodings for pseudo-Boolean and linear integer constraints
Many constraint satisfaction and optimisation problems can be solved effectively by encoding them as instances of the Boolean Satisfiability problem...
-
Linear cuts in Boolean networks
Boolean networks are popular tools for the exploration of qualitative dynamical properties of biological systems. Several dynamical interpretations...
-
Boolean interpretation, matching, and ranking of natural language queries in product selection systems
E-commerce is a massive sector in the US economy, generating $767.7 billion in revenue in 2021. E-commerce sites maximize their revenue by hel**...
-
From quantitative SBML models to Boolean networks
Modelling complex biological systems is necessary for their study and understanding. Biomodels is a repository of peer-reviewed models represented in...
-
Symmetry and Dominance Breaking for Pseudo-Boolean Optimization
It is well-known that highly symmetric problems can often be challenging for combinatorial search and optimization solvers. One technique to avoid...
-
Embedding Arbitrary Boolean Circuits into Fungal Automata
Fungal automata are a variation of the two-dimensional sandpile automaton of Bak et al. (Phys Rev Lett 59(4):381–384, 1987.
https://doi.org/10.1103/PhysRevLett.59.381... 
-
Using answer set programming to deal with boolean networks and attractor computation: application to gene regulatory networks of cells
Deciphering gene regulatory networks’ functioning is an essential step for better understanding of life, as these networks play a fundamental role in...
-
Compositional Techniques for Boolean Networks and Attractor Analysis
Recently a new compositional framework for constructing and analysing Boolean networks was presented based on merging entities using Boolean...
-
Weighted Tree Automata with Constraints
The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable...
-
Boolean-Arithmetic Equations: Acquisition and Uses
Motivated by identifying equations to automate the discovery of conjectures about sharp bounds on combinatorial objects, we introduce a CP model to...
-
Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments
Query answering is an important problem in AI, database and knowledge representation. In this paper, we develop saturation-based Boolean conjunctive...
-
Representation of gene regulation networks by hypothesis logic-based Boolean systems
Boolean Dynamical Systems (BDSs) are networks described by Boolean variables. A new representation of BDSs is presented in this article by using...
-
Boolean Abstractions for Realizability Modulo Theories
In this paper, we address the problem of the (reactive) realizability of specifications of theories richer than Booleans, including arithmetic...
-
Clausal Proofs for Pseudo-Boolean Reasoning
When augmented with a Pseudo-Boolean (PB) solver, a Boolean satisfiability (SAT) solver can apply apply powerful reasoning methods to determine when...
-
Stabilization of Boolean control networks with state-triggered impulses
Previously, impulses were used to model abrupt changes in dynamic biological systems. This paper introduces a hybrid-index model that can...
-
Tables and Constraints
The next logical step is to create objects in the database. Usually, the objects created for an application are tables, constraints, and indexes. A...
-
On Applying Boolean Masking to Exponents
Implementations of block ciphers typically use Boolean shares of intermediate states to prevent side-channel analysis. Implementations of public-key...
-
Extending Boolean Variability Relationship Extraction to Multi-valued Software Descriptions
Extracting variability information from software product descriptions is crucial when reverse engineering a software product line, e.g., for...