Paliath Narendran
Paliath Narendran
Bestätigte E-Mail-Adresse bei albany.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Unification of concept terms in description logics
F Baader, P Narendran
Journal of Symbolic Computation 31 (3), 277-305, 2001
1922001
NP-completeness of the set unification and matching problems
D Kapur, P Narendran
International Conference on Automated Deduction, 489-495, 1986
1691986
An equational approach to theorem proving in first-order predicate calculus
D Kapur, P Narendran
ACM SIGSOFT Software Engineering Notes 10 (4), 63-66, 1985
1591985
On sufficient-completeness and related properties of term rewriting systems
D Kapur, P Narendran, H Zhang
Acta Informatica 24 (4), 395-415, 1987
1551987
Church-Rosser Thue systems and formal languages
R McNaughton, P Narendran, F Otto
Journal of the ACM (JACM) 35 (2), 324-344, 1988
1431988
Complexity of matching problems
D Benanav, D Kapur, P Narendran
Journal of symbolic computation 3 (1-2), 203-216, 1987
1141987
Complexity of unification problems with associative-commutative operators
D Kapur, P Narendran
Journal of Automated Reasoning 9 (2), 261-288, 1992
1131992
A finite Thue system with decidable word problem and without equivalent finite canonical system
D Kapur, P Narendran
Theoretical Computer Science 35, 337-344, 1985
1031985
Rigid E-unification: NP-completeness and applications to equational matings
J Gallier, P Narendran, D Plaisted, W Snyder
Information and Computation 87 (1-2), 129-195, 1990
881990
Theorem proving using equational matings and rigid E-unification
J Gallier, P Narendran, S Raatz, W Snyder
Journal of the ACM (JACM) 39 (2), 377-430, 1992
831992
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
D Kapur, DR Musser, P Narendran
Journal of Symbolic Computation 6 (1), 19-36, 1988
781988
Sufficient-completeness, ground-reducibility and their complexity
D Kapur, P Narendran, DJ Rosenkrantz, H Zhang
Acta Informatica 28 (4), 311-350, 1991
741991
Any ground associative-commutative theory has a finite canonical system
P Narendran, M Rusinowitch
International Conference on Rewriting Techniques and Applications, 423-434, 1991
731991
On ground-confluence of term rewriting systems
D Kapur, P Narendran, F Otto
Information and Computation 86 (1), 14-31, 1990
711990
Proof by induction using test sets
D Kapur, P Narendran, H Zhang
International Conference on Automated Deduction, 99-117, 1986
711986
Double-exponential complexity of computing a complete set of AC-unifiers
D Kapur, P Narendran
State University of New York at Albany, Department of Computer Science, 1991
691991
Complexity of matching problems
D Benanav, D Kapur, P Narendran
International Conference on Rewriting Techniques and Applications, 417-429, 1985
651985
Automating inductionless induction using test sets
D Kapur, P Narendran, H Zhang
Journal of symbolic Computation 11 (1-2), 83-111, 1991
641991
A path ordering for proving termination of term rewriting systems
D Kapur, P Narendran, G Sivakumar
Colloquium on Trees in Algebra and Programming, 173-187, 1985
601985
The Knuth-Bendix completion procedure and Thue systems
D Kapur, P Narendran
SIAM journal on computing 14 (4), 1052-1072, 1985
581985
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20