Results 31 to 40 of about 133,438 (232)
Explainable Artificial Intelligence Using Expressive Boolean Formulas
Machine Learning and Knowledge Extraction, 2023 We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions.
Gili Rosenberg +8 more
doaj +1 more source
Constraint Programming viewed as Rule-based Programming
, 2001 We study here a natural situation when constraint programming can be entirely reduced to rule-based programming. To this end we explain first how one can compute on constraint satisfaction problems using rules represented by simple first-order formulas ...
Apt, Krzysztof R., Monfroy, Eric
core +4 more sources
Multitask Evolution with Cartesian Genetic Programming
, 2017 We introduce a genetic programming method for solving multiple Boolean circuit synthesis tasks simultaneously. This allows us to solve a set of elementary logic functions twice as easily as with a direct, single-task approach.Comment: 2 ...
Caruana Rich +2 more
core +1 more source
Generating reversible circuits from higher-order functional programs
, 2016 Boolean reversible circuits are boolean circuits made of reversible elementary gates. Despite their constrained form, they can simulate any boolean function.
A Ambainis +15 more
core +3 more sources
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
Open Journal of Mathematical OptimizationWe consider the problem of linearizing a pseudo-Boolean function $f : \lbrace 0,1\rbrace ^n \rightarrow \mathbb{R}$ by means of $k$ Boolean functions. Such a linearization yields an integer linear programming formulation with only $k$ auxiliary variables.
Walter, Matthias
doaj +1 more source
PATHLOGIC-S: a scalable Boolean framework for modelling cellular signalling. [PDF]
PLoS ONE, 2012 Curated databases of signal transduction have grown to describe several thousand reactions, and efficient use of these data requires the development of modelling tools to elucidate and explore system properties.
Liam G Fearnley, Lars K Nielsen
doaj +1 more source
Trust, but Verify: Two-Phase Typing for Dynamic Languages [PDF]
, 2015 A key challenge when statically typing so-called dynamic languages is the ubiquity of value-based overloading, where a given function can dynamically reflect upon and behave according to the types of its arguments.
Cosman, Benjamin +2 more
core +2 more sources
A Special Role of Boolean Quadratic Polytopes among Other Combinatorial Polytopes
Моделирование и анализ информационных систем, 2016 We consider several families of combinatorial polytopes associated with the following NP-complete problems: maximum cut, Boolean quadratic programming, quadratic linear ordering, quadratic assignment, set partition, set packing, stable set, 3-assignment.
A. N. Maksimenko
doaj +1 more source
Generalized Totalizer Encoding for Pseudo-Boolean Constraints
, 2015 Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula.
A Graça +18 more
core +1 more source
Pseudo Boolean Programming for Partially Ordered Genomes [PDF]
, 2009 Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes.
Angibaud, Sébastien +3 more
openaire +2 more sources