Results 191 to 200 of about 18,245 (221)

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.
Jakub Michaliszyn, Jan Otop, Piotr Witkowski 0001   +2 more
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

Stochastic Boolean Satisfiability

Journal of Automated Reasoning, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael L. Littman, Stephen M. Majercik, Toniann Pitassi   +2 more
openaire   +2 more sources

Satisfiability with Index Dependency

Journal of Computer Science and Technology, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongyu Liang, Jing He 0009
openaire   +3 more sources

Efficient Temporal Satisfiability

Journal of Logic and Computation, 1992
The complexity of testing satisfiability of almost all extant propositional logics of programs is \(NP\)-hard, because these logics subsume ordinary propositional logic. If the conjecture \(P\neq NP\) is true, it seems likely that the best deterministic decision procedure we could hope for is of exponential time complexity. This interesting paper gives
E. Allen Emerson, Tom Sadler, Jai Srinivasan   +2 more
openaire   +2 more sources

On the Approximation of Maximum Satisfiability

Journal of Algorithms, 1994
Summary: We present a 3/4 polynomial time approximation algorithm for the maximum satisfiability problem: Given a set of clauses, find a truth assignment that satisfies the maximum number of clauses. The algorithm applies to the weighted case as well, and involves nontrivial application of network flow techniques.
openaire   +3 more sources

Hypergraph satisfiability

Reports Math. Log., 1991
Summary: A notion of satisfiability is defined for collections of vertex sets of a hypergraph and a method for determining satisfiability, called resolution, is introduced. An important special case is the resolution technique for determining satisfiability of a set of clauses in propositional logic.
openaire   +2 more sources

Satisfying customers

2014
.
openaire   +2 more sources

Are They Satisfied?

Journal of the American Society of Echocardiography, 2007
openaire   +2 more sources

A GRASP for satisfiability

1996
Mauricio G. C. Resende, Thomas A. Feo
openaire   +2 more sources