an:02069028
Zbl 1049.03011
Dowek, Gilles; Hardin, Th??r??se; Kirchner, Claude
Theorem proving modulo
EN
J. Autom. Reasoning 31, No. 1, 33-72 (2003).
00099646
2003
j
03B35 03F05
automated theorem proving; term rewriting; resolution; narrowing; higher-order logic; cut elimination; deduction modulo; sequent calculus modulo; Skolemization; combinators
The authors argue that theorem proving can be divided into a computation part and a deduction part.
Deduction modulo is a method to remove the computational arguments from proofs.
A proof search method is presented based on extended narrowing and resolution which is sound and complete with respect to the sequent calculus modulo, for a large class of congruences.
Uwe Sch??ning (Ulm)