Results 191 to 200 of about 62,255 (228)

Satisfiability versus Finite Satisfiability in Elementary Modal Logics

Fundamenta Informaticae, 2018
We 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, Otop, Jan, Witkowski, Piotr   +2 more
openaire   +1 more source

Quantified maximum satisfiability

Constraints, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ignatiev, Alexey, Janota, Mikoláš, Marques-Silva, Joao   +2 more
openaire   +1 more source

CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability

IEEE transactions on computers, 2015
The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has extensive applications. Weighted MAX-SAT instances encoded from real-world applications may be very large, which calls for efficient approximate methods, mainly stochastic
Chuan Luo, Shaowei Cai, Wei Wu, Zhong Jie, Kaile Su   +4 more
semanticscholar   +1 more source

Weighted Random k Satisfiability for k=1,2

Applied Soft Computing, 2022
N. E. Zamri, Siti Aishah Azhar, M. Mansor, Alyaa Alway, M. Kasihmuddin   +4 more
semanticscholar   +1 more source

Multi-discrete genetic algorithm in hopfield neural network with weighted random k satisfiability

Neural computing & applications (Print), 2022
N. E. Zamri, Siti Aishah Azhar, Siti Syatirah Muhammad Sidik, M. Mansor, M. Kasihmuddin, Siti Pateema Azeyan Pakruddin, Nurul Atirah Pauzi, Siti Nurhidayah Mat Nawi   +7 more
semanticscholar   +1 more source

Sums of Squares, Satisfiability and Maximum Satisfiability

2005
Recently 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

2006
In 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

Satisfiability modulo theories

Communications of the ACM, 2011
Leonardo Mendonça de Moura, Nikolaj S. Bjørner   +1 more
semanticscholar   +1 more source

Random Satisfiability

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

Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability

IACR Cryptology ePrint Archive, 2017
Jonathan Bootle, Andrea Cerulli, Essam Ghadafi, Jens Groth, Mohammad Hajiabadi, S. K. Jakobsen   +5 more
semanticscholar   +1 more source