pun Source code View original

Jump to content

Category:Satisfiability problems

From Wikipedia, the free encyclopedia

Wikimedia Commons has media related to Boolean satisfiability problem.

Subcategories

This category has the following 2 subcategories, out of 2 total.

S

SAT solvers (7 P)
Satisfiability modulo theories solvers (3 P)

Pages in category "Satisfiability problems"

The following 17 pages are in this category, out of 17 total. This list may not reflect recent changes.

♯

♯SAT

0–9

A

Alloy (specification language)

B

Boolean satisfiability problem

C

Conflict-driven clause learning

F

Formula game

H

Horn-satisfiability

M

N

Not-all-equal 3-satisfiability

P

Planar SAT

R

Relaxed intersection

S

T

True quantified Boolean formula

X

XOR-SAT

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Satisfiability_problems&oldid=835622903"

Hidden category:

Commons category link is on Wikidata