Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Robert S. Boyer
2000 – 2009
- 2006
[c13]Robert S. Boyer, Warren A. Hunt Jr.: Function memoization and unique object representation for ACL2 functions. ACL2 2006: 81-89- 2005
[j12]Robert S. Boyer, Wilfred J. Legato, Victor W. Marek: Toward Automating the Discovery of Decreasing Measures. J. Autom. Reasoning 35(4): 355-371 (2005)
[c12]Robert S. Boyer, Warren A. Hunt Jr., Serita M. Nelesen: A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance. WABI 2005: 353-364- 2002
[j11]Robert S. Boyer, W. H. J. Feijen, David Gries, C. A. R. Hoare, Jayadev Misra, J. Moore, H. Richards: In memoriam: Edsger W. Dijkstra 1930-2002. Commun. ACM 45(10): 21-22 (2002)
[c11]
1990 – 1999
- 1998
[b2]Robert S. Boyer, J. Strother Moore: A computational logic handbook (2. ed.). Academic Press international series in formal methods, Academic Press 1998, ISBN 978-0-12-122955-9, pp. I-XXV, 1-518- 1996
[j10]Michael Ballantyne, Robert S. Boyer, Larry M. Hines: Woody Bledsoe - His Life and Legacy. AI Magazine 17(1): 7-20 (1996)
[j9]- 1994
[c10]Robert S. Boyer: Panel Discussion: A Mechanically Proof-Checked Encyclopedia of Mathematics: Should We Build One? Can We? CADE 1994: 237- 1992
[c9]- 1991
[c8]Anne Olivia Boyer, Robert S. Boyer: A Biographical Sketch of W. W. Bledsoe. Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 1-30
[c7]Robert S. Boyer, J. Strother Moore: MJRTY: A Fast Majority Vote Algorithm. Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 105-118- 1990
[c6]
1980 – 1989
- 1989
[j8]Hassan Aït-Kaci, Robert S. Boyer, Patrick Lincoln, Roger Nasr: Efficient Implementation of Lattice Operations. ACM Trans. Program. Lang. Syst. 11(1): 115-146 (1989)- 1988
[j7]Robert S. Boyer, J. Strother Moore: The Addition of Bounded Quantification and Partial Functions to A Computational Logic and Its Theorem Prover. J. Autom. Reasoning 4(2): 117-172 (1988)- 1986
[j6]Robert S. Boyer, Ewing L. Lusk, William McCune, Ross A. Overbeek, Mark E. Stickel, Larry Wos: Set Theory in First-Order Logic: Clauses for Gödel's Axioms. J. Autom. Reasoning 2(3): 287-327 (1986)
[c5]Robert S. Boyer, J. Strother Moore: Overview of a Theorem-Prover for A Computational Logic. CADE 1986: 675-678- 1985
[j5]- 1984
[j4]Robert S. Boyer, J. Strother Moore: A Mechanical Proof of the Unsolvability of the Halting Problem. J. ACM 31(3): 441-458 (1984)- 1980
[b1]Robert S. Boyer, J. Strother Moore: A computational logic. ACM monograph series, Academic Press 1980, ISBN 978-0-12-122950-4, pp. I-XIV, 1-397
1970 – 1979
- 1977
[j3]Robert S. Boyer, J. Strother Moore: A Fast String Searching Algorithm. Commun. ACM 20(10): 762-772 (1977)
[c4]Robert S. Boyer, J. Strother Moore: A Lemma Driven Automatic Theorem Prover for Recursive Function Theory. IJCAI 1977: 511-519- 1976
[c3]Robert S. Boyer, J. Strother Moore, Robert E. Shostak: Primitive Recursive Program Transformations. POPL 1976: 171-174- 1975
[j2]Robert S. Boyer, J. Strother Moore: Proving Theorems about LISP Functions. J. ACM 22(1): 129-144 (1975)- 1973
[c2]- 1972
[j1]W. W. Bledsoe, Robert S. Boyer, William H. Henneman: Computer Proofs of Limit Theorems. Artif. Intell. 3(1-3): 27-60 (1972)- 1971
[c1]W. W. Bledsoe, Robert S. Boyer, William H. Henneman: Computer Proofs of Limit Theorems. IJCAI 1971: 586-600
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 21:11 CET by the dblp team



