default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid A. Plaisted
- > Home > Persons > David A. Plaisted
Publications
- 2021
[c52]Geoff Sutcliffe, David A. Plaisted:
Management of the TPTP Problem Set. ARCADE@CADE 2021: 1- 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) - 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 - 2003
- [j49]David A. Plaisted, Armin Biere, Yunshan Zhu:
A satisfiability procedure for quantified Boolean formulae. Discret. Appl. Math. 130(2): 291-328 (2003) - 2001
- [p1]Nachum Dershowitz, David A. Plaisted:
Rewriting. Handbook of Automated Reasoning 2001: 535-610 - 2000
- [j45]David A. Plaisted, Yunshan Zhu:
Ordered Semantic Hyper-Linking. J. Autom. Reason. 25(3): 167-217 (2000) - 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 - [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 - 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) - 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) - 1989
- [c30]Nachum Dershowitz, Stéphane Kaplan, David A. Plaisted:
Infinite Normal Forms (Preliminary Version). ICALP 1989: 249-262 - 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 - [c25]Jean H. Gallier, Wayne Snyder, Paliath Narendran, David A. Plaisted:
Rigid E-Unification is NP-Complete. LICS 1988: 218-227 - 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) - [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 - 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 - 1980
- [c4]Kenneth J. Supowit, David A. Plaisted, Edward M. Reingold:
Heuristics for Weighted Perfect Matching. STOC 1980: 398-419
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:47 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:
