Automatic Parallelization of Programs via Software Stream Rewriting.

David A. Plaisted University of North Carolina at Chapel Hill, USA Herbrand Award http://www.cs.unc.edu/~plaisted/ https://dl.acm.org/profile/81100050543 https://zbmath.org/authors/?q=ai:plaisted.david-alan https://mathscinet.ams.org/mathscinet/MRAuthorID/140175 https://mathgenealogy.org/id.php?id=98855 https://en.wikipedia.org/wiki/David_Plaisted https://www.wikidata.org/entity/Q5238604 http://isni.org/isni/0000000024524424 https://id.loc.gov/authorities/names/n79030633 Tao Tao 0009 David A. Plaisted Automatic Parallelization of Programs via Software Stream Rewriting. 541-551 2022 IPDPS Workshops https://doi.org/10.1109/IPDPSW55747.2022.00094 conf/ipps/2022w db/conf/ipps/ipdps2022w.html#TaoP22 David A. Plaisted Search Spaces for Theorem Proving Strategies. 1-3 2021 ARCADE@CADE http://cl-informatik.uibk.ac.at/users/swinkler/arcade2021/pdfs/2.pdf conf/arcade/2021 db/conf/arcade/arcade2021.html#Plaisted21 David A. Plaisted Relevance and Abstraction. 1-4 2021 ARCADE@CADE http://cl-informatik.uibk.ac.at/users/swinkler/arcade2021/pdfs/3.pdf conf/arcade/2021 db/conf/arcade/arcade2021.html#Plaisted21a Geoff Sutcliffe David A. Plaisted Management of the TPTP Problem Set. 1 2021 ARCADE@CADE http://cl-informatik.uibk.ac.at/users/swinkler/arcade2021/pdfs/4.pdf conf/arcade/2021 db/conf/arcade/arcade2021.html#SutcliffeP21 Tao Tao 0009 David A. Plaisted Interactive Online Configurator via Boolean Satisfiability Modeling. 1:1-1:8 2021 IAIT https://doi.org/10.1145/3468784.3468785 https://www.wikidata.org/entity/Q130951133 conf/iait/2021 db/conf/iait/iait2021.html#TaoP21

David A. Plaisted Situation Calculus by Term Rewriting. 2020 abs/2007.00125 CoRR https://arxiv.org/abs/2007.00125 db/journals/corr/corr2007.html#abs-2007-00125

David A. Plaisted Lee Barnett A Term-Rewriting Semantics for Imperative Style Programming. 2020 abs/2007.03075 CoRR https://arxiv.org/abs/2007.03075 db/journals/corr/corr2007.html#abs-2007-03075

David A. Plaisted The Aspect Calculus. 406-424 2019 CADE https://doi.org/10.1007/978-3-030-29436-6_24 conf/cade/2019 db/conf/cade/cade2019.html#Plaisted19

David A. Plaisted Properties and Extensions of Alternating Path Relevance - I. 2019 abs/1905.08842 CoRR http://arxiv.org/abs/1905.08842 db/journals/corr/corr1905.html#abs-1905-08842

Maria Paola Bonacina David A. Plaisted Semantically-Guided Goal-Sensitive Reasoning: Inference System and Completeness. 165-218 2017 59 J. Autom. Reason. 2 https://doi.org/10.1007/s10817-016-9384-2 db/journals/jar/jar59.html#BonacinaP17

Maria Paola Bonacina David A. Plaisted Semantically-Guided Goal-Sensitive Reasoning: Model Representation. 113-141 2016 56 J. Autom. Reason. 2 https://doi.org/10.1007/s10817-015-9334-4 db/journals/jar/jar56.html#BonacinaP16

