Publications
Search

Publications :: Search

Show author

On this page you see the details of the selected author.

    Author information
    First name: Paliath
    Last name: Narendran
    DBLP: n/PaliathNarendran
    Rating: (not rated yet)
    Bookmark:

    Below you find the publications which have been written by this author.

    Show item 1 to 100 of 104  
    Select a publication
    Show Title Venue Rating Date
    Journal article
    Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch.
    Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining.
    Logical Methods in Computer Science 2014, Volume 10 (0) 2014
    Conference paper
    Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Catherine Meadows, Paliath Narendran, Christophe Ringeissen.
    On Asymmetric Unification and the Combination Problem in Disjoint Theories.
    Foundations of Software Science and Computation Structures - 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014, Proceedings 2014 (0) 2014
    Conference paper
    Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen.
    Hierarchical Combination.
    Automated Deduction - CADE-24 - 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse.
    Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis.
    Automated Deduction - CADE-24 - 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Christopher Bouchard, Kimberly A. Gero, Christopher Lynch, Paliath Narendran.
    On Forward Closure and the Finite Variant Property.
    Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings 2013 (0) 2013
    Conference paper
    Shreyaben Brahmakshatriya, Sushma Danturi, Kimberly A. Gero, Paliath Narendran.
    Unication Problems Modulo a Theory of Until.
    27th International Workshop on Unification, UNIF 2013, Eindhoven, Netherlands, June 26, 2013 2013 (0) 2013
    Conference paper
    Serdar Erbatur, Deepak Kapur, Andrew M. Marshall, Paliath Narendran, Christophe Ringeissen.
    Hierarchical Combination of Unication Algorithms (Extended Abstract).
    27th International Workshop on Unification, UNIF 2013, Eindhoven, Netherlands, June 26, 2013 2013 (0) 2013
    Conference paper
    Siva Anantharaman, Hai Lin 0005, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo Homomorphic Encryption.
    J. Autom. Reasoning 2012, Volume 48 (0) 2012
    Conference paper
    Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo Chaining.
    Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo Synchronous Distributivity.
    Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Andrew M. Marshall, Paliath Narendran.
    New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants.
    Automated Reasoning - 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Serdar Erbatur, Santiago Escobar, Deepak Kapur, Zhiqiang Liu, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Sonia Santiago, Ralf Sasse.
    Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions.
    Computer Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy, September 10-12, 2012. Proceedings 2012 (0) 2012
    Conference paper
    Kimberly A. Gero, Christopher Bouchard, Paliath Narendran.
    Some Notes on Basic Syntactic Mutation.
    UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, Manchester, UK, July 1, 2012 2014 (0) 2012
    Conference paper
    Serdar Erbatur, Santiago Escobar, Paliath Narendran.
    The use of types in designing unification algorithms: two case studies.
    UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, Manchester, UK, July 1, 2012 2014 (0) 2012
    Conference paper
    Santiago Escobar, Deepak Kapur, Christopher Lynch, Catherine Meadows, José Meseguer, Paliath Narendran, Ralf Sasse.
    Protocol analysis in Maude-NPA using unification modulo homomorphic encryption.
    Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 20-22, 2011, Odense, Denmark 2011 (0) 2011
    Journal article
    Serdar Erbatur, Andrew M. Marshall, Deepak Kapur, Paliath Narendran.
    Unification over Distributive Exponentiation (Sub)Theories.
    Journal of Automata, Languages and Combinatorics 2011, Volume 16 (0) 2011
    Journal article
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    String Rewriting and Security Analysis: An Extension of a Result of Book and Otto.
    Journal of Automata, Languages and Combinatorics 2011, Volume 16 (0) 2011
    Journal article
    Deepak Kapur, Andrew Marshall, Paliath Narendran.
    Unification modulo a partial theory of exponentiation
    CoRR 2010, Volume 0 (0) 2010
    Journal article
    Paliath Narendran, Andrew Marshall, Bibhu Mahapatra.
    On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
    CoRR 2010, Volume 0 (0) 2010
    Conference paper
    Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch.
    Cap unification: application to protocol security modulo homomorphic encryption.
    Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, ASIACCS 2010, Beijing, China, April 13-16, 2010 2010 (0) 2010
    Conference paper
    Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo Homomorphic Encryption.
    Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, September 16-18, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Benjamin Carle, Paliath Narendran.
    On Extended Regular Expressions.
    Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009. Proceedings 2009 (0) 2009
    Conference paper
    Thierry Boy de la Tour, Mnacho Echenim, Paliath Narendran.
    Unification and Matching Modulo Leaf-Permutative Equational Presentations.
    Automated Reasoning, 4th International Joint Conference, IJCAR 2008, Sydney, Australia, August 12-15, 2008, Proceedings 2008 (0) 2008
    Conference paper
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    Intruders with Caps.
    Term Rewriting and Applications, 18th International Conference, RTA 2007, Paris, France, June 26-28, 2007, Proceedings 2007 (0) 2007
    Conference paper
    Deepak Kapur, Paliath Narendran, Lida Wang.
    A Unification Algorithm for Analysis of Protocols with Blinded Signatures.
    Mechanizing Mathematical Reasoning, Essays in Honor of Jörg H. Siekmann on the Occasion of His 60th Birthday 2005 (0) 2005
    Conference paper
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    Closure properties and decision problems of dag automata.
    Inf. Process. Lett. 2005, Volume 94 (0) 2005
    Conference paper
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo
    J. Autom. Reasoning 2004, Volume 33 (0) 2004
    Conference paper
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    Unification Modulo ACU I Plus Homomorphisms/Distributivity.
    Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch.
    ACID-Unification Is NEXPTIME-Decidable.
    Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Deepak Kapur, Paliath Narendran, Lida Wang.
    An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.
    Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings 2003 (0) 2003
    Conference paper
    Hubert Comon-Lundh, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch.
    Deciding the confluence of ordered term rewrite systems.
    ACM Trans. Comput. Log. 2003, Volume 4 (0) 2003
    Conference paper
    Paliath Narendran, Michaël Rusinowitch.
    Guest Editorial.
    Inf. Comput. 2002, Volume 178 (0) 2002
    Conference paper
    Franz Baader, Paliath Narendran.
    Unification of Concept Terms in Description Logics.
    J. Symb. Comput. 2001, Volume 31 (0) 2001
    Conference paper
    Paliath Narendran, Michaël Rusinowitch.
    The Theory of Total Unary RPO Is Decidable.
    Computational Logic - CL 2000, First International Conference, London, UK, 24-28 July, 2000, Proceedings 2000 (0) 2000
    Conference paper
    Qing Guo, Paliath Narendran, David A. Wolfram.
    Complexity of Nilpotent Unification and Matching Problems.
    Inf. Comput. 2000, Volume 162 (0) 2000
    Conference paper
    Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov.
    Decidability and complexity of simultaneous rigid E-unification with one variable and related results.
    Theor. Comput. Sci. 2000, Volume 243 (0) 2000
    Journal article
    Paliath Narendran.
    Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages).
    SIGACT News 2000, Volume 31 (0) 2000
    Conference paper
    Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma.
    RPO Constraint Solving Is in NP.
    Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings 1999 (0) 1998
    Conference paper
    Franz Baader, Paliath Narendran.
    Unification of Concept Terms in Description Logics.
    ECAI 1998 (0) 1998
    Conference paper
    Hubert Comon-Lundh, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch.
    Decision Problems in Ordered Rewriting.
    LICS 1998 (0) 1998
    Conference paper
    Anatoli Degtyarev, Yuri Gurevich, Paliath Narendran, Margus Veanes, Andrei Voronkov.
    The Decidability of Simultaneous Rigid
    Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings 1998 (0) 1998
    Conference paper
    Qing Guo, Paliath Narendran, Sandeep K. Shukla.
    Unification and Matching in Process Algebras.
    Rewriting Techniques and Applications, 9th International Conference, RTA-98, Tsukuba, Japan, March 30 - April 1, 1998, Proceedings 1998 (0) 1998
    Conference paper
    Friedrich Otto, Paliath Narendran, Daniel J. Dougherty.
    Equational Unification, Word Unification, and 2nd-Order Equational Unification.
    Theor. Comput. Sci. 1998, Volume 198 (0) 1998
    Conference paper
    Franz Baader, Paliath Narendran.
    Unification of Concept Terms in Description Logics.
    Proceedings of the 1997 International Workshop on Description Logics, Université Paris-Sud, Centre d'Orsay, Laboratoire de Recherche en Informatique LRI 1997 (0) 1997
    Conference paper
    Paliath Narendran, Friedrich Otto.
    The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.
    Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings 1997 (0) 1997
    Conference paper
    Paliath Narendran, Friedrich Otto.
    Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.
    J. Autom. Reasoning 1997, Volume 19 (0) 1997
    Conference paper
    Paliath Narendran, Frank Pfenning, Richard Statman.
    On the Unification Problem for Cartesian Closed Categories.
    J. Symb. Log. 1997, Volume 62 (0) 1997
    Conference paper
    Qing Guo, Paliath Narendran, David A. Wolfram.
    Unification and Matching Modulo Nilpotence.
    Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings 1996 (0) 1996
    Conference paper
    Paliath Narendran.
    Solving Linear Equations over Polynomial Semirings.
    LICS 1996 (0) 1996
    Conference paper
    Paliath Narendran.
    Unification Modulo ACI + 1 + 0.
    Fundam. Inform. 1996, Volume 25 (0) 1996
    Conference paper
    Paliath Narendran, Michaël Rusinowitch.
    Any Ground Associative-Commutative Theory Has a Finite Canonical System.
    J. Autom. Reasoning 1996, Volume 17 (0) 1996
    Conference paper
    Seth Chaiken, Paliath Narendran.
    The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation.
    ISCAS 1995 (0) 1995
    Conference paper
    Friedrich Otto, Paliath Narendran, Daniel J. Dougherty.
    Some Independent Results for Equational Unification.
    Rewriting Techniques and Applications, 6th International Conference, RTA-95, Kaiserslautern, Germany, April 5-7, 1995, Proceedings 1995 (0) 1995
    Conference paper
    David Cyrluk, Paliath Narendran.
    Ground Temporal Logic: A Logic for Hardware Verification.
    Computer Aided Verification, 6th International Conference, CAV '94, Stanford, California, USA, June 21-23, 1994, Proceedings 1994 (0) 1994
    Conference paper
    Friedrich Otto, Paliath Narendran.
    Codes Modulo Finite Monadic String-Rewriting Systems.
    Theor. Comput. Sci. 1994, Volume 134 (0) 1994
    Conference paper
    Paliath Narendran, Frank Pfenning, Richard Statman.
    On the Unification Problem for Cartesian Closed Categories
    Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, 19-23 June 1993, Montreal, Canada 1993 (0) 1993
    Conference paper
    Paliath Narendran, Michaël Rusinowitch.
    The Unifiability Problem in Ground AC Theories
    Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, 19-23 June 1993, Montreal, Canada 1993 (0) 1993
    Conference paper
    Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder.
    An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.
    J. ACM 1993, Volume 40 (0) 1993
    Conference paper
    Klaus Madlener, Paliath Narendran, Friedrich Otto, Louxin Zhang.
    On Weakly Confluent Monadic String-Rewriting Systems.
    Theor. Comput. Sci. 1993, Volume 113 (0) 1993
    Conference paper
    Deepak Kapur, Paliath Narendran.
    Double-exponential Complexity of Computing a Complete Set of AC-Unifiers
    Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, 22-25 June 1992, Santa Cruz, California, USA 1992 (0) 1992
    Conference paper
    Jean H. Gallier, Paliath Narendran, Stan Raatz, Wayne Snyder.
    Theorem Proving Using Equational Matings and Rigid E-Unification.
    J. ACM 1992, Volume 39 (0) 1992
    Conference paper
    Deepak Kapur, Paliath Narendran.
    Complexity of Unification Problems with Associative-Commutative Operators.
    J. Autom. Reasoning 1992, Volume 9 (0) 1992
    Conference paper
    Klaus Madlener, Paliath Narendran, Friedrich Otto.
    A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.
    Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Paliath Narendran, Michaël Rusinowitch.
    Any Gound Associative-Commutative Theory Has a Finite Canonical System.
    Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings 1991 (0) 1991
    Conference paper
    Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Hantao Zhang.
    Sufficient-Completeness, Ground-Reducibility and their Complexity.
    Acta Inf. 1991, Volume 28 (0) 1991
    Conference paper
    Paliath Narendran, Colm Ó'Dúnlaing, Friedrich Otto.
    It is undecidable whether a finite special string-rewriting system presents a group.
    Discrete Mathematics 1991, Volume 98 (0) 1991
    Conference paper
    Deepak Kapur, Paliath Narendran, Hantao Zhang.
    Automating Inductionless Induction Using Test Sets.
    J. Symb. Comput. 1991, Volume 11 (0) 1991
    Conference paper
    Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman.
    Semi-Unification.
    Theor. Comput. Sci. 1991, Volume 81 (0) 1991
    Conference paper
    Paliath Narendran, Friedrich Otto.
    Some Results on Equational Unification.
    10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings 1990 (0) 1990
    Conference paper
    Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder.
    Rigid E-Unification: NP-Completeness and Applications to Equational Matings
    Inf. Comput. 1990, Volume 87 (0) 1990
    Conference paper
    Deepak Kapur, Paliath Narendran, Friedrich Otto.
    On Ground-Confluence of Term Rewriting Systems
    Inf. Comput. 1990, Volume 86 (0) 1990
    Conference paper
    Paliath Narendran.
    It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set.
    Mathematical Systems Theory 1990, Volume 23 (0) 1990
    Conference paper
    Paliath Narendran, Jonathan Stillman.
    It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.
    STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings 1989 (0) 1989
    Conference paper
    Paliath Narendran, Colm Ó'Dúnlaing.
    Cancellativity in Finitely Presented Semigroups.
    J. Symb. Comput. 1989, Volume 7 (0) 1989
    Conference paper
    Paliath Narendran, Friedrich Otto.
    Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.
    Theor. Comput. Sci. 1989, Volume 68 (0) 1989
    Conference paper
    Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder.
    Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.
    9th International Conference on Automated Deduction, Argonne, Illinois, USA, May 23-26, 1988, Proceedings 1988 (0) 1988
    Conference paper
    Paliath Narendran, Jonathan Stillman.
    Formal Verification of the Sobel Image Processing Chip.
    DAC 1988 (0) 1988
    Conference paper
    Deepak Kapur, David R. Musser, Paliath Narendran, Jonathan Stillman.
    Semi-Unification.
    Foundations of Software Technology and Theoretical Computer Science, Eighth Conference, Pune, India, December 21-23, 1988, Proceedings 1988 (0) 1988
    Conference paper
    Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted.
    Rigid E-Unification is NP-Complete
    Proceedings, Third Annual Symposium on Logic in Computer Science, 5-8 July 1988, Edinburgh, Scotland, UK 1988 (0) 1988
    Conference paper
    Paliath Narendran, Friedrich Otto.
    Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.
    Acta Inf. 1988, Volume 25 (0) 1988
    Conference paper
    Paliath Narendran, Friedrich Otto.
    Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.
    Inf. Process. Lett. 1988, Volume 29 (0) 1988
    Conference paper
    Robert McNaughton, Paliath Narendran, Friedrich Otto.
    Church-Rosser Thue systems and formal languages.
    J. ACM 1988, Volume 35 (0) 1988
    Conference paper
    Deepak Kapur, David R. Musser, Paliath Narendran.
    Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure.
    J. Symb. Comput. 1988, Volume 6 (0) 1988
    Conference paper
    Paliath Narendran, Friedrich Otto.
    It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free.
    Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 5th International Conference, AAECC-5, Menorca, Spain, June 15-19, 1987, Proceedings 1989 (0) 1987
    Conference paper
    Deepak Kapur, Paliath Narendran, Hantao Zhang.
    On Sufficient-Completeness and Related Properties of Term Rewriting Systems.
    Acta Inf. 1987, Volume 24 (0) 1987
    Conference paper
    Dan Benanav, Deepak Kapur, Paliath Narendran.
    Complexity of Matching Problems.
    J. Symb. Comput. 1987, Volume 3 (0) 1987
    Conference paper
    Deepak Kapur, Paliath Narendran.
    NP-Completeness of the Set Unification and Matching Problems.
    8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings 1986 (0) 1986
    Conference paper
    Deepak Kapur, Paliath Narendran, Hantao Zhang.
    Proof by Induction Using Test Sets.
    8th International Conference on Automated Deduction, Oxford, England, July 27 - August 1, 1986, Proceedings 1986 (0) 1986
    Conference paper
    Deepak Kapur, Paliath Narendran, Hantao Zhang.
    Complexity of Sufficient-Completeness.
    Foundations of Software Technology and Theoretical Computer Science, Sixth Conference, New Delhi, India, December 18-20, 1986, Proceedings 1986 (0) 1986
    Conference paper
    Paliath Narendran.
    On the Equivalence Problem for Regular Thue Systems.
    Theor. Comput. Sci. 1986, Volume 44 (0) 1986
    Conference paper
    Paliath Narendran, Friedrich Otto.
    The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.
    Theor. Comput. Sci. 1986, Volume 47 (0) 1986
    Conference paper
    Deepak Kapur, Paliath Narendran.
    An Equational Approach to Theorem Proving in First-Order Predicate Calculus.
    IJCAI 1985 (0) 1985
    Conference paper
    Dan Benanav, Deepak Kapur, Paliath Narendran.
    Complexity of Matching Problems.
    Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings 1985 (0) 1985
    Conference paper
    Abdelilah Kandri-Rody, Deepak Kapur, Paliath Narendran.
    An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras.
    Rewriting Techniques and Applications, First International Conference, RTA-85, Dijon, France, May 20-22, 1985, Proceedings 1985 (0) 1985
    Conference paper
    Deepak Kapur, Paliath Narendran, G. Sivakumar.
    A Path Ordering for Proving Termination of Term Rewriting Systems.
    Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAA 1985 (0) 1985
    Conference paper
    Paliath Narendran, Colm Ó'Dúnlaing, Heinrich Rolletschek.
    Complexity of Certain Decision Problems about Congruential Languages.
    J. Comput. Syst. Sci. 1985, Volume 30 (0) 1985
    Conference paper
    Deepak Kapur, Paliath Narendran.
    The Knuth-Bendix Completion Procedure and Thue Systems.
    SIAM J. Comput. 1985, Volume 14 (0) 1985
    Conference paper
    Deepak Kapur, Mukkai S. Krishnamoorthy, Robert McNaughton, Paliath Narendran.
    An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems.
    Theor. Comput. Sci. 1985, Volume 35 (0) 1985
    Conference paper
    Deepak Kapur, Paliath Narendran.
    A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System.
    Theor. Comput. Sci. 1985, Volume 35 (0) 1985
    Conference paper
    Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton.
    The Church-Rosser Property and Special Thue Systems.
    Theor. Comput. Sci. 1985, Volume 39 (0) 1985
    Show item 1 to 100 of 104  

    Your query returned 104 matches in the database.