Follow
David Plaisted
David Plaisted
Unknown affiliation
Verified email at cs.unc.edu
Title
Cited by
Cited by
Year
A structure-preserving clause form translation
DA Plaisted, S Greenbaum
Journal of Symbolic Computation 2 (3), 293-304, 1986
7901986
Completion without failure
L Bachmair, N Dershowitz, DA Plaisted
Rewriting Techniques, 1-30, 1989
3931989
Theorem proving with abstraction
DA Plaisted
Artificial Intelligence 16 (1), 47-108, 1981
2571981
Rewriting.
N Dershowitz, DA Plaisted
Handbook of Automated Reasoning 1, 535-610, 2001
2512001
Semantic confluence tests and completion methods
DA Plaisted
Information and Control 65 (2-3), 182-215, 1985
1921985
Eliminating duplication with the hyper-linking strategy
SJ Lee, DA Plaisted
Journal of Automated Reasoning 9 (1), 25-42, 1992
1881992
Equational reasoning and term rewriting systems
DA Plaisted
Handbook of logic in artificial intelligence and logic programming 1, 273-364, 1993
1721993
Non-Horn clause logic programming without contrapositives
DA Plaisted
Journal of Automated Reasoning 4 (3), 287-325, 1988
1461988
Rewrite, rewrite, rewrite, rewrite, rewrite,…
N Dershowitz, S Kaplan, DA Plaisted
Theoretical Computer Science 83 (1), 71-96, 1991
1381991
Termination orderings for associative-commutative rewriting systems
L Bachmair, DA Plaisted
Journal of Symbolic Computation 1 (4), 329-349, 1985
1241985
A recursively defined ordering for proving termination of term rewriting systems
DA Plaisted
Department of Computer Science, University of Illinois at Urbana-Champaign, 1978
1211978
Normal form transformations
J Goubault-Larrecq, D Plaisted
Handbook of Automated Reasoning 1, 273, 2001
1102001
Equational programming
N Dershowitz
Machine intelligence 11, 21-56, 1988
1051988
Ordered semantic hyper-linking
DA Plaisted, Y Zhu
Journal of Automated Reasoning 25 (3), 167-217, 2000
982000
The occur-check problem in Prolog
DA Plaisted
New Generation Computing 2 (4), 309-322, 1984
971984
A heuristic triangulation algorithm
DA Plaisted, J Hong
Journal of Algorithms 8 (3), 405-437, 1987
961987
Logic programming cum applicative programming
N Dershowitz, DA Plaisted
SLP, 54-66, 1985
941985
New NP-hard and NP-complete polynomial and integer divisibility problems
DA Plaisted
Theoretical Computer Science 31 (1-2), 125-138, 1984
931984
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
901990
PROGRAMMING WITH PARAMETERIZED ABSTRACT OBJECTS IN OBJ.
J Goguen, D Plaisted, J Meseguer
Unknown Host Publication Title, 163-193, 1983
891983
The system can't perform the operation now. Try again later.
Articles 1–20