Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

RTA
1987
Springer

favoriteEmaildiscussreport

101views Theoretical Computer Science» more RTA 1987»

Completion for Rewriting Modulo a Congruence

13 years 8 months ago

Completion for Rewriting Modulo a Congruence

Download www.cs.tau.ac.il

We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our methods as equational inference systems and describe techniques for reasoning about such systems.

Leo Bachmair, Nachum Dershowitz

Real-time Traffic

Completion Methods | Equational Inference Systems | Generalizing | RTA 1987 | Theoretical Computer Science |

claim paper

Related Content

» Regaining cut admissibility in deduction modulo using abstract completion

» Cut Elimination in Deduction Modulo by Abstract Completion

» TaMeD A Tableau Method for Deduction Modulo

» Efficiently Simulating HigherOrder Arithmetic by a FirstOrder Theory Modulo

» A critical pair criterion for completion modulo a congruence

» Proof Normalization Modulo

» Formally Optimal Boxing

» Modular ChurchRosser Modulo The Complete Picture

» Arithmetic as a Theory Modulo

Post Info
More Details (n/a)

Added	28 Aug 2010
Updated	28 Aug 2010
Type	Conference
Year	1987
Where	RTA
Authors	Leo Bachmair, Nachum Dershowitz

Comments (0)