Automated theorem proving

sufficient evidence or a sufficient argument for the truth of a proposition

algorithmic process of solving equations between symbolic expressions

subfield of computer science and logic

subfield of automated reasoning dealing with proving theorems by computer programs

in logic, rule of inference

algorithm for solving the CNF-SAT problem

style of formal logical argumentation

algorithm for check the validity of a logic formula

software tool to assist with the development of formal proofs by human-machine collaboration

mathematical proof at least partially generated by computer

fundamental concept in automated theorem proving

functional programming language inspired by ML and aimed at program verification

system of formal deduction in logic

Anti-unification is the process of constructing a generalization common to two given symbolic expressions. As in unification, several frameworks are distinguished depending on which expressions (also called terms) are allowed, and which expressions are considered equal. If variables representing functions are allowed in an expression, the process is called "higher-order anti-unification", otherwise "first-order anti-unification". If the generalization is required to have an instance literally equal to each input expression, the process is called "syntactical anti-unification", otherwise "E-ant

set of rules for defining and analyzing information exchange protocols

concept in logic; syntactic transformation on formal expressions

German computer scientist (1950-2004)

procedure of automated theorem proving