|
The DLS algorithm is a quantifier elimination algorithm
which takes an arbitrary second-order logic formula and
tries to reduce
it to an
equivalent first-order
formula. The algorithm is based on a generalization of
Ackermann's Lemma, and has applications in a number of
areas, in particular,
the reduction of circumscription axioms.
Use
DLS >
|