answersLogoWhite

0

David A. Plaisted has written:

'Complete problems in the first-order predicate calculus' -- subject(s): Computational complexity, Predicate calculus

'The efficiency of theorem proving strategies' -- subject(s): Automatic theorem proving

'Well-founded orderings for proving termination of systems of rewrite rules' -- subject(s): Verification, Recursive programming, Computer programs

'A recursively defined ordering for proving termination of term rewriting systems' -- subject(s): Recursion theory, Computer programming, Rewriting systems (Computer science), Automatic theorem proving

'An NP-complete matching problem' -- subject(s): Data processing, Graph theory, NP-complete problems, Matching theory

User Avatar

Wiki User

10y ago

What else can I help you with?