Results 31 to 40 of about 18,245 (221)
Satisfiability and Evolution [PDF]
2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 2014 We show that, if truth assignments on $n$ variables reproduce through recombination so that satisfaction of a particular Boolean function confers a small evolutionary advantage, then a polynomially large population over polynomially many generations (polynomial in $n$ and the inverse of the initial satisfaction probability) will end up almost certainly
Adi Livnat +4 more
openaire +3 more sources
Expected number of locally maximal solutions for random Boolean CSPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 For a large number of random Boolean constraint satisfaction problems, such as random $k$-SAT, we study how the number of locally maximal solutions evolves when constraints are added.
Nadia Creignou +2 more
doaj +1 more source
Subtropical Satisfiability [PDF]
, 2017 Quantifier-free nonlinear arithmetic (QF_NRA) appears in many applications of satisfiability modulo theories solving (SMT). Accordingly, efficient reasoning for corresponding constraints in SMT theory solvers is highly relevant. We propose a new incomplete but efficient and terminating method to identify satisfiable instances.
Pascal Fontaine +3 more
openaire +6 more sources
Combining macros and SAT planning [PDF]
, 2010 Planning based on propositional satisfiability is a powerful approach for computing makespan-optimal plans. However, it is usually slower then heuristic-based sub-optimal approaches.
Vallati, Mauro
core +2 more sources
On Some Approaches to the Solution of the Problem «Useful Proof-of-work for Blockchains»
Моделирование и анализ информационных систем, 2018 The blockchain technology is based on the ”Proof-of-work” principles. The essence of this principle is that some event (for example the bill-to-bill money transaction) becomes significant after the confirmation by a certain computer work.
Valeriy G. Durnev +3 more
doaj +1 more source
Normal form of formulas of pure hybrid logic
Lietuvos Matematikos Rinkinys, 2021 In this paper,we study a transformationof pure hybrid logic formulae,which do not have binding operator, into an equivalent normal form, which does not have any satisfiability operators in the scope of another satisfiability operator.
Daiva Aleknavičiūtė +1 more
doaj +1 more source
Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]
Logical Methods in Computer Science, 2017 The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj +1 more source
Satisfiability modulo theories and chiral heterotic string vacua with positive cosmological constant
Physics Letters B, 2021 We apply Boolean Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) solvers in the context of finding chiral heterotic string models with positive cosmological constant from Z2×Z2 orbifolds.
Alon E. Faraggi +3 more
doaj +1 more source
Dynamic Initial Weight Assignment for MaxSAT
Algorithms, 2021 The Maximum Satisfiability (Maximum Satisfiability (MaxSAT)) approach is the choice, and perhaps the only one, to deal with most real-world problems as most of them are unsatisfiable.
Abdelraouf Ishtaiwi, Qasem Abu Al-Haija
doaj +1 more source
Checking Consistency of Database Constraints [PDF]
, 1986 This paper addresses the problem of consistency of a set of integrity constraints itself, independent from any state. It is pointed out that database constraints have not only to be consistent, but in addition to be finitely satisfiable.
Kambayashi, Yahiko +2 more
core +1 more source