David A. Plaisted History and Prospects for First-Order Automated Deduction. 3-28 2015 CADE https://doi.org/10.1007/978-3-319-21401-6_1 conf/cade/2015 db/conf/cade/cade2015.html#Plaisted15 Maria Paola Bonacina David A. Plaisted SGGS Theorem Proving: an Exposition. 25-38 2014 PAAR@IJCAR https://doi.org/10.29007/m2vf conf/cade/2014paar db/conf/cade/paar2014.html#BonacinaP14 Maria Paola Bonacina David A. Plaisted Constraint Manipulation in SGGS. 47-54 2014 UNIF https://www3.risc.jku.at/publications/download/risc_5001/proceedings-UNIF2014.pdf#page=52 conf/unif/2014 db/conf/unif/unif2014.html#BonacinaP14 David A. Plaisted Swaha Miller The Relative Power of Semantics and Unification. 317-344 2013 Programming Logics https://doi.org/10.1007/978-3-642-37651-1_14 conf/birthday/2013ganzinger db/conf/birthday/ganzinger2013.html#PlaistedM13 Vladimir Lifschitz Leora Morgenstern David A. Plaisted Knowledge Representation and Classical Logic. 3-88 2008 Handbook of Knowledge Representation https://doi.org/10.1016/S1574-6526(07)03001-5 reference/fai/3 db/reference/fai/fai3.html#LifschitzMP08 Swaha Miller David A. Plaisted The Space Efficiency of OSHL. 217-230 2005 conf/tableaux/2005 TABLEAUX https://doi.org/10.1007/11554554_17 db/conf/tableaux/tableaux2005.html#MillerP05

David A. Plaisted Adnan H. Yahya A relevance restriction strategy for automated deduction. 59-93 2003 144 Artif. Intell. 1-2 https://doi.org/10.1016/S0004-3702(02)00368-5 db/journals/ai/ai144.html#PlaistedY03

David A. Plaisted Armin Biere Yunshan Zhu A satisfiability procedure for quantified Boolean formulae. 291-328 2003 130 Discret. Appl. Math. 2 https://doi.org/10.1016/S0166-218X(02)00409-2 db/journals/dam/dam130.html#PlaistedBZ03

David A. Plaisted A Hierarchical Situation Calculus http://arxiv.org/abs/cs/0309053 2003 CoRR cs.AI/0309053 db/journals/corr/corr0309.html#cs-AI-0309053

David A. Plaisted An Abstract Programming System http://arxiv.org/abs/cs/0306028 2003 CoRR cs.SE/0306028 db/journals/corr/corr0306.html#cs-SE-0306028

Adnan H. Yahya David A. Plaisted Ordered Semantic Hyper Tableaux. 17-57 2002 29 J. Autom. Reason. 1 db/journals/jar/jar29.html#YahyaP02 https://doi.org/10.1023/A:1020512924736

Jürgen Avenhaus David A. Plaisted General Algorithms for Permutations in Equational Inference. 223-268 2001 26 J. Autom. Reason. 3 db/journals/jar/jar26.html#AvenhausP01 https://doi.org/10.1023/A:1006439522342

Nachum Dershowitz David A. Plaisted Rewriting. 535-610 2001 books/el/RobinsonV01 Handbook of Automated Reasoning db/books/collections/RobinsonV01.html#DershowitzP01 https://doi.org/10.1016/b978-044450813-3/50011-4

David A. Plaisted Special Cases and Substitutes for Rigid E-Unification. 97-152 2000 10 Appl. Algebra Eng. Commun. Comput. 2 https://doi.org/10.1007/s002000050001 db/journals/aaecc/aaecc10.html#Plaisted00

David A. Plaisted Yunshan Zhu Ordered Semantic Hyper-Linking. 167-217 2000 25 J. Autom. Reason. 3 db/journals/jar/jar25.html#PlaistedZ00 https://doi.org/10.1023/A:1006376231563

David A. Plaisted Gregory Kucherov The Complexity of Some Complementation Problems. 159-165 1999 71 Inf. Process. Lett. 3-4 db/journals/ipl/ipl71.html#PlaistedK99 https://doi.org/10.1016/S0020-0190(99)00102-7 https://www.wikidata.org/entity/Q58064532

