Results 61 to 70 of about 770 (181)
The Satisfiability Problem for Boolean Set Theory with a Choice Correspondence [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Given a set U of alternatives, a choice (correspondence) on U is a contractive map c defined on a family Omega of nonempty subsets of U. Semantically, a choice c associates to each menu A in Omega a nonempty subset c(A) of A comprising all elements of A
Domenico Cantone +2 more
doaj +1 more source
Open‐source AI at scale: Establishing an enterprise AI strategy through modular frameworks
AI Magazine, Volume 46, Issue 3, Fall 2025.Abstract We present a comprehensive enterprise AI strategy developed within the AI Center of Excellence at Fidelity Investments, emphasizing the strategic integration of open‐source AI frameworks into scalable, modular, and reproducible enterprise‐grade solutions.
Serdar Kadıoğlu
wiley +1 more source
Automatic Screening for Perturbations in Boolean Networks
Frontiers in Physiology, 2018 A common approach to address biological questions in systems biology is to simulate regulatory mechanisms using dynamic models. Among others, Boolean networks can be used to model the dynamics of regulatory processes in biology.
Julian D. Schwab +2 more
doaj +1 more source
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
Mendel, 2020 The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva +2 more
doaj +1 more source
Term-Level Reasoning in Support of Bit-blasting [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 GL is a verified tool for proving ACL2 theorems using Boolean methods such as BDD reasoning and satisfiability checking. In its typical operation, GL recursively traverses a term, computing a symbolic object representing the value of each subterm.
Sol Swords
doaj +1 more source
Generalizing Boolean Satisfiability III: Implementation
Journal of Artificial Intelligence Research, 2005 This is the third of three papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high-performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean ...
Heidi E. Dixon +4 more
openaire +4 more sources
Boolean Abstraction for Temporal Logic Satisfiability [PDF]
, 2007 Increasing interest towards property based design calls for effective satisfiability procedures for expressive temporal logics, e.g. the IEEE standard Property Specification Language (PSL). In this paper, we propose a new approach to the satisfiability of PSL formulae; we follow recent approaches to decision procedures for Satisfiability Modulo ...
Alessandro Cimatti +3 more
openaire +1 more source
Dynamic symmetry-breaking for Boolean satisfiability [PDF]
Annals of Mathematics and Artificial Intelligence, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fadi A. Aloul +3 more
openaire +2 more sources
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
Optimizing Test Pattern Compaction with Boolean Satisfiability Attack
ChipsTest time per chip plays an essential role in manufacturing tests. Keeping a low number of test patterns becomes one of the prime objectives in concurrence with achieving the desired fault coverage.
Yadi Zhong
doaj +1 more source