• Home
  • Random
  • Nearby
  • Log in
  • Settings
Donate Now If Wikipedia is useful to you, please give today.
  • About Wikipedia
  • Disclaimers
Wikipedia

Category:Satisfiability problems

  • Category
  • Talk
  • Language
  • Watch
  • Edit
Wikimedia Commons logo
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

  • 1-in-3-SAT
  • 2-satisfiability

A

  • Alloy (specification language)

B

  • Boolean satisfiability problem

C

  • Conflict-driven clause learning

F

  • Formula game

H

  • Horn-satisfiability

M

  • MAX-3SAT
  • Maximum satisfiability problem

N

  • Not-all-equal 3-satisfiability

P

  • Planar SAT

R

  • Relaxed intersection

S

  • SAT solver
  • Satisfiability modulo theories

T

  • True quantified Boolean formula

X

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