Results 31 to 40 of about 133,463 (288)
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
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
Implementing atomic actions in Ada 95 [PDF]
, 1997 Atomic actions are an important dynamic structuring technique that aid the construction of fault-tolerant concurrent systems. Although they were developed some years ago, none of the well-known commercially-available programming languages directly ...
Burns, A, Wellings, A
core +1 more source
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