|
Planar SAT
In computer science, the planar 3-satisfiability problem (abbreviated PLANAR 3SAT or PL3SAT) is an extension of the classical Boolean satisfiability problem#3-satisfiability, Boolean 3-satisfiability problem to a planar graph, planar incidence graph. In other words, it asks whether the variables of a given Boolean formula—whose incidence graph consisting of variables and clauses can be graph embedding, embedded on a plane (geometry), plane—can be consistently replaced by the values TRUE or FALSE in such a way that the formula Validity (logic), evaluates to TRUE. If this is the case, the formula is called ''Satisfiability, satisfiable''. On the other hand, if no such assignment exists, the function expressed by the formula is Contradiction#Contradiction in formal logic, FALSE for all possible variable assignments and the formula is ''unsatisfiable''. For example, the formula "''a'' AND NOT ''b''" is satisfiable because one can find the values ''a'' = TRUE and ''b''&n ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar SAT Example
Planar is an adjective meaning "relating to a plane (geometry)". Planar may also refer to: Science and technology * Planar (computer graphics), computer graphics pixel information from several bitplanes * Planar (transmission line technologies), transmission lines with flat conductors * Planar, the structure resulting from the planar process used in the manufacture of semiconductor devices, such as planar transistors * Planar graph, graph that can be drawn in the plane so that no edges cross * Planar mechanism, a system of parts whose motion is constrained to a two-dimensional plane * Planar Systems, an Oregon-headquartered manufacturer of digital displays * Zeiss Planar, photographic lens designed by Paul Rudolph at Carl Zeiss in 1896 See also * List of planar symmetry groups * Planarity, a computer puzzle game * Plane (other) * Planer (other) * {{disambiguation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
