It looks like you're offline.
Donate
English (en) Change Website Language
Open Library logo
additional options menu
Last edited by RenameBot
September 4, 2008 | History
Edit

David A. Plaisted

We need a photo of David A. Plaisted

12 works Add another?

Showing all works by author. Would you like to see only ebooks?

  • Cover of: The Efficiency of Theorem Proving Strategies: A Comparative and Asymptotic Analysis (Computational Intelligence)

    First published in 1999 — 3 editions
    Locate

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Restricted oracles

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Theorem proving with abstraction, part II

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Theorem proving with abstraction, part I

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: An exponential lower bound for a restricted class of monotone formulae for 2-unsatisfiability

    First published in 1978 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: An NP-complete matching problem

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Complete problems in the first-order predicate calculus

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: The efficiency of theorem proving strategies: a comparative and asymptotic analysis

    First published in 1997 — 1 edition
    Locate

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Inference rules for unsatisfiability

    First published in 1979 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: A recursively defined ordering for proving termination of term rewriting systems

    First published in 1978 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Theorem proving with abstraction

    First published in 1979 — 1 edition
    Locate

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
  • Cover of: Well-founded orderings for proving termination of systems of rewrite rules

    First published in 1978 — 1 edition
    Read Listen

    My Reading Lists:

    Create a new list

    Check-In

    ×Close
    Add an optional check-in date. Check-in dates are used to track yearly reading goals.
    Today
We need a photo of David A. Plaisted

Subjects

Automatic theorem proving, Computational complexity, Computer programs, Data processing, Predicate calculus, Algebra, Boolean, Artificial intelligence, Automatic control, Boolean Algebra, Computer programming, Computr programs, Electronics digital computers, Graph theory, Inference, Matching theory, NP-complete problems, Polynomials, Programming, Programming languages (Electronic computers), Propositional calculus, Recursion theory, Recursive programming, Rewriting systems (Computer science), Termination, Verification

Lists

Add to List

My Reading Lists:

Create a new list

ID Numbers

  • OLID: OL261486A

Links outside Open Library

No links yet. Add one?

History

Download catalog record: RDF / JSON
September 4, 2008 Edited by RenameBot fix author name
April 1, 2008 Created by an anonymous user initial import