unsatisfiability proofs
Description: Formal proofs in logic and computer science that a formula or constraint system has no satisfying assignment or solution.
Primary topic: Formal Methods in Verification (38%)
OpenAlex ID: keywords/unsatisfiability-proofs
