Chaff algorithm, the Glossary

Table of Contents

1. 7 relations: Algorithm, Boolean satisfiability problem, Download, DPLL algorithm, Linux, Microsoft Research, Princeton University.

2. Automated theorem proving
3. Formal methods stubs
4. SAT solvers

Algorithm

In mathematics and computer science, an algorithm is a finite sequence of mathematically rigorous instructions, typically used to solve a class of specific problems or to perform a computation.

See Chaff algorithm and Algorithm

Boolean satisfiability problem

In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) is the problem of determining if there exists an interpretation that satisfies a given Boolean formula. Chaff algorithm and Boolean satisfiability problem are Boolean algebra.

See Chaff algorithm and Boolean satisfiability problem

Download

In computer networks, download means to receive data from a remote system, typically a server such as a web server, an FTP server, an email server, or other similar systems.

See Chaff algorithm and Download

DPLL algorithm

In logic and computer science, the Davis–Putnam–Logemann–Loveland (DPLL) algorithm is a complete, backtracking-based search algorithm for deciding the satisfiability of propositional logic formulae in conjunctive normal form, i.e. for solving the CNF-SAT problem. Chaff algorithm and DPLL algorithm are Automated theorem proving, Constraint programming and SAT solvers.

See Chaff algorithm and DPLL algorithm

Linux

Linux is both an open-source Unix-like kernel and a generic name for a family of open-source Unix-like operating systems based on the Linux kernel, an operating system kernel first released on September 17, 1991, by Linus Torvalds.

See Chaff algorithm and Linux

Microsoft Research

Microsoft Research (MSR) is the research subsidiary of Microsoft.

See Chaff algorithm and Microsoft Research

Princeton University

Princeton University is a private Ivy League research university in Princeton, New Jersey.

See Chaff algorithm and Princeton University

See also

Automated theorem proving

• Anti-unification
• Automated reasoning
• Automated theorem proving
• Axiomatic system (logic)
• Burrows–Abadi–Needham logic
• Chaff algorithm
• Computer-assisted proof
• Concolic testing
• DPLL algorithm
• DPLL(T)
• Davis–Putnam algorithm
• F* (programming language)
• Fresh variable
• Geoff Sutcliffe
• Geometry Expert
• Harald Ganzinger
• Hilbert system
• Interactive Theorem Proving (conference)
• IsaPlanner
• LowerUnits
• Method of analytic tableaux
• Model elimination
• Non-surveyable proof
• Nuprl
• Occurs check
• POPLmark challenge
• Proof (truth)
• Proof assistant
• Proof complexity
• Propositional proof system
• Reasoning system
• Resolution (logic)
• Rippling
• Sequent calculus
• Substitution (logic)
• System on TPTP
• Thousands of Problems for Theorem Provers
• Unification (computer science)
• Unit propagation
• WalkSAT

Formal methods stubs

• Apomorphism
• Automath
• Axiomatic semantics
• Boolean grammar
• Chaff algorithm
• David Watt (computer scientist)
• Duration calculus
• Formal Methods Europe
• Implication table
• International Conference on Software Engineering and Formal Methods
• Interval temporal logic
• Liquid Haskell
• Logical relations
• Modal clausal form
• PRISM model checker
• Paramorphism
• Permutation automaton
• Picture language
• Predicative programming
• Programming Research Group
• Refinement calculus
• Romeo Model Checker
• TAPAAL Model Checker
• Temporal logic of actions
• Term graph
• Terminal yield
• Trace theory
• Uninterpreted function
• Uppaal Model Checker

SAT solvers

• Chaff algorithm
• Conflict-driven clause learning
• DPLL algorithm
• DPLL(T)
• GRASP (SAT solver)
• Satz (SAT solver)
• WalkSAT

References

[1] https://en.wikipedia.org/wiki/Chaff_algorithm

Also known as ZChaff.