German Parallele Algorithmen für das Erfüllbarkeitsproblem Cited by user Cydhra on 23 Jan 2023 Das Erfüllbarkeitsproblem der Aussagenlogik (SAT, von englisch satisfiability) ist eines der grundlegendsten, schweren Probleme der Informatik.
English Boolean satisfiability problem Cited by user Caleb Stanford on 31 Dec 2021 In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is…
English SAT solver Cited by user Caleb Stanford on 31 Dec 2021 In computer science and formal methods, a SAT solver is a computer program which aims to solve the Boolean satisfiability problem.