Mauricio Osorio 0001 Bharat Jayaraman David A. Plaisted Theory of Partial-Order Programming. 207-238 1999 34 Sci. Comput. Program. 3 db/journals/scp/scp34.html#OsorioJP99 https://doi.org/10.1016/S0167-6423(98)00018-5

M. Paramasivam David A. Plaisted Automated Deduction Techniques for Classification in Description Logic Systems. 337-364 1998 20 J. Autom. Reason. 3 db/journals/jar/jar20.html#ParamasivamP98 https://doi.org/10.1023/A:1005866922570

David A. Plaisted Yunshan Zhu Replacement Rules with Definition Detection. 80-94 https://doi.org/10.1007/3-540-46508-1_5 1998 conf/ftp/1998 FTP (LNCS Selection) db/conf/ftp/ftp-lncs1998.html#PlaistedZ98 David A. Plaisted Yunshan Zhu The efficiency of theorem proving strategies - a comparative and asymptotic analysis. I-VI, 1-167 Vieweg 1997 Computational intelligence 978-3-528-05574-5

Heng Chu David A. Plaisted CLIN-S - A Semantically Guided First-Order Theorem Prover. 183-188 1997 18 J. Autom. Reason. 2 db/journals/jar/jar18.html#ChuP97 https://doi.org/10.1023/A:1005875128672

M. Paramasivam David A. Plaisted RRTP - A Replacement Rule Theorem Prover. 221-226 1997 18 J. Autom. Reason. 2 db/journals/jar/jar18.html#ParamasivamP97 https://doi.org/10.1023/A:1005847700447

David A. Plaisted Yunshan Zhu Ordered Semantic Hyper Linking. 472-477 1997 conf/aaai/1997 AAAI/IAAI db/conf/aaai/aaai97.html#PlaistedZ97 http://www.aaai.org/Library/AAAI/1997/aaai97-073.php David A. Plaisted Yunshan Zhu Equational Reasoning using AC Constraints. 108-113 1997 conf/ijcai/1997 IJCAI (1) db/conf/ijcai/ijcai97.html#PlaistedZ97 http://ijcai.org/Proceedings/97-1/Papers/018.pdf

David A. Plaisted Andrea Sattler-Klein Proof Lengths for Equational Completion. 154-170 1996 125 Inf. Comput. 2 db/journals/iandc/iandc125.html#PlaistedS96 https://doi.org/10.1006/inco.1996.0028 https://www.wikidata.org/entity/Q59444476

David A. Plaisted Geoffrey D. Alexander Propositional search efficiency and first-order theorem proving. 335-350 1996 Satisfiability Problem: Theory and Applications conf/dimacs/dimacs35 db/conf/dimacs/dimacs35.html#PlaistedA96 https://doi.org/10.1090/dimacs/035/08

Shie-Jue Lee David A. Plaisted Controlling the Consumption of Storage with Sliding Priority Search in a Hyper-Linking Based Theorem Prover. 1995 14 Comput. Artif. Intell. 6 db/journals/cai/cai14.html#LeeP95 http://www.cai.sk/ojs/index.php/cai/article/view/291 563-578

Amos R. Omondi David A. Plaisted A model for the parallel execution of subset-equational languages. 295-320 1995 11 Future Gener. Comput. Syst. 3 https://doi.org/10.1016/0167-739X(95)00002-A db/journals/fgcs/fgcs11.html#OmondiP95

Shie-Jue Lee David A. Plaisted Problem Solving by Searching for Models with a Theorem Prover. 205-233 1994 69 Artif. Intell. 1-2 db/journals/ai/ai69.html#LeeP94 https://doi.org/10.1016/0004-3702(94)90082-5

Heng Chu David A. Plaisted Model Finding in Semantically Guided Instance-Based Theorem Proving. 221-235 1994 21 Fundam. Informaticae 3 db/journals/fuin/fuin21.html#ChuP94 https://doi.org/10.3233/FI-1994-2134

