AAAAAA

   
Results: 1-7 |
Results: 7
COMPLETION OF REWRITE SYSTEMS WITH MEMBERSHIP CONSTRAINTS PART 1 - DEDUCTION RULES
Authors: COMON H
Citation: H. Comon, COMPLETION OF REWRITE SYSTEMS WITH MEMBERSHIP CONSTRAINTS PART 1 - DEDUCTION RULES, Journal of symbolic computation, 25(4), 1998, pp. 397-419
COMPLETION OF REWRITE SYSTEMS WITH MEMBERSHIP CONSTRAINTS PART II - CONSTRAINT SOLVING
Authors: COMON H
Citation: H. Comon, COMPLETION OF REWRITE SYSTEMS WITH MEMBERSHIP CONSTRAINTS PART II - CONSTRAINT SOLVING, Journal of symbolic computation, 25(4), 1998, pp. 421-453
THE FIRST-ORDER THEORY OF LEXICOGRAPHIC PATH ORDERINGS IS UNDECIDABLE
Authors: COMON H TREINEN R
Citation: H. Comon et R. Treinen, THE FIRST-ORDER THEORY OF LEXICOGRAPHIC PATH ORDERINGS IS UNDECIDABLE, Theoretical computer science, 176(1-2), 1997, pp. 67-87
ON UNIFICATION OF TERMS WITH INTEGER EXPONENTS
Authors: COMON H
Citation: H. Comon, ON UNIFICATION OF TERMS WITH INTEGER EXPONENTS, Mathematical systems theory, 28(1), 1995, pp. 67-88
EQUATIONAL FORMULAS WITH MEMBERSHIP CONSTRAINTS
Authors: COMON H DELOR C
Citation: H. Comon et C. Delor, EQUATIONAL FORMULAS WITH MEMBERSHIP CONSTRAINTS, Information and computation, 112(2), 1994, pp. 167-216
SYNTACTICNESS, CYCLE-SYNTACTICNESS, AND SHALLOW THEORIES
Authors: COMON H HABERSTRAU M JOUANNAUD JP
Citation: H. Comon et al., SYNTACTICNESS, CYCLE-SYNTACTICNESS, AND SHALLOW THEORIES, Information and computation, 111(1), 1994, pp. 154-191
COMPLETE AXIOMATIZATIONS OF SOME QUOTIENT TERM ALGEBRAS
Authors: COMON H
Citation: H. Comon, COMPLETE AXIOMATIZATIONS OF SOME QUOTIENT TERM ALGEBRAS, Theoretical computer science, 118(2), 1993, pp. 167-191
Risultati: 1-7 |