default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Plaisted
Person information
- affiliation: University of North Carolina at Chapel Hill, USA
- award (2010): Herbrand Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[c55]Tao Tao, David A. Plaisted:
Automatic Parallelization of Programs via Software Stream Rewriting. IPDPS Workshops 2022: 541-551- 2021
- [c54]David A. Plaisted:
Search Spaces for Theorem Proving Strategies. ARCADE@CADE 2021: 1-3 - [c53]David A. Plaisted:
Relevance and Abstraction. ARCADE@CADE 2021: 1-4 - [c52]Geoff Sutcliffe, David A. Plaisted:
Management of the TPTP Problem Set. ARCADE@CADE 2021: 1 - [c51]Tao Tao, David A. Plaisted:
Interactive Online Configurator via Boolean Satisfiability Modeling. IAIT 2021: 1:1-1:8 - 2020
- [i5]David A. Plaisted:
Situation Calculus by Term Rewriting. CoRR abs/2007.00125 (2020) - [i4]David A. Plaisted, Lee Barnett:
A Term-Rewriting Semantics for Imperative Style Programming. CoRR abs/2007.03075 (2020)
2010 – 2019
- 2019
- [c50]David A. Plaisted:
The Aspect Calculus. CADE 2019: 406-424 - [i3]David A. Plaisted:
Properties and Extensions of Alternating Path Relevance - I. CoRR abs/1905.08842 (2019) - 2017
- [j52]Maria Paola Bonacina
, David A. Plaisted:
Semantically-Guided Goal-Sensitive Reasoning: Inference System and Completeness. J. Autom. Reason. 59(2): 165-218 (2017) - 2016
- [j51]Maria Paola Bonacina, David A. Plaisted:
Semantically-Guided Goal-Sensitive Reasoning: Model Representation. J. Autom. Reason. 56(2): 113-141 (2016) - 2015
- [c49]David A. Plaisted:
History and Prospects for First-Order Automated Deduction. CADE 2015: 3-28 - 2014
- [c48]Maria Paola Bonacina, David A. Plaisted:
SGGS Theorem Proving: an Exposition. PAAR@IJCAR 2014: 25-38 - [c47]Maria Paola Bonacina, David A. Plaisted:
Constraint Manipulation in SGGS. UNIF 2014: 47-54 - 2013
- [c46]David A. Plaisted, Swaha Miller:
The Relative Power of Semantics and Unification. Programming Logics 2013: 317-344
2000 – 2009
- 2008
- [r1]Vladimir Lifschitz, Leora Morgenstern, David A. Plaisted:
Knowledge Representation and Classical Logic. Handbook of Knowledge Representation 2008: 3-88 - 2005
- [c45]Swaha Miller, David A. Plaisted:
The Space Efficiency of OSHL. TABLEAUX 2005: 217-230 - 2003
- [j50]David A. Plaisted, Adnan H. Yahya:
A relevance restriction strategy for automated deduction. Artif. Intell. 144(1-2): 59-93 (2003) - [j49]David A. Plaisted, Armin Biere, Yunshan Zhu:
A satisfiability procedure for quantified Boolean formulae. Discret. Appl. Math. 130(2): 291-328 (2003) - [i2]David A. Plaisted:
A Hierarchical Situation Calculus. CoRR cs.AI/0309053 (2003) - [i1]David A. Plaisted:
An Abstract Programming System. CoRR cs.SE/0306028 (2003) - 2002
- [j48]Adnan H. Yahya, David A. Plaisted:
Ordered Semantic Hyper Tableaux. J. Autom. Reason. 29(1): 17-57 (2002) - 2001
- [j47]Jürgen Avenhaus, David A. Plaisted:
General Algorithms for Permutations in Equational Inference. J. Autom. Reason. 26(3): 223-268 (2001) - [p1]Nachum Dershowitz, David A. Plaisted:
Rewriting. Handbook of Automated Reasoning 2001: 535-610 - 2000
- [j46]David A. Plaisted:
Special Cases and Substitutes for Rigid E-Unification. Appl. Algebra Eng. Commun. Comput. 10(2): 97-152 (2000) - [j45]David A. Plaisted, Yunshan Zhu:
Ordered Semantic Hyper-Linking. J. Autom. Reason. 25(3): 167-217 (2000)
1990 – 1999
- 1999
- [j44]David A. Plaisted, Gregory Kucherov:
The Complexity of Some Complementation Problems. Inf. Process. Lett. 71(3-4): 159-165 (1999) - [j43]Mauricio Osorio, Bharat Jayaraman, David A. Plaisted:
Theory of Partial-Order Programming. Sci. Comput. Program. 34(3): 207-238 (1999) - 1998
- [j42]M. Paramasivam, David A. Plaisted:
Automated Deduction Techniques for Classification in Description Logic Systems. J. Autom. Reason. 20(3): 337-364 (1998) - [c44]David A. Plaisted, Yunshan Zhu:
Replacement Rules with Definition Detection. FTP (LNCS Selection) 1998: 80-94 - 1997
- [b2]David A. Plaisted, Yunshan Zhu:
The efficiency of theorem proving strategies - a comparative and asymptotic analysis. Computational intelligence, Vieweg 1997, ISBN 978-3-528-05574-5, pp. I-VI, 1-167 - [j41]Heng Chu, David A. Plaisted:
CLIN-S - A Semantically Guided First-Order Theorem Prover. J. Autom. Reason. 18(2): 183-188 (1997) - [j40]M. Paramasivam, David A. Plaisted:
RRTP - A Replacement Rule Theorem Prover. J. Autom. Reason. 18(2): 221-226 (1997) - [c43]David A. Plaisted, Yunshan Zhu:
Ordered Semantic Hyper Linking. AAAI/IAAI 1997: 472-477 - [c42]David A. Plaisted, Yunshan Zhu:
Equational Reasoning using AC Constraints. IJCAI (1) 1997: 108-113 - 1996
- [j39]David A. Plaisted, Andrea Sattler-Klein:
Proof Lengths for Equational Completion. Inf. Comput. 125(2): 154-170 (1996) - [c41]David A. Plaisted, Geoffrey D. Alexander:
Propositional search efficiency and first-order theorem proving. Satisfiability Problem: Theory and Applications 1996: 335-350 - 1995
- [j38]Shie-Jue Lee, David A. Plaisted:
Controlling the Consumption of Storage with Sliding Priority Search in a Hyper-Linking Based Theorem Prover. Comput. Artif. Intell. 14(6): 563-578 (1995) - [j37]Amos R. Omondi, David A. Plaisted:
A model for the parallel execution of subset-equational languages. Future Gener. Comput. Syst. 11(3): 295-320 (1995) - 1994
- [j36]Shie-Jue Lee, David A. Plaisted:
Problem Solving by Searching for Models with a Theorem Prover. Artif. Intell. 69(1-2): 205-233 (1994) - [j35]Heng Chu, David A. Plaisted:
Model Finding in Semantically Guided Instance-Based Theorem Proving. Fundam. Informaticae 21(3): 221-235 (1994) - [j34]Ritu Chadha, David A. Plaisted:
Correctness of Unification Without Occur Check in Prolog. J. Log. Program. 18(2): 99-122 (1994) - [j33]Shie-Jue Lee, David A. Plaisted:
Use of replace rules in theorem proving. Methods Log. Comput. Sci. 1(2): 217-240 (1994) - [c40]David A. Plaisted:
The Search Efficiency of Theorem Proving Strategies. CADE 1994: 57-71 - [c39]Heng Chu, David A. Plaisted:
Semantically Guided First-Order Theorem Proving using Hyper-Linking. CADE 1994: 192-206 - 1993
- [j32]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. J. ACM 40(1): 1-16 (1993) - [j31]Ritu Chadha, David A. Plaisted:
On the Mechanical Derivation of Loop Invariants. J. Symb. Comput. 15(5/6): 705-744 (1993) - [c38]Heng Chu, David A. Plaisted:
Rough Resolution: A Refinement of Resolution to Remove Large Literals. AAAI 1993: 15-20 - [c37]Heng Chu, David A. Plaisted:
Model Finding Strategies in Semantically Guided Instance-based Theorem Proving. ISMIS 1993: 19-28 - [c36]Ritu Chadha, David A. Plaisted:
Finding Logical Consequences Using Unskolemization. ISMIS 1993: 255-264 - [c35]David A. Plaisted:
Polynomial Time Termination and Constraint Satisfaction Tests. RTA 1993: 405-420 - 1992
- [j30]Xumin Nie, David A. Plaisted:
A Semantic Backward Chaining Proof System. Artif. Intell. 55(1): 109-128 (1992) - [j29]Shie-Jue Lee, David A. Plaisted:
Eliminating Duplication with the Hyper-Linking Strategy. J. Autom. Reason. 9(1): 25-42 (1992) - [c34]Geoffrey D. Alexander, David A. Plaisted:
Proving Equality Theorems with Hyper-Linking. CADE 1992: 706-710 - [c33]David A. Plaisted, Geoffrey D. Alexander, Heng Chu, Shie-Jue Lee:
Conditional Term Rewriting and First-Order Theorem Proving. CTRS 1992: 257-271 - [c32]Shie-Jue Lee, David A. Plaisted:
Use of Unit Clauses and Clause Splitting in Automatic Deduction. ICCI 1992: 228-232 - 1991
- [j28]David A. Plaisted, Richard C. Potter:
Term Rewriting: Some Experimental Results. J. Symb. Comput. 11(1/2): 149-180 (1991) - [j27]Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted:
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . . . Theor. Comput. Sci. 83(1): 71-96 (1991) - 1990
- [j26]Jean H. Gallier, Paliath Narendran, David A. Plaisted, Wayne Snyder:
Rigid E-Unification: NP-Completeness and Applications to Equational Matings. Inf. Comput. 87(1/2): 129-195 (1990) - [j25]David A. Plaisted:
A Sequent-Style Model Elimination Strategy and a Positive Refinement. J. Autom. Reason. 6(4): 389-402 (1990) - [j24]David A. Plaisted:
A Heuristic Algorithm for Small Separators in Arbitrary Graphs. SIAM J. Comput. 19(2): 267-280 (1990) - [j23]Xumin Nie, David A. Plaisted:
Experimental Results on Subgoal Reordering. IEEE Trans. Computers 39(6): 845-848 (1990) - [c31]Xumin Nie, David A. Plaisted:
A Complete Semantic Back Chaining Proof System. CADE 1990: 16-27
1980 – 1989
- 1989
- [j22]Xumin Nie, David A. Plaisted:
Refinements to Depth-First Iterative-Deepening Search in Automatic Theorem Proving. Artif. Intell. 41(2): 223-235 (1989) - [c30]Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted:
Infinite Normal Forms (Preliminary Version). ICALP 1989: 249-262 - [c29]Bharat Jayaraman, David A. Plaisted:
Programming with Equations, Subsets, and Relations. NACLP 1989: 1051-1068 - 1988
- [j21]David A. Plaisted:
Non-Horn Clause Logic Programming Without Contrapositives. J. Autom. Reason. 4(3): 287-325 (1988) - [c28]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. CADE 1988: 182-196 - [c27]Richard C. Potter, David A. Plaisted:
Term Rewriting: Some Experimental Results. CADE 1988: 435-453 - [c26]David A. Plaisted:
A Goal Directed Theorem Prover. CADE 1988: 737 - [c25]Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted:
Rigid E-Unification is NP-Complete. LICS 1988: 218-227 - 1987
- [j20]David A. Plaisted, Jiarong Hong:
A Heuristic Triangulation Algorithm. J. Algorithms 8(3): 405-437 (1987) - [c24]David A. Plaisted:
A Logic for Conditional Term Rewriting Systems. CTRS 1987: 212-227 - [c23]Bharat Jayaraman, David A. Plaisted:
Functional programming with sets. FPCA 1987: 194-211 - 1986
- [j19]David A. Plaisted:
A Decision Procedure for Combinations of Propositional Temporal Logic and Other Specialized Theories. J. Autom. Reason. 2(2): 171-190 (1986) - [j18]David A. Plaisted, Steven Greenbaum:
A Structure-Preserving Clause Form Translation. J. Symb. Comput. 2(3): 293-304 (1986) - [c22]David A. Plaisted:
A Simple Non-Termination Test for the Knuth-Bendix Method. CADE 1986: 79-88 - [c21]David A. Plaisted:
Abstraction Using Generalization Functions. CADE 1986: 365-376 - [c20]Steven Greenbaum, David A. Plaisted:
The Illinois Prover: A General Purpose Resolution Theorem Prover. CADE 1986: 685-687 - [c19]J. Dean Brock, Amos R. Omondi, David A. Plaisted:
A Multiprocessor Architecture for Medium-Grain Parallelism. ICDCS 1986: 167-174 - [c18]David A. Plaisted, J. W. Curry:
Extensions to functional programming in Scheme. ISMIS 1986: 230-246 - [c17]David A. Plaisted:
The Denotional Semantics of Nondeterministic Recursive Programs using Coherent Relations. LICS 1986: 163-174 - 1985
- [j17]David A. Plaisted:
Semantic Confluence Tests and Completion Methods. Inf. Control. 65(2/3): 182-215 (1985) - [j16]David A. Plaisted:
The Undecidability of Self-Embedding for Term Rewriting Systems. Inf. Process. Lett. 20(2): 61-64 (1985) - [j15]Leo Bachmair, David A. Plaisted:
Termination Orderings for Associative-Commutative Rewriting Systems. J. Symb. Comput. 1(4): 329-349 (1985) - [j14]Nachum Dershowitz, David A. Plaisted:
Conditional rewriting. ACM SIGSOFT Softw. Eng. Notes 10(4): 55-59 (1985) - [j13]David A. Plaisted:
Complete Divisibility Problems for Slowly Utilized Oracles. Theor. Comput. Sci. 35: 245-260 (1985) - [c16]David A. Plaisted:
An Architecture for fast Data Movement in the FFP Machine. FPCA 1985: 147-163 - [c15]Leo Bachmair, David A. Plaisted:
Associative Path Orderings. RTA 1985: 241-254 - [c14]Nachum Dershowitz, David A. Plaisted:
Logic Programming cum Applicative Programming. SLP 1985: 54-66 - 1984
- [j12]David A. Plaisted:
Heuristic Matching for Graphs Satisfying the Triangle Inequality. J. Algorithms 5(2): 163-179 (1984) - [j11]David A. Plaisted:
Complete Problems in the First-Order Predicate Calculus. J. Comput. Syst. Sci. 29(1): 8-35 (1984) - [j10]David A. Plaisted:
The Occur-Check Problem in Prolog. New Gener. Comput. 2(4): 309-322 (1984) - [j9]David A. Plaisted:
New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. Theor. Comput. Sci. 31: 125-138 (1984) - [c13]David A. Plaisted:
Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving. CADE 1984: 356-374 - [c12]David A. Plaisted:
An Efficient Bug Location Algorithm. ICLP 1984: 151-157 - [c11]David A. Plaisted:
The Occur-Check Problem in Prolog. SLP 1984: 272-280 - 1983
- [j8]Kenneth J. Supowit, Edward M. Reingold, David A. Plaisted:
The Travelling Salesman Problem and Minimum Matching in the Unit Square. SIAM J. Comput. 12(1): 144-156 (1983) - [c10]Nachum Dershowitz, Jieh Hsiang, N. Alan Josephson, David A. Plaisted:
Associative-Commutative Rewriting. IJCAI 1983: 940-944 - [c9]David A. Plaisted:
A Low Level Language for Obtaining Decision Procedure for Classes of temporal Logics. Logic of Programs 1983: 403-420 - 1982
- [j7]David A. Plaisted:
A Simplified Problem Reduction Format. Artif. Intell. 18(2): 227-261 (1982) - [c8]Steven Greenbaum, A. Nagasaka, Paul O'Rorke, David A. Plaisted:
Comparison of Natural Deduction and Locking Resolution Implementations. CADE 1982: 159-171 - 1981
- [j6]David A. Plaisted:
Theorem Proving with Abstraction. Artif. Intell. 16(1): 47-108 (1981) - 1980
- [j5]David A. Plaisted, Samuel Zaks:
An NP-complete matching problem. Discret. Appl. Math. 2(1): 65-72 (1980) - [j4]David A. Plaisted:
The Application of Multivariate Polynomials to Inference Rules and Partial Tests for Unsatisfiability. SIAM J. Comput. 9(4): 698-705 (1980) - [c7]David A. Plaisted:
An Efficient Relevance Criterion for Mechanical Theorem Proving. AAAI 1980: 79-83 - [c6]David A. Plaisted:
Abstraction Mappings in Mechanical Theorem Proving. CADE 1980: 264-280 - [c5]David A. Plaisted:
On the Distribution of Independent Formulae of Number Theory. STOC 1980: 39-44 - [c4]Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold:
Heuristics for Weighted Perfect Matching. STOC 1980: 398-419
1970 – 1979
- 1979
- [j3]David A. Plaisted:
Fast Verification, Testing, and Generation of Large Primes. Theor. Comput. Sci. 9: 1-16 (1979) - 1978
- [j2]David A. Plaisted:
Some Polynomial and Integer Divisibility problems are NP-Hard. SIAM J. Comput. 7(4): 458-464 (1978) - 1977
- [j1]David A. Plaisted:
Sparse Complex Polynomials and Polynomial Reducibility. J. Comput. Syst. Sci. 14(2): 210-221 (1977) - [c3]David A. Plaisted:
New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems. FOCS 1977: 241-253 - 1976
- [b1]David A. Plaisted:
Theorem proving and semantic trees. Stanford University, USA, 1976 - [c2]David A. Plaisted:
Some Polynomial and Integer Divisibility Problems Are NP-Hard. FOCS 1976: 264-267 - 1972
- [c1]David A. Plaisted:
Flowchart Schemata with Counters. STOC 1972: 44-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
