Results 71 to 80 of about 3,671,128 (304)
QMaxSAT: A Partial Max-SAT Solver
Journal on Satisfiability, Boolean Modeling and Computation, 2012 We present a partial Max-SAT solver QMaxSAT which uses CNF encoding of Boolean cardinality constraints. The old version 0.1 was obtained by adapting a CDCL based SAT solver MiniSat to manage cardinality constraints.
Miyuki Koshimura +3 more
semanticscholar +1 more source
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
Introducing a Resolvable Network-Based SAT Solver Using Monotone CNF–DNF Dualization and Resolution
MathematicsThis paper is a theoretical contribution that introduces a new reasoning framework for SAT solving based on resolvable networks (RNs). RNs provide a graph-based representation of propositional satisfiability in which clauses are interpreted as directed ...
Gábor Kusper, Benedek Nagy
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Learn with SAT to Minimize Büchi Automata [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 We describe a minimization procedure for nondeterministic Büchi automata (NBA). For an automaton A another automaton A_min with the minimal number of states is learned with the help of a SAT-solver. This is done by successively computing automata A' that
Stephan Barth, Martin Hofmann
doaj +1 more source
FEBS Letters, EarlyView.This study reveals a unique active site enriched in methionine residues and demonstrates that these residues play a critical role by stabilizing carbocation intermediates through novel sulfur–cation interactions. Structure‐guided mutagenesis further revealed variants with significantly altered product profiles, enhancing pseudopterosin formation. These
Marion Ringel +13 more
wiley +1 more source
Bit-Vector Model Counting using Statistical Estimation
, 2016 Approximate model counting for bit-vector SMT formulas (generalizing \#SAT) has many applications such as probabilistic inference and quantitative information-flow security, but it is computationally difficult.
A Cimatti +23 more
core +1 more source
FEBS Letters, EarlyView.Biomolecular condensates formed by fused in sarcoma (FUS) are dissolved by high ATP concentrations yet persist in cells. Using a reconstituted system, we demonstrate that valosin‐containing protein (VCP), an AAA+ ATPase, counteracts ATP‐driven dissolution of FUS condensates through its D2 ATPase activity.
Hitomi Kimura +2 more
wiley +1 more source
Effective Partitioning Method With Predictable Hardness for CircuitSAT
IEEE AccessMany industrial verification problems are solved via reduction to CircuitSAT (curcuit satisfibiliaty). It is often the case that the resulting SAT instances are very hard and require the use of parallel computing to be solved in reasonable time.
Konstantin Chukharev +5 more
doaj +1 more source
Tarmo: A Framework for Parallelized Bounded Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framework for parallelized BMC named Tarmo.
Siert Wieringa +2 more
doaj +1 more source