The following pages link to David Alan Plaisted (Q1238600):
Displaying 50 items.
- (Q174770) (redirect page) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Refinements to depth-first iterative-deepening search in automatic theorem proving (Q582116) (← links)
- Eliminating dublication with the hyper-linking strategy (Q688547) (← links)
- Term rewriting: Some experimental results (Q757071) (← links)
- A relevance restriction strategy for automated deduction (Q814429) (← links)
- (Q921912) (redirect page) (← links)
- Rigid E-unification: NP-completeness and applications to equational matings (Q921913) (← links)
- The undecidability of self-embedding for term rewriting systems (Q1061484) (← links)
- New NP-hard and NP-complete polynomial and integer divisibility problems (Q1062447) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Complete problems in the first-order predicate calculus (Q1075318) (← links)
- The occur-check problem in Prolog (Q1077912) (← links)
- Complete divisibility problems for slowly utilized oracles (Q1083192) (← links)
- A decision procedure for combinations of propositional temporal logic and other specialized theories (Q1097264) (← links)
- A structure-preserving clause form translation (Q1098330) (← links)
- Non-Horn clause logic programming without contrapositives (Q1116717) (← links)
- Fast verification, testing, and generation of large primes (Q1132906) (← links)
- Theorem proving with abstraction (Q1149799) (← links)
- An NP-complete matching problem (Q1166935) (← links)
- A simplified problem reduction format (Q1170894) (← links)
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- A semantic backward chaining proof system (Q1193483) (← links)
- Sparse complex polynomials and polynomial reducibility (Q1238601) (← links)
- On the mechanical derivation of loop invariants (Q1322851) (← links)
- Problem solving by searching for models with a theorem prover (Q1337680) (← links)
- Automated deduction techniques for classification in description logic systems (Q1383996) (← links)
- A satisfiability procedure for quantified Boolean formulae (Q1408385) (← links)
- Ordered semantic hyper-linking (Q1581853) (← links)
- The complexity of some complementation problems (Q1606984) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Theory of partial-order programming (Q1806132) (← links)
- Ordered semantic hyper tableaux (Q1869611) (← links)
- Proof lengths for equational completion (Q1917087) (← links)
- Special cases and substitutes for rigid \(E\)-unification (Q1961709) (← links)
- The aspect calculus (Q2305430) (← links)
- A sequent-style model elimination strategy and a positive refinement (Q2639044) (← links)
- (Q2751361) (← links)
- (Q3028319) (← links)
- (Q3210187) (← links)
- Heuristic matching for graphs satisfying the triangle inequality (Q3332259) (← links)
- (Q3336731) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- A Heuristic Algorithm for Small Separators in Arbitrary Graphs (Q3474888) (← links)
- (Q3484382) (← links)
- (Q3491006) (← links)
- (Q3596461) (← links)
- (Q3678693) (← links)
- (Q3696491) (← links)
- (Q3696500) (← links)
