Boolean satisfiability problem
GPTKB entity
Statements (140)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
gptkb:software theoretical computer science |
| gptkbp:abbreviation |
gptkb:SAT
|
| gptkbp:alternativeName |
SAT_solver
constraint_satisfaction_problem satisfiability_problem |
| gptkbp:application |
gptkb:artificial_intelligence
planning automated theorem proving resource allocation circuit design scheduling puzzle solving software verification |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
the problem of determining if there exists an interpretation that satisfies a given Boolean formula
|
| gptkbp:describedBy |
gptkb:Cook–Levin_theorem
|
| gptkbp:example |
gptkb:puzzle
gptkb:CaDiCaL gptkb:CryptoMiniSat gptkb:Lingeling gptkb:MapleSAT gptkb:MiniSat gptkb:Z3 gptkb:n-queens_problem Glucose sudoku map coloring |
| gptkbp:field |
gptkb:artificial_intelligence
gptkb:complexity_theory gptkb:logic computer science operations research theoretical computer science |
| gptkbp:firstNPCompleteProblem |
true
|
| gptkbp:format |
gptkb:conjunctive_normal_form
|
| gptkbp:generalizes |
gptkb:boolean_satisfiability_problem
gptkb:3-SAT gptkb:2-SAT |
| gptkbp:hasApplication |
gptkb:artificial_intelligence
cryptography planning automated theorem proving circuit design model checking software verification hardware verification constraint satisfaction |
| gptkbp:hasComponent |
variables
local search variable selection domains symmetry breaking constraints unit propagation preprocessing randomization variable elimination backjumping blocked clause elimination clause database management clause learning clause minimization conflict-driven clause learning decision heuristics equivalence reasoning incremental solving inprocessing non-chronological backtracking parallel solving portfolio solving proof logging restart strategies subsumption elimination watched literals |
| gptkbp:hasSpecialCase |
gptkb:3-SAT
gptkb:2-SAT gptkb:Horn-SAT gptkb:Max-SAT gptkb:Not-All-Equal_SAT gptkb:Partial_SAT gptkb:Planar_SAT gptkb:Quantified_SAT gptkb:Random_SAT gptkb:Unique-SAT gptkb:Weighted_SAT gptkb:XOR-SAT SAT with BDD encoding SAT with CNF encoding SAT with DNF encoding SAT with Schaefer's dichotomy SAT with Tseitin transformation SAT with XOR constraints SAT with at-least-one constraints SAT with at-most-one constraints SAT with cardinality constraints SAT with cardinality networks SAT with exactly-one constraints SAT with pseudo-Boolean constraints SAT with symmetry breaking SAT-UNSAT transition |
| gptkbp:hasType |
distributed CSP
dynamic CSP finite domain CSP infinite domain CSP soft CSP weighted CSP |
| gptkbp:introduced |
gptkb:Stephen_Cook
|
| gptkbp:introducedIn |
1971
|
| gptkbp:output |
satisfiable
unsatisfiable |
| gptkbp:relatedConcept |
mathematical optimization
Boolean satisfiability problem |
| gptkbp:relatedTo |
gptkb:logic
gptkb:CDCL_algorithm gptkb:3-SAT gptkb:Cook–Levin_theorem gptkb:P_versus_NP_problem gptkb:conjunctive_normal_form gptkb:DPLL_algorithm gptkb:k-SAT NP-complete Boolean satisfiability problem Horn-satisfiability resolution proof system |
| gptkbp:solvedBy |
backtracking
local search Boolean satisfiability problem constraint propagation |
| gptkbp:studiedBy |
gptkb:Stephen_Cook
gptkb:Leonid_Levin |
| gptkbp:studiedIn |
constraint programming
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
automated theorem proving formal verification model checking constraint satisfaction |
| gptkbp:bfsParent |
gptkb:NP-completeness
|
| gptkbp:bfsLayer |
5
|