Results 161 to 170 of about 44,054 (190)
Some of the next articles are maybe not open access.
Stochastic Boolean Satisfiability
Journal of Automated Reasoning, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Littman, Michael L. +2 more
openaire +2 more sources
Approximating satisfiable satisfiability problems
1997We study the approximability of the Maximum Satisfiability Problem (MAX SAT) and of the boolean k-ary Constraint Satisfaction Problem (MAX kCSP) restricted to satisfiable instances. For both problems we improve on the performance ratios of known algorithms for the unrestricted case.
openaire +1 more source
2009
AbstractBecause of Cook's theorem, satisfiability lies at the heart of computational complexity theory. This chapter presents some selected research directions, focusing on ensembles of random satisfiability instances. When the density of constraints is increased, a phase transition between a SAT and an UNSAT phase take place.
Marc Mézard, Andrea Montanari
openaire +1 more source
AbstractBecause of Cook's theorem, satisfiability lies at the heart of computational complexity theory. This chapter presents some selected research directions, focusing on ensembles of random satisfiability instances. When the density of constraints is increased, a phase transition between a SAT and an UNSAT phase take place.
Marc Mézard, Andrea Montanari
openaire +1 more source
Satisfiability versus Finite Satisfiability in Elementary Modal Logics
Fundamenta Informaticae, 2018We study variants of the satisfiability problem of elementary modal logics, i.e., modal logic considered over first-order definable classes of frames. The standard semantics of modal logic allows infinite structures, but often practical applications require to restrict our attention to finite structures.
Michaliszyn, Jakub +2 more
openaire +1 more source
Quantified maximum satisfiability
Constraints, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ignatiev, Alexey +2 more
openaire +1 more source
Sums of Squares, Satisfiability and Maximum Satisfiability
2005Recently the Mathematical Programming community showed a renewed interest in Hilbert's Positivstellensatz. The reason for this is that global optimization of polynomials in ℝ[x1,...,xn] is $\mathcal{NP}$-hard, while the question whether a polynomial can be written as a sum of squares has tractable aspects.
Hans van Maaren, Linda van Norden
openaire +1 more source
From Propositional Satisfiability to Satisfiability Modulo Theories
2006In this paper we present a review of SAT-based approaches for building scalable and efficient decision procedures for quantifier-free first-order logic formulas in one or more decidable theories, known as Satisfiability Modulo Theories (SMT) problems.
Hossein M. Sheini, Karem A. Sakallah
openaire +1 more source
2009
In the last twenty years a significant amount of effort has been devoted to the study of randomly generated satisfiability instances. While a number of generative models have been proposed, uniformly random k-CNF formulas are by now the dominant and most studied model.
openaire +1 more source
In the last twenty years a significant amount of effort has been devoted to the study of randomly generated satisfiability instances. While a number of generative models have been proposed, uniformly random k-CNF formulas are by now the dominant and most studied model.
openaire +1 more source