「satisfiability」の共起表現(1語右で並び替え)

As with Skolemization which only preserves satisfiability, Herbrandization being Skolemization's dua

ll sentences as being true is known as the satisfiability modulo theories problem.

In practice, satisfiability of the constraint store may be checked usi

It has been proved that the satisfiability of an arbitrary set of DEA is in the compl

ktracking-based algorithm for deciding the satisfiability of propositional logic formulae in conjunc

rithm for solving instances of the Boolean satisfiability problem in programming.

The partial maximum satisfiability problem (PMAX-SAT) asks for the maximum nu

The boolean satisfiability problem can be viewed as the special case

n the well-known conference on the boolean satisfiability problem and related problems, the SAT Conf

as done in the past for the pseudo-boolean satisfiability problem and the quantified boolean formula

a function problem related to the Boolean satisfiability problem, is the problem of counting the nu

the optimization extensions of the boolean satisfiability problem, which is the problem of determini

Conjunctive Normal Form Satisfiability: SAT solvers returns an assignment to the

aved the way for Binary decision diagrams, Satisfiability solvers, and many other techniques relevan

rithm is a refinement of the propositional satisfiability step of the Davis-Putnam procedure, that r

「satisfiability」の共起表現一覧(1語右で並び替え)