Sciweavers

5 search results - page 1 / 1
» A critical pair criterion for completion modulo a congruence
Sort
View
LFCS
2007
Springer
14 years 1 months ago
Cut Elimination in Deduction Modulo by Abstract Completion
act Completion (Full Version) Guillaume Burel Claude Kirchner August 6, 2007 Deduction Modulo implements Poincar´e’s principle by identifying deduction and computation as diff...
Guillaume Burel, Claude Kirchner
IANDC
2010
141views more  IANDC 2010»
13 years 6 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner
RTA
2010
Springer
13 years 11 months ago
Computing Critical Pairs in 2-Dimensional Rewriting Systems
Rewriting systems on words are very useful in the study of monoids. In good cases, they give finite presentations of the monoids, allowing their manipulation by a computer. Even b...
Samuel Mimram
KBSE
2000
IEEE
13 years 11 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula