The following pages link to David Alan Plaisted (Q1238600):
Displaying 27 items.
- Semantic confluence tests and completion methods (Q3732980) (← links)
- A heuristic triangulation algorithm (Q3776650) (← links)
- (Q3783520) (← links)
- (Q3783620) (← links)
- (Q3805956) (← links)
- (Q3811749) (← links)
- (Q3817651) (← links)
- (Q3885237) (← links)
- The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability (Q3894960) (← links)
- The Travelling Salesman Problem and Minimum Matching in the Unit Square (Q3967062) (← links)
- An algorithm for finding canonical sets of ground rewrite rules in polynomial time (Q4033833) (← links)
- (Q4130962) (← links)
- Some Polynomial and Integer Divisibility Problems are $NP$-Hard (Q4167579) (← links)
- (Q4205073) (← links)
- Correctness of unification without occur check in prolog (Q4285641) (← links)
- (Q4314599) (← links)
- (Q4345253) (← links)
- (Q4375764) (← links)
- (Q4503903) (← links)
- The Relative Power of Semantics and Unification (Q4916085) (← links)
- (Q4949919) (← links)
- Polynomial time termination and constraint satisfaction tests (Q5055810) (← links)
- The search efficiency of theorem proving strategies (Q5210762) (← links)
- Semantically guided first-order theorem proving using hyper-linking (Q5210771) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479279) (← links)
- Conditional term rewriting and first-order theorem proving (Q5881190) (← links)
- General algorithms for permutations in equational inference (Q5931113) (← links)
