- Applied mathematics
- >
- Computational mathematics
- >
- Automated theorem proving
- >
- Unification (computer science)

- Applied mathematics
- >
- Theoretical computer science
- >
- Logic in computer science
- >
- Unification (computer science)

- Applied mathematics
- >
- Theoretical computer science
- >
- Rewriting systems
- >
- Unification (computer science)

- Fields of mathematics
- >
- Computational mathematics
- >
- Automated theorem proving
- >
- Unification (computer science)

- Fields of mathematics
- >
- Mathematical logic
- >
- Automated theorem proving
- >
- Unification (computer science)

- Fields of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Unification (computer science)

- Logic in computer science
- >
- Automated reasoning
- >
- Automated theorem proving
- >
- Unification (computer science)

- Logic in computer science
- >
- Automated reasoning
- >
- Type inference
- >
- Unification (computer science)

- Logic in computer science
- >
- Logic programming
- >
- Automated theorem proving
- >
- Unification (computer science)

- Logic in computer science
- >
- Type theory
- >
- Type inference
- >
- Unification (computer science)

- Logical consequence
- >
- Inference
- >
- Type inference
- >
- Unification (computer science)

- Mathematical logic
- >
- Logic in computer science
- >
- Automated theorem proving
- >
- Unification (computer science)

- Mathematical logic
- >
- Logic in computer science
- >
- Logic programming
- >
- Unification (computer science)

- Mathematical logic
- >
- Type theory
- >
- Type inference
- >
- Unification (computer science)

- Mathematical structures
- >
- Type theory
- >
- Type inference
- >
- Unification (computer science)

- Mathematics
- >
- Mathematical proofs
- >
- Automated theorem proving
- >
- Unification (computer science)

- Mathematics of computing
- >
- Formal methods
- >
- Automated theorem proving
- >
- Unification (computer science)

- Mathematics of computing
- >
- Logic in computer science
- >
- Automated theorem proving
- >
- Unification (computer science)

- Mathematics of computing
- >
- Logic in computer science
- >
- Logic programming
- >
- Unification (computer science)

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Automated theorem proving
- >
- Unification (computer science)

- Philosophy of mathematics
- >
- Mathematical logic
- >
- Logic in computer science
- >
- Unification (computer science)

- Program analysis
- >
- Static program analysis
- >
- Type inference
- >
- Unification (computer science)

- Theorems
- >
- Mathematical proofs
- >
- Automated theorem proving
- >
- Unification (computer science)

- Theoretical computer science
- >
- Formal methods
- >
- Automated theorem proving
- >
- Unification (computer science)

- Theoretical computer science
- >
- Logic in computer science
- >
- Automated theorem proving
- >
- Unification (computer science)

- Theoretical computer science
- >
- Logic in computer science
- >
- Logic programming
- >
- Unification (computer science)

- Theoretical computer science
- >
- Mathematics of computing
- >
- Logic in computer science
- >
- Unification (computer science)

- Type theory
- >
- Type systems
- >
- Type inference
- >
- Unification (computer science)

Dis-unification (computer science)

Dis-unification, in computer science and logic, is an algorithmic process of solving inequations between symbolic expressions.

Unification (computer science)

In logic and computer science, unification is an algorithmic process of solving equations between symbolic expressions. Depending on which expressions (also called terms) are allowed to occur in an eq

Equation solving

In mathematics, to solve an equation is to find its solutions, which are the values (numbers, functions, sets, etc.) that fulfill the condition stated by the equation, consisting generally of two expr

Anti-unification (computer science)

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

Occurs check

In computer science, the occurs check is a part of algorithms for syntactic unification. It causes unification of a variable V and a structure S to fail if S contains V.

Subsumption lattice

A subsumption lattice is a mathematical structure used in the theoretical background of automated theorem proving and other symbolic computation applications.

Term algebra

In universal algebra and mathematical logic, a term algebra is a freely generated algebraic structure over a given signature. For example, in a signature consisting of a single binary operation, the t

© 2023 Useful Links.