BibSLEIGH — David_A

Travelled to:

1 × Canada
1 × Germany
1 × Italy
1 × Sweden
1 × United Kingdom
11 × USA
4 × France

Collaborated with:

∅ B.Jayaraman N.Dershowitz S.Greenbaum H.Chu G.D.Alexander X.Nie R.C.Potter L.Bachmair J.H.Gallier P.Narendran W.Snyder S.Kaplan K.J.Supowit E.M.Reingold A.Nagasaka P.O'Rorke S.Raatz

Talks about:

theorem (7) program (5) prove (5) use (4) semant (3) prover (3) order (3) polynomi (2) function (2) abstract (2)

Person: David A. Plaisted

DBLP: Plaisted:David_A=

Contributed to:

2015

1994

1993

1992

1990

1989

1988

1987

1986

1985

1984

1982

1980

1972

2019

Wrote 29 papers:

CADE-2015-Plaisted #automation #deduction #first-order: History and Prospects for First-Order Automated Deduction (DAP), pp. 3–28.
CADE-1994-ChuP #first-order #proving #semantics #theorem proving #using: Semantically Guided First-Order Theorem Proving using Hyper-Linking (HC, DAP), pp. 192–206.
CADE-1994-Plaisted #performance #proving #theorem proving: The Search Efficiency of Theorem Proving Strategies (DAP), pp. 57–71.
RTA-1993-Plaisted #constraints #polynomial #termination #testing: Polynomial Time Termination and Constraint Satisfaction Tests (DAP), pp. 405–420.
CADE-1992-AlexanderP #proving #similarity #theorem: Proving Equality Theorems with Hyper-Linking (GDA, DAP), pp. 706–710.
CADE-1990-NieP #proving #semantics: A Complete Semantic Back Chaining Proof System (XN, DAP), pp. 16–27.
ICALP-1989-DershowitzKP #infinity #normalisation: Infinite Normal Forms (ND, SK, DAP), pp. 249–262.
NACLP-1989-JayaramanP #equation #programming #set: Programming with Equations, Subsets, and Relations (BJ, DAP), pp. 1051–1068.
CADE-1988-GallierNPRS #canonical #equation #finite #polynomial #set #term rewriting: Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time (JHG, PN, DAP, SR, WS), pp. 182–196.
CADE-1988-Plaisted #proving #theorem proving: A Goal Directed Theorem Prover (DAP), p. 737.
CADE-1988-PotterP #term rewriting: Term Rewriting: Some Experimental Results (RCP, DAP), pp. 435–453.
LICS-1988-GallierSNP: Rigid E-Unification is NP-Complete (JHG, WS, PN, DAP), pp. 218–227.
FPCA-1987-JayaramanP #functional #programming #set: Functional programming with sets (BJ, DAP), pp. 194–211.
CADE-1986-GreenbaumP #proving #theorem proving: The Illinois Prover: A General Purpose Resolution Theorem Prover (SG, DAP), pp. 685–687.
CADE-1986-Plaisted: A Simple Non-Termination Test for the Knuth-Bendix Method (DAP), pp. 79–88.
CADE-1986-Plaisted86a #abstraction #using: Abstraction Using Generalization Functions (DAP), pp. 365–376.
LICS-1986-Plaisted #nondeterminism #recursion #semantics #source code #using: The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations (DAP), pp. 163–174.
FPCA-1985-Plaisted85 #architecture #data flow #performance: An Architecture for fast Data Movement in the FFP Machine (DAP), pp. 147–163.
RTA-1985-BachmairP #order: Associative Path Orderings (LB, DAP), pp. 241–254.
SLP-1985-DershowitzP85 #logic programming: Logic Programming cum Applicative Programming (ND, DAP), pp. 54–66.
CADE-1984-Plaisted #analysis #dependence #graph #proving #theorem proving #using: Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving (DAP), pp. 356–374.
ILPC-1984-Plaisted84 #algorithm #debugging #performance: An Efficient Bug Location Algorithm (DAP), pp. 151–157.
SLP-1984-Plaisted84 #problem #prolog: The Occur-Check Problem in Prolog (DAP), pp. 272–280.
CADE-1982-GreenbaumNOP #comparison #deduction #implementation: Comparison of Natural Deduction and Locking Resolution Implementations (SG, AN, PO, DAP), pp. 159–171.
CADE-1980-Plaisted #abstraction #proving #theorem proving: Abstraction Mappings in Mechanical Theorem Proving (DAP), pp. 264–280.
STOC-1980-Plaisted #independence #on the: On the Distribution of Independent Formulae of Number Theory (DAP), pp. 39–44.
STOC-1980-SupowitPR #heuristic: Heuristics for Weighted Perfect Matching (KJS, DAP, EMR), pp. 398–419.
STOC-1972-Plaisted: Flowchart Schemata with Counters (DAP), pp. 44–51.
CADE-2019-Plaisted #calculus: The Aspect Calculus (DAP), pp. 406–424.