The Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated as SATISFIABILITY or SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. In other words, it asks whether the variables of a given Boolean formula can be consistently replaced by the values TRUE or FALSE in such a way that the formula evaluates to TRUE. If this is the case, the formula is called satisfiable. SAT techniques can be used to prove or disprove properties: if the negation of a property cannot be satisfied, then the property is valid. If the negation of a property is satisfied by a certain interpretation, then this interpretation is a counterexample of the property.
Share this article
Learn to build a solid safety case for rail control systems using formal verification
Fill out your information here.
More News & Articles
EULYNX standardizes rail signaling interfaces, but not the assurance behind them. Here's how formal methods close that gap, with exhaustive proof, generated test suites, and verified wrappers.
AI makes formal verification more important, not less. See why AI-assisted engineering needs mathematical proof, not just testing, to stay safety-critical.
Validate signaling data before supplier handover. Learn how Infrastructure Managers can reduce ERTMS project delays, rework, and integration risks with Data Readiness.
