.png){kind=icon}
Return
When Satisfiability Solving Meets Symbolic Computation
.png){kind=icon}
PRE
AI
DOI：10.1145/3500921.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
MATHEMATICIANS HAVE LONG been fascinated by objects that exhibit exceptionally nice combinatorial properties. However, it is often difficult to determine whether objects satisfying a given combinatorial property exist. Sometimes, the only feasible method of definitively answering the question of existence is simply to perform a systematic search. A famous example of this is the proof of the four-color theorem-the notion that four colors suffice to color the regions of a planar map with adjacent regions colored differently.3 The theorem has been known to be true since 1977, but every known proof relies on computer calculations in an essential way. Mathematical arguments are used to reduce the search for counterexamples to a finite number of cases, and the cases are then
Keywords:
PROJECTIVE PLANE
SAT
SEQUENCES
SEARCH
Journal
IF:
12.2
Papers:
1.2W
Citations:
3.7W
Organization
Cited Papers
ShareSaveKinetics of the isomerization of 1-chloro- and 2-chloropentaborane(9) using diethyl ether catalyst
PREAI
ShareSaveEnhanced photocatalytic activity of FeSO4 in a ZnO photocatalyst with H2O2 for dye degradation.png)
Optik
OptikIF0
PREAI
ShareSaveAdsorption kinetic studies of activated carbon fabric for the removal of volatile organic components
PREAI
ShareSaveImprovement of roasting and metallurgical properties of fluorine-bearing iron concentrate pellets
PREAI
ShareSaveMapping landscape connectivity as a driver of species richness under tectonic and climatic forcing
OAAI
OAAIShareSaveShareSave
View more