Ritu Chadha David A. Plaisted Correctness of Unification Without Occur Check in Prolog. 99-122 1994 18 J. Log. Program. 2 db/journals/jlp/jlp18.html#ChandhaP94 https://doi.org/10.1016/0743-1066(94)90048-5

Shie-Jue Lee David A. Plaisted Use of replace rules in theorem proving. 217-240 1994 1 Methods Log. Comput. Sci. 2 db/journals/mlcs/mlcs1.html#LeeP94 http://dl.acm.org/citation.cfm?id=200764

David A. Plaisted The Search Efficiency of Theorem Proving Strategies. 57-71 1994 conf/cade/1994 CADE db/conf/cade/cade94.html#Plaisted94 https://doi.org/10.1007/3-540-58156-1_5 Heng Chu David A. Plaisted Semantically Guided First-Order Theorem Proving using Hyper-Linking. 192-206 1994 conf/cade/1994 CADE db/conf/cade/cade94.html#ChuP94 https://doi.org/10.1007/3-540-58156-1_14

Jean H. Gallier Paliath Narendran David A. Plaisted Stan Raatz Wayne Snyder An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time. 1-16 1993 40 J. ACM 1 db/journals/jacm/jacm40.html#GallierNPRS93 https://doi.org/10.1145/138027.138032 https://www.wikidata.org/entity/Q29029918

Ritu Chadha David A. Plaisted On the Mechanical Derivation of Loop Invariants. 705-744 1993 15 J. Symb. Comput. 5/6 db/journals/jsc/jsc15.html#ChadhaP93 https://doi.org/10.1016/S0747-7171(06)80010-6

Heng Chu David A. Plaisted Rough Resolution: A Refinement of Resolution to Remove Large Literals. 15-20 1993 conf/aaai/1993 AAAI db/conf/aaai/aaai93.html#ChuP93 http://www.aaai.org/Library/AAAI/1993/aaai93-003.php Heng Chu David A. Plaisted Model Finding Strategies in Semantically Guided Instance-based Theorem Proving. 19-28 1993 conf/ismis/1993 ISMIS db/conf/ismis/ismis93.html#ChuP93 https://doi.org/10.1007/3-540-56804-2_2 Ritu Chadha David A. Plaisted Finding Logical Consequences Using Unskolemization. 255-264 1993 conf/ismis/1993 ISMIS db/conf/ismis/ismis93.html#ChadhaP93 https://doi.org/10.1007/3-540-56804-2_24 David A. Plaisted Polynomial Time Termination and Constraint Satisfaction Tests. 405-420 1993 conf/rta/1993 RTA db/conf/rta/rta93.html#Plaisted93 https://doi.org/10.1007/978-3-662-21551-7_30

Xumin Nie David A. Plaisted A Semantic Backward Chaining Proof System. 109-128 1992 55 Artif. Intell. 1 db/journals/ai/ai55.html#NieP92 https://doi.org/10.1016/0004-3702(92)90044-X

Shie-Jue Lee David A. Plaisted Eliminating Duplication with the Hyper-Linking Strategy. 25-42 1992 9 J. Autom. Reason. 1 db/journals/jar/jar9.html#LeeP92 https://doi.org/10.1007/BF00247825

Geoffrey D. Alexander David A. Plaisted Proving Equality Theorems with Hyper-Linking. 706-710 1992 conf/cade/1992 CADE db/conf/cade/cade92.html#AlexanderP92 https://doi.org/10.1007/3-540-55602-8_208 David A. Plaisted Geoffrey D. Alexander Heng Chu Shie-Jue Lee Conditional Term Rewriting and First-Order Theorem Proving. 257-271 1992 conf/ctrs/1992 CTRS db/conf/ctrs/ctrs92.html#PlaistedACL92 https://doi.org/10.1007/3-540-56393-8_19 Shie-Jue Lee David A. Plaisted Use of Unit Clauses and Clause Splitting in Automatic Deduction. 228-232 1992 conf/icci/1992 ICCI db/conf/icci/icci1992.html#LeeP92

David A. Plaisted Richard C. Potter Term Rewriting: Some Experimental Results. 149-180 1991 11 J. Symb. Comput. 1/2 db/journals/jsc/jsc11.html#PlaistedP91 https://doi.org/10.1016/S0747-7171(08)80136-8

Nachum Dershowitz Stéphane Kaplan David A. Plaisted Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . 71-96 1991 83 Theor. Comput. Sci. 1 db/journals/tcs/tcs83.html#DershowitzKP91 https://doi.org/10.1016/0304-3975(91)90040-9

Rigid E-Unification: NP-Completeness and Applications to Equational Matings Jean H. Gallier Paliath Narendran David A. Plaisted Wayne Snyder 129-195 Inf. Comput. July/August 1990 87 1/2 db/journals/iandc/iandc87.html#GallierNPS90 https://doi.org/10.1016/0890-5401(90)90061-L https://www.wikidata.org/entity/Q29392267

David A. Plaisted A Sequent-Style Model Elimination Strategy and a Positive Refinement. 389-402 1990 6 J. Autom. Reason. 4 db/journals/jar/jar6.html#Plaisted90 https://doi.org/10.1007/BF00244355

David A. Plaisted A Heuristic Algorithm for Small Separators in Arbitrary Graphs. 267-280 1990 19 SIAM J. Comput. 2 db/journals/siamcomp/siamcomp19.html#Plaisted90 https://doi.org/10.1137/0219018

Xumin Nie David A. Plaisted Experimental Results on Subgoal Reordering. 845-848 1990 39 IEEE Trans. Computers 6 db/journals/tc/tc39.html#NieP90 https://doi.org/10.1109/12.53609 http://doi.ieeecomputersociety.org/10.1109/12.53609

Xumin Nie David A. Plaisted A Complete Semantic Back Chaining Proof System. 16-27 1990 conf/cade/1990 CADE db/conf/cade/cade90.html#NieP90 https://doi.org/10.1007/3-540-52885-7_76

Xumin Nie David A. Plaisted Refinements to Depth-First Iterative-Deepening Search in Automatic Theorem Proving. 223-235 1989 41 Artif. Intell. 2 db/journals/ai/ai41.html#NieP89 https://doi.org/10.1016/0004-3702(89)90011-8

Nachum Dershowitz Stéphane Kaplan David A. Plaisted Infinite Normal Forms (Preliminary Version). 249-262 1989 conf/icalp/1989 ICALP db/conf/icalp/icalp89.html#DershowitzKP89 https://doi.org/10.1007/BFb0035765 Bharat Jayaraman David A. Plaisted Programming with Equations, Subsets, and Relations. 1051-1068 1989 conf/slp/1989 NACLP db/conf/slp/slp89.html#JayaramanP89

David A. Plaisted Non-Horn Clause Logic Programming Without Contrapositives. 287-325 1988 4 J. Autom. Reason. 3 db/journals/jar/jar4.html#Plaisted88 https://doi.org/10.1007/BF00244944

Jean H. Gallier Paliath Narendran David A. Plaisted Stan Raatz Wayne Snyder Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. 182-196 1988 conf/cade/1988 CADE db/conf/cade/cade88.html#GallierNPRS88 https://doi.org/10.1007/BFb0012832 Richard C. Potter David A. Plaisted Term Rewriting: Some Experimental Results. 435-453 1988 conf/cade/1988 CADE db/conf/cade/cade88.html#PotterP88 https://doi.org/10.1007/BFb0012848 David A. Plaisted A Goal Directed Theorem Prover. 737 1988 conf/cade/1988 CADE db/conf/cade/cade88.html#Plaisted88 https://doi.org/10.1007/BFb0012873 Jean H. Gallier Wayne Snyder Paliath Narendran David A. Plaisted Rigid E-Unification is NP-Complete 218-227 1988 conf/lics/1988 LICS db/conf/lics/lics88.html#GallierSNP88 https://doi.org/10.1109/LICS.1988.5121 https://doi.ieeecomputersociety.org/10.1109/LICS.1988.5121

David A. Plaisted Jiarong Hong A Heuristic Triangulation Algorithm. 405-437 1987 8 J. Algorithms 3 db/journals/jal/jal8.html#PlaistedH87 https://doi.org/10.1016/0196-6774(87)90020-4

David A. Plaisted A Logic for Conditional Term Rewriting Systems. 212-227 1987 conf/ctrs/1987 CTRS db/conf/ctrs/ctrs87.html#Plaisted87 https://doi.org/10.1007/3-540-19242-5_16 Bharat Jayaraman David A. Plaisted Functional programming with sets. 194-211 1987 conf/fpca/1987 FPCA db/conf/fpca/fpca1987.html#JayaramanP87 https://doi.org/10.1007/3-540-18317-5_12

David A. Plaisted A Decision Procedure for Combinations of Propositional Temporal Logic and Other Specialized Theories. 171-190 1986 2 J. Autom. Reason. 2 db/journals/jar/jar2.html#Plaisted86 https://doi.org/10.1007/BF02432150

David A. Plaisted Steven Greenbaum A Structure-Preserving Clause Form Translation. 293-304 1986 2 J. Symb. Comput. 3 db/journals/jsc/jsc2.html#PlaistedG86 https://doi.org/10.1016/S0747-7171(86)80028-1 https://www.wikidata.org/entity/Q29031727

David A. Plaisted A Simple Non-Termination Test for the Knuth-Bendix Method. 79-88 1986 conf/cade/1986 CADE db/conf/cade/cade86.html#Plaisted86 https://doi.org/10.1007/3-540-16780-3_81 David A. Plaisted Abstraction Using Generalization Functions. 365-376 1986 conf/cade/1986 CADE db/conf/cade/cade86.html#Plaisted86a https://doi.org/10.1007/3-540-16780-3_103 Steven Greenbaum David A. Plaisted The Illinois Prover: A General Purpose Resolution Theorem Prover. 685-687 1986 conf/cade/1986 CADE db/conf/cade/cade86.html#GreenbaumP86 https://doi.org/10.1007/3-540-16780-3_137 J. Dean Brock Amos R. Omondi David A. Plaisted A Multiprocessor Architecture for Medium-Grain Parallelism. 167-174 1986 conf/icdcs/1986 ICDCS db/conf/icdcs/icdcs86.html#BrockOP86 David A. Plaisted J. W. Curry Extensions to functional programming in Scheme. 230-246 1986 ISMIS https://doi.org/10.1145/12808.12834 conf/ismis/1986 db/conf/ismis/ismis1986.html#PlaistedC86 David A. Plaisted The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations 163-174 conf/lics/1986 1986 LICS db/conf/lics/lics86.html#Plaisted86

Semantic Confluence Tests and Completion Methods David A. Plaisted 182-215 Inf. Control. May/June 1985 65 2/3 db/journals/iandc/iandc65.html#Plaisted85 https://doi.org/10.1016/S0019-9958(85)80005-X https://www.wikidata.org/entity/Q29398513

David A. Plaisted The Undecidability of Self-Embedding for Term Rewriting Systems. 61-64 1985 20 Inf. Process. Lett. 2 db/journals/ipl/ipl20.html#Plaisted85 https://doi.org/10.1016/0020-0190(85)90063-8

Leo Bachmair David A. Plaisted Termination Orderings for Associative-Commutative Rewriting Systems. 329-349 1985 1 J. Symb. Comput. 4 db/journals/jsc/jsc1.html#BachmairP85 https://doi.org/10.1016/S0747-7171(85)80019-5

Nachum Dershowitz David A. Plaisted Conditional rewriting. 55-59 1985 10 ACM SIGSOFT Softw. Eng. Notes 4 https://doi.org/10.1145/1012497.1012518 db/journals/sigsoft/sigsoft10.html#DershowitzP85

David A. Plaisted Complete Divisibility Problems for Slowly Utilized Oracles. 245-260 1985 35 Theor. Comput. Sci. db/journals/tcs/tcs35.html#Plaisted85 https://doi.org/10.1016/0304-3975(85)90017-9

David A. Plaisted An Architecture for fast Data Movement in the FFP Machine. 147-163 1985 conf/fpca/85 FPCA db/conf/fpca/fpca85.html#Plaisted85 https://doi.org/10.1007/3-540-15975-4_35 Leo Bachmair David A. Plaisted Associative Path Orderings. 241-254 1985 conf/rta/1985 RTA db/conf/rta/rta85.html#BachmairP85 https://doi.org/10.1007/3-540-15976-2_11 Nachum Dershowitz David A. Plaisted Logic Programming cum Applicative Programming. 54-66 1985 conf/slp/1985 SLP db/conf/slp/slp85.html#DershowitzP85

David A. Plaisted Heuristic Matching for Graphs Satisfying the Triangle Inequality. 163-179 1984 5 J. Algorithms 2 db/journals/jal/jal5.html#Plaisted84 https://doi.org/10.1016/0196-6774(84)90024-5

David A. Plaisted Complete Problems in the First-Order Predicate Calculus. 8-35 1984 29 J. Comput. Syst. Sci. 1 db/journals/jcss/jcss29.html#Plaisted84 https://doi.org/10.1016/0022-0000(84)90010-2

David A. Plaisted The Occur-Check Problem in Prolog. 309-322 1984 2 New Gener. Comput. 4 db/journals/ngc/ngc2.html#Plaisted84 https://doi.org/10.1007/BF03037324

David A. Plaisted New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. 125-138 1984 31 Theor. Comput. Sci. db/journals/tcs/tcs31.html#Plaisted84 https://doi.org/10.1016/0304-3975(84)90130-0

David A. Plaisted Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving. 356-374 1984 conf/cade/1984 CADE db/conf/cade/cade84.html#Plaisted84 https://doi.org/10.1007/978-0-387-34768-4_21 David A. Plaisted An Efficient Bug Location Algorithm. 151-157 1984 conf/iclp/1984 ICLP db/conf/iclp/iclp84.html#Plaisted84 David A. Plaisted The Occur-Check Problem in Prolog. 272-280 1984 conf/slp/1984 SLP db/conf/slp/slp84.html#Plaisted84

Kenneth J. Supowit Edward M. Reingold David A. Plaisted The Travelling Salesman Problem and Minimum Matching in the Unit Square. 144-156 1983 12 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp12.html#SupowitRP83 https://doi.org/10.1137/0212009

Nachum Dershowitz Jieh Hsiang N. Alan Josephson David A. Plaisted Associative-Commutative Rewriting. 940-944 1983 conf/ijcai/1983 IJCAI db/conf/ijcai/ijcai83.html#DershowitzHJP83 http://ijcai.org/Proceedings/83-2/Papers/078.pdf David A. Plaisted A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics. 403-420 1983 conf/lop/1983 Logic of Programs db/conf/lop/lop1983.html#Plaisted83 https://doi.org/10.1007/3-540-12896-4_377

David A. Plaisted A Simplified Problem Reduction Format. 227-261 1982 18 Artif. Intell. 2 db/journals/ai/ai18.html#Plaisted82 https://doi.org/10.1016/0004-3702(82)90041-8 https://www.wikidata.org/entity/Q29305654

Steven Greenbaum A. Nagasaka Paul O'Rorke David A. Plaisted Comparison of Natural Deduction and Locking Resolution Implementations. 159-171 1982 conf/cade/1982 CADE db/conf/cade/cade82.html#GreenbaumNOP82 https://doi.org/10.1007/BFb0000058

David A. Plaisted Theorem Proving with Abstraction. 47-108 1981 16 Artif. Intell. 1 db/journals/ai/ai16.html#Plaisted81 https://doi.org/10.1016/0004-3702(81)90015-1 https://www.wikidata.org/entity/Q30052608

David A. Plaisted Samuel Zaks An NP-complete matching problem. 65-72 1980 2 Discret. Appl. Math. 1 https://doi.org/10.1016/0166-218X(80)90055-4 https://www.wikidata.org/entity/Q106200605 db/journals/dam/dam2.html#PlaistedZ80

David A. Plaisted The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability. 698-705 1980 9 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp9.html#Plaisted80 https://doi.org/10.1137/0209054

David A. Plaisted An Efficient Relevance Criterion for Mechanical Theorem Proving. 79-83 1980 conf/aaai/1980 AAAI db/conf/aaai/aaai80.html#Plaisted80 http://www.aaai.org/Library/AAAI/1980/aaai80-023.php David A. Plaisted Abstraction Mappings in Mechanical Theorem Proving. 264-280 1980 conf/cade/1980 CADE db/conf/cade/cade80.html#Plaisted80 https://doi.org/10.1007/3-540-10009-1_21 On the Distribution of Independent Formulae of Number Theory David A. Plaisted 39-44 conf/stoc/STOC12 1980 STOC db/conf/stoc/stoc80.html#Plaisted80 https://doi.org/10.1145/800141.804651 Heuristics for Weighted Perfect Matching Kenneth J. Supowit David A. Plaisted Edward M. Reingold 398-419 conf/stoc/STOC12 1980 STOC db/conf/stoc/stoc80.html#SupowitPR80 https://doi.org/10.1145/800141.804689 https://www.wikidata.org/entity/Q56077931

David A. Plaisted Fast Verification, Testing, and Generation of Large Primes. 1-16 1979 9 Theor. Comput. Sci. db/journals/tcs/tcs9.html#Plaisted79 https://doi.org/10.1016/0304-3975(79)90002-1

David A. Plaisted Some Polynomial and Integer Divisibility problems are NP-Hard. 458-464 1978 7 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp7.html#Plaisted78 https://doi.org/10.1137/0207036

David A. Plaisted Sparse Complex Polynomials and Polynomial Reducibility. 210-221 1977 14 J. Comput. Syst. Sci. 2 db/journals/jcss/jcss14.html#Plaisted77 https://doi.org/10.1016/S0022-0000(77)80013-5

New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems David A. Plaisted 241-253 conf/focs/FOCS18 1977 FOCS db/conf/focs/focs77.html#Plaisted77 https://doi.org/10.1109/SFCS.1977.17 https://doi.ieeecomputersociety.org/10.1109/SFCS.1977.17 David A. Plaisted Theorem proving and semantic trees. Stanford University, USA 1976 https://searchworks.stanford.edu/view/3413458 Some Polynomial and Integer Divisibility Problems Are NP-Hard David A. Plaisted 264-267 conf/focs/FOCS17 1976 FOCS db/conf/focs/focs76.html#Plaisted76 https://doi.org/10.1109/SFCS.1976.29 https://doi.ieeecomputersociety.org/10.1109/SFCS.1976.29 Flowchart Schemata with Counters David A. Plaisted 44-51 conf/stoc/STOC4 1972 STOC db/conf/stoc/stoc72.html#Plaisted72 https://doi.org/10.1145/800152.804895 Geoffrey D. Alexander Jürgen Avenhaus Leo Bachmair Lee Barnett Armin Biere Maria Paola Bonacina J. Dean Brock Ritu Chadha Heng Chu J. W. Curry Nachum Dershowitz Jean H. Gallier Steven Greenbaum Jiarong Hong Jieh Hsiang Bharat Jayaraman N. Alan Josephson Stéphane Kaplan Gregory Kucherov Shie-Jue Lee Vladimir Lifschitz Swaha Miller Leora Morgenstern A. Nagasaka Paliath Narendran Xumin Nie Amos R. Omondi Paul O'Rorke Mauricio Osorio 0001 M. Paramasivam Richard C. Potter Stan Raatz Edward M. Reingold Andrea Sattler-Klein Wayne Snyder Kenneth J. Supowit Geoff Sutcliffe Tao Tao 0009 Adnan H. Yahya Samuel Zaks Yunshan Zhu