Le informazioni sugli articoli di fonte ISI sono coperte da copyright

Per ulteriori informazioni selezionare i riferimenti di interesse.

1. Baader, F; Narendran, P
   Unification of concept terms in description logics
   JOURNAL OF SYMBOLIC COMPUTATION
   
   F. Baader e P. Narendran, "Unification of concept terms in description logics", J SYMB COMP, 31(3), 2001, pp. 277-305
2. Guo, Q; Narendran, P; Wolfram, DA
   Complexity of nilpotent unification and matching problems
   INFORMATION AND COMPUTATION
   
   Q. Guo et al., "Complexity of nilpotent unification and matching problems", INF COMPUT, 162(1-2), 2000, pp. 3-23
3. Degtyarev, A; Gurevich, Y; Narendran, P; Veanes, M; Voronkov, A
   Decidability and complexity of simultaneous rigid E-unification with one variable and related results
   THEORETICAL COMPUTER SCIENCE
   
   A. Degtyarev et al., "Decidability and complexity of simultaneous rigid E-unification with one variable and related results", THEOR COMP, 243(1-2), 2000, pp. 167-184
4. Peakman, M; Stevens, EJ; Lohmann, T; Narendran, P; Dromey, J; Alexander, A; Tomlinson, AJ; Trucco, M; Gorga, JC; Chicz, RM
   Naturally processed and presented epitopes of the islet cell autoantigen IA-2 eluted from HLA-DR4
   JOURNAL OF CLINICAL INVESTIGATION
   
   M. Peakman et al., "Naturally processed and presented epitopes of the islet cell autoantigen IA-2 eluted from HLA-DR4", J CLIN INV, 104(10), 1999, pp. 1449-1457
5. Narendran, P; Gale, EAM; Dayan, CM
   Immunotherapy and prevention of autoimmune endocrinopathies
   AUTOIMMUNE ENDOCRINOPATHIES
   
   P. Narendran et al., "Immunotherapy and prevention of autoimmune endocrinopathies", CONT ENDOC, 15, 1999, pp. 393-417
6. OTTO F; NARENDRAN P; DOUGHERTY DJ
   EQUATIONAL UNIFICATION, WORD UNIFICATION, AND 2ND-ORDER EQUATIONAL UNIFICATION
   Theoretical computer science
   
   F. Otto et al., "EQUATIONAL UNIFICATION, WORD UNIFICATION, AND 2ND-ORDER EQUATIONAL UNIFICATION", Theoretical computer science, 198(1-2), 1998, pp. 1-47
7. P.Narendran; F.Otto
   Single Versus Simultaneous Equational Unification and Equational unification for Variable-Permuting Theories
   Journal of automated reasoning
   
   P.narendran e F.otto, "Single Versus Simultaneous Equational Unification and Equational unification for Variable-Permuting Theories", Journal of automated reasoning, 19(1), 1997, pp. 87-115
8. NARENDRAN P; PFENNING F; STATMAN R
   ON THE UNIFICATION PROBLEM FOR CARTESIAN CLOSED CATEGORIES
   The Journal of symbolic logic
   
   P. Narendran et al., "ON THE UNIFICATION PROBLEM FOR CARTESIAN CLOSED CATEGORIES", The Journal of symbolic logic, 62(2), 1997, pp. 636-647
9. P.Narendran; M.Rusinowitch
   Any Ground Associative-Commutative Theory has a Finite Canonical System
   Journal of automated reasoning
   
   P.narendran e M.rusinowitch, "Any Ground Associative-Commutative Theory has a Finite Canonical System", Journal of automated reasoning, 17(1), 1996, pp. 131-143
10. OTTO F; NARENDRAN P
    CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS
    Theoretical computer science
    
    F. Otto e P. Narendran, "CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS", Theoretical computer science, 134(1), 1994, pp. 175-188
11. OTTO F; NARENDRAN P
    CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS
    Theoretical computer science
    
    F. Otto e P. Narendran, "CODES MODULO FINITE MONADIC STRING-REWRITING SYSTEMS", Theoretical computer science, 134(1), 1994, pp. 175-188
12. MADLENER K; NARENDRAN P; OTTO F; ZHANG L
    ON WEAKLY CONFLUENT MONADIC STRING-REWRITING SYSTEMS
    Theoretical computer science
    
    K. Madlener et al., "ON WEAKLY CONFLUENT MONADIC STRING-REWRITING SYSTEMS", Theoretical computer science, 113(1), 1993, pp. 119-165
13. D.Kapur; P.Narendran
    Complexity of Unification Problems with Associative-Communicative Operators
    Journal of automated reasoning
    
    D.kapur e P.narendran, "Complexity of Unification Problems with Associative-Communicative Operators", Journal of automated reasoning, 9(2), 1992, pp. 261-288