Results 61 to 70 of about 18,245 (221)
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
Quantifier Elimination in Stochastic Boolean Satisfiability [PDF]
, 2022 Stochastic Boolean Satisfiability (SSAT) generalizes quantified Boolean formulas (QBFs) by allowing quantification over random variables. Its generality makes SSAT powerful to model decision or optimization problems under uncertainty.
Wang, Hao-Ren +3 more
core +1 more source
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
Theory Propagation and Reification [PDF]
, 2015 SAT Modulo Theories (SMT) is the problem of determining the satisfiability of a formula in which constraints, drawn from a given constraint theory T, are composed with logical connectives.
Howe, J. M. +5 more
core +1 more source
Predicting Propositional Satisfiability Based on Graph Attention Networks
International Journal of Computational Intelligence Systems, 2022 Boolean satisfiability problems (SAT) have very rich generic and domain-specific structures. How to capture these structural features in the embedding space and feed them to deep learning models is an important factor influencing the use of neural ...
Wenjing Chang, Hengkai Zhang, Junwei Luo
doaj +1 more source
Journal of the Royal Anthropological Institute, EarlyView.Food and alcohol indulgence, along with tea‐drinking, gambling, and gossip, are integral to a characteristically Sichuanese ethos of ‘life enjoyment’ (xiangshou shenghuo). Beyond mere pleasure, sensory, ludic, and comic experiences temporarily strip participants of both their formal and subjective qualities.
Angel Nayden
wiley +1 more source
Satisfiability at Microsoft [PDF]
, 2011 Constraint satisfaction problems arise in many diverse areas including software and hardware verification, type inference, static program analysis, test-case generation, scheduling, planning and graph problems. These areas share a common trait, they include a core component using logical formulas for describing states and transformations between them ...
openaire +1 more source
The New Hilbert's Hotel Argument Defended
Analytic Philosophy, EarlyView.ABSTRACT Joe Schmid and Troy Dana have recently advanced several criticisms of the New Hilbert's Hotel Argument formulated by us. In this paper, we respond by undercutting their proposed defeaters. First, we argue that they fail to refute the claim that Hilbert's Hotel entails a logical contradiction in the concrete world.
Eli Haitov, Andrew Loke
wiley +1 more source
Abstract Model Counting: A Novel Approach for Quantification of Information Leaks [PDF]
, 2014 acmid: 2590328 keywords: model checking, quantitative information flow, satisfiability modulo theories, symbolic execution location: Kyoto, Japan numpages: 10acmid: 2590328 keywords: model checking, quantitative information flow, satisfiability modulo ...
Quoc-Sang Phan +4 more
core +1 more source
Two-Variable Logic with Two Order Relations [PDF]
Logical Methods in Computer Science, 2012 It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj +1 more source