Paliath Narendran - Concepedia

Author

Paliath Narendran

University at Albany, State University of New York ORCID

Also Known As

, Franz Baader, Hono, Daniel S., Narendran, Paliath, P Narendran, P. Narendran, P.Narendran P.Narendran, Paliath Narendran

165

Publications

2.7K

Citations

H-Index

Concepts

All Affiliations

University at Albany, State University of New York General Electric (United States)Albany State University Rensselaer Polytechnic Institute University of Kaiserslautern

About

Paliath Narendran is an author at University at Albany, State University of New York specializing in engineering, automated reasoning, and formal methods.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	22	35	1.4K
2	Computer Science	17	25	968
3	Language Studies	5	5	278
4	Linguistics	5	5	278
5	Computer Engineering	1	1	12

Paliath Narendran

Publications

1.6K

Citations

H-Index

Page 1

	Year	Citations
Church-Rosser Thue systems and formal languages Robert McNaughton, Paliath Narendran, Friedrich Otto Journal of the ACM EngineeringChurch-rosser Thue SystemsHigher-order LogicFormal LanguagesFormal Verification	1988	129
On sufficient-completeness and related properties of term rewriting systems Deepak Kapur, Paliath Narendran, Hantao Zhang Acta Informatica EngineeringAutomated ReasoningRegulated RewritingRelated PropertiesRewriting System	1987	118
Complexity of matching problems Dan Benanav, Deepak Kapur, Paliath Narendran Journal of Symbolic Computation Mathematical ProgrammingEngineeringMatching TechniqueCombinatorial Pattern MatchingMatching Theory	1987	93
Complexity of unification problems with associative-commutative operators Deepak Kapur, Paliath Narendran Journal of Automated Reasoning Algebraic LogicEngineeringAutomated ReasoningFormal MethodsDescriptional Complexity	1992	77
An equational approach to theorem proving in first-order predicate calculus Deepak Kapur, Paliath Narendran ACM SIGSOFT Software Engineering Notes Theory Of ComputingNew Yorkview ProfileEngineeringJournal Citation ReportAutomated Reasoning	1985	74
A finite thue system with decidable word problem and without equivalent finite canonical system Deepak Kapur, Paliath Narendran Theoretical Computer Science Combinatorics On WordEngineeringAutomated ReasoningComputational LinguisticsComputational Model Theory	1985	67
Sufficient-completeness, ground-reducibility and their complexity Deepak Kapur, Paliath Narendran, Daniel J. Rosenkrantz, Acta Informatica EngineeringIncompletenessAutomated ReasoningFormal MethodsComputational Complexity	1991	61
An equational approach to theorem proving in first-order predicate calculus Deepak Kapur, Paliath Narendran International Joint Conference on Artificial Intelligence Term RewritingEngineeringAutomated ReasoningProof ComplexityVerification	1985	60
Only prime superpositions need be considered in the Knuth-Bendix completion procedure Deepak Kapur, David R. Musser, Paliath Narendran Journal of Symbolic Computation Prime SuperpositionsPhysicsKnuth-bendix Completion Procedure	1988	57
The Knuth-Bendix Completion Procedure and Thue Systems Deepak Kapur, Paliath Narendran SIAM Journal on Computing Mathematical ProgrammingKnuth-bendix Completion ProcedureComputational Complexity TheoryEngineeringAutomated Reasoning	1985	49

Page 1