Orthologic for SAT Solving

In three linesNew algorithm for formula entailment in orthologic (sound approximation of classical logic) without costly preprocessing phase, O(n²(1+|A|)) worst-case complexity. Synthetic SAT benchmarks via Tseitin encoding: instances hard for SOTA solvers but efficiently solved by orthologic. Orthologic normalization improves solving time on hard problems.

Summary generated by Claude — human-verified