Results 41 to 50 of about 263 (134)
Simultaneous Network Design With Restricted Link Usage
Networks, EarlyView.ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura +3 more
wiley +1 more source
Using Boinc Desktop Grid To Solve Large Scale Sat Problems
Computer Science, 2012 Many practically important combinatorial problems can be efficiently reducedto a problem of Boolean satisfiability (SAT). Therefore, the implementation ofdistributed algorithms for solving SAT problems is of great importance. In thisarticle we describe a
Mikhail Posypkin +2 more
doaj +1 more source
Complete on Average Boolean Satisfiability
Journal of Complexity, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Small, EarlyView.This mini review highlights how machine learning can accelerate the design of programmable nanosystems. It summarizes data‐driven approaches for predicting liposome properties, guiding DNA origami design and image analysis, and optimizing emerging liposome‐DNA hybrid platforms.
Daniel Q. Zhang, Matthew A. B. Baker
wiley +1 more source
Revenge Russell‐Myhill and the Ramified Hierarchy
Theoria, EarlyView.ABSTRACT The Russell‐Myhill paradox targeting the structuralist view of proposition in classical higher‐order logic is blocked by implementing restrictions associated with an ordinary account of predicativity. However, it has been shown that these restrictions are not safe: “revenge” versions of the paradox show the inconsistency of the structuralist ...
Jacopo Berneri
wiley +1 more source
Fault Tolerant Boolean Satisfiability
Journal of Artificial Intelligence Research, 2006 A delta-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover ...
openaire +4 more sources
Boolean satisfiability in quantum compilation
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2019 Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of ...
Mathias Soeken +5 more
openaire +4 more sources
AI Magazine, Volume 47, Issue 4, Winter 2026.Abstract Even while AI based on large language models makes enormous advances, many AI researchers and pundits argue that it LLMs are an inadequate basis for AI because they do not support exact logical and probabilistic reasoning. I argue in response that LLMs can and are using tools to perform such normative reasoning, and thus are in face already ...
Henry Kautz
wiley +1 more source
MAX-SAT Problem using Hybrid Harmony Search Algorithm
Journal of Intelligent Systems, 2018 Maximum Satisfiability problem is an optimization variant of the Satisfiability problem (SAT) denoted as MAX-SAT. The aim of this problem is to find Boolean variable assignment that maximizes the number of satisfied clauses in the Boolean formula.
Abu Doush Iyad +3 more
doaj +1 more source
Advanced Engineering Materials, Volume 28, Issue 20, 21 October 2026.This article explores the transformative potential of symbolic artificial intelligence (AI) in the field of materials science, particularly in leveraging experimental data. The article presents several symbolic AI models and discusses their applications in materials science.
Ahmed Amrani +7 more
wiley +1 more source