On the Complexity of Deduction Modulo Leaf Permutative Equations

Author： Boy de la Tour Thierry   Echenim Mnacho  

Publisher： Springer Publishing Company

ISSN： 0168-7433

Source： Journal of Automated Reasoning, Vol.33, Iss.3-4, 2004-10, pp. : 271-317

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Clausal Presentation of Theories in Deduction Modulo

By Gao Jian-Hua  

Journal of Computer Science and Technology, Vol. 28, Iss. 6, 2013-11 ,pp. : 1085-1096

Springer Publishing Company

Access to resources Recommend Favorite

Normalized Rewriting: an Alternative to Rewriting modulo a Set of Equations

By Marche C.  

Journal of Symbolic Computation, Vol. 21, Iss. 3, 1996-03 ,pp. : 253-288

Academic Press

Access to resources Recommend Favorite

Solving word equations modulo partial commutations

By Diekert V.   Matiyasevich Y.   Muscholl A.  

Theoretical Computer Science, Vol. 224, Iss. 1, 1999-08 ,pp. : 215-235

Elsevier

Access to resources Recommend Favorite

Termination modulo equations by abstract commutation with an application to iteration

By Fokkink W.   Zantema H.  

Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. : 407-423

Elsevier

Access to resources Recommend Favorite

Termination of permutative conversions in intuitionistic Gentzen calculi

By Schwichtenberg H.  

Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. : 247-260

Elsevier

Access to resources Recommend Favorite