English Bernays–Schönfinkel class Cited by user Siddharthist on 06 Dec 2023 The Bernays–Schönfinkel class (also known as Bernays–Schönfinkel–Ramsey class) of formulas, named after Paul Bernays, Moses Schönfinkel and Frank P.
English Satisfiability modulo theories Cited by user Siddharthist on 06 Dec 2023 In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.
Japanese TPTP Cited by user 永田裕之 on 25 Jun 2023 TPTP (Thousands of Problems for Theorem Provers) とは自由に利用可能な自動定理証明のための問題集である. これは自動推論アルゴリズムの効率の評価のために使用される.
English E (theorem prover) Cited by user Yendorian on 10 Jun 2023 E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational…