Benjamin Price Shults  Home/Search
Context
Related
| wcu.edu/~shults/IPR/dissnew.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wcu.edu/~shults/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: vii List of Figures xii Chapter 1. (Update)
Similar documents (at the sentence level):
9.1%: Comprehension and Description in Tableaux - Shults (1997) (Correct)
Active bibliography (related documents): More All
5.8: Discoveries and Experiments in the Automation of Mathematical.. - Shults (1997) (Correct)
2.1: A Framework for Using Knowledge in Tableau Proofs - Shults (1997) (Correct)
1.7: The Creation and Use of a Knowledge Base of Mathematical Theorems .. - Shults (1995) (Correct)
Similar documents based on text: More All
0.2: A Mechanized Framework For Specifying Problem Domains And.. - Subramanian (1993) (Correct)
0.2: Interactive Verification Exploiting Program Design Knowledge: A .. - Kaltenbach (1996) (Correct)
0.2: Teaching Data Structures: Thread Safety and Components - Shults (2002) (Correct)
BibTeX entry: (Update)
@misc{ shults-discoveries,
author = "Benjamin Price Shults",
title = "Discoveries and Experiments in the Automation of Mathematical Reasoning",
url = "citeseer.ist.psu.edu/article/shults02discoveries.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jounnaud - 1990
634 A machine-oriented logic based on the resolution principle (context) - Robinson - 1965
384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
322 First-Order Logic and Automated Theorem Proving (context) - Fitting - 1996
229 A Document Preparation System (context) - Lamport - 1994
187 HOL: A proof generating system for higher-order logic (context) - Gordon - 1989
168 Rippling: A heuristic for guiding inductive proofs - Bundy, Stevens et al. - 1993
151 An Introduction to Mathematical Logic and Type Theory: To Tr.. (context) - Andrews - 1986
146 Investigation into logical deduction (context) - Gentzen - 1969
139 Recursive functions of symbolic expressions and their comput.. - McCarthy - 1960
133 Ordered tableaux: Extensions and applications - Hhnle, Pape - 1997
111 Fast decision procedures based on congruence closure (context) - Nelson, Oppen - 1980
99 IMPS: An interactive mathematical proof system - Farmer, Guttman et al. - 1993
86 Cambridge University Press (context) - Wolfram, Book - 1996
78 Controlled integration of the cut rule into connection table.. - Letz, Mayr et al. - 1994
75 Topology: A First Course (context) - Munkres - 1975
68 Automated Reasoning: Introduction and Applications (context) - Wos, Overbeek et al. - 1992
62 Solution of the Robbins problem - McCune
59 and Applications (context) - Abraham, Marsden et al. - 1988
52 TPS: A theorem proving system for classical type theory - Andrews, Bishop et al. - 1994
50 Automated Reasoning: 33 Basic Research Problems (context) - Wos - 1988
49 Analogy for Automated Reasoning (context) - Owen - 1990
49 HARP: A tableau-based theorem prover (context) - Oppacher, Suen - 1988
49 The Computer Modelling of Mathematical Reasoning (context) - Bundy - 1983
48 Hyper Tableaux - Baumgartner, Furbach et al. - 1996
48 PROTEIN: A PROver with a Theory Extension Interface - Baumgartner, Furbach - 1994
47 The Foundations of Mathematics (context) - Beth - 1959
42 Symbolic Logic and Mechanical Theorem Proving (context) - Chang, Lee - 1973
41 Caching and lemmaizing in model elimination theorem provers - Astrachan, Stickel - 1992
41 An algorithm for reasoning about equality (context) - Shostak - 1978
39 from foundations to functions (context) - Paulson, for - 1993
38 Non-resolution theorem proving (context) - Bledsoe - 1977
37 A Prolog technology theorem prover: a new exposition and imp.. - Stickel - 1992
33 Completion for rewriting modulo a congruence (context) - Bachmair, Dershowitz - 1989
33 Taxonomic syntax for first order inference - McAllester, Givan - 1993
33 A completion-based method for mixed universal and rigid E-un.. (context) - Beckert - 1994
32 Natural language syntax and first order inference - McAllester, Givan - 1992
29 Algernon -- a tractable system for knowledge representation - Crawford, Kuipers - 1991
28 First-order theorem proving using conditional rewrite rules (context) - Zhang, Kapur
28 Automated Development of Fundamental Mathematical Theories (context) - Quaife - 1992
28 An improved proof procedure (context) - Prawitz
28 unification is NP-complete (context) - Gallier, Snyder et al. - 1988
28 An Investigation of the Laws of Thought (context) - Boole - 1954
27 Automating higherorder logic (context) - Andrews, Miller et al. - 1984
25 A simplified format for the model elimination procedure (context) - Loveland - 1969
24 Integrating logical functions with ILF - Dahn, Gehne et al. - 1994
24 Variable elimination and chaining in a resolution-based prov.. (context) - Bledsoe, Hines - 1980
24 The Boyer-Moore theorem prover and its interactive enhanceme.. - Boyer, Kaufmann et al. - 1995
23 A theorem prover for a computational logic - Boyer, Moore - 1990
21 Natural language based inference procedures applied to Schub.. - Givan, McAllester et al. - 1991
21 A model elimination calculus with built-in theories - Baumgartner - 1992
20 The Principles of Mathematics Revisited (context) - Hintikka - 1996
19 New results on local inference relations - Givan, McAllester - 1992
18 tableau-based deduction (context) - Beckert, Posegga et al. - 1995
18 Mathematics and Plausible Reasoning (context) - Polya - 1954
18 Tensor Analysis on Manifolds (context) - Bishop, Goldberg
18 Parthenon: a parallel theorem prover for non-horn clauses (context) - Bose, Clarke et al. - 1992
17 Proving theorems by pattern recognition (context) - Wang
16 How to Read and Do Proofs (context) - Solow - 1982
16 Toward mechanical mathematics (context) - Wang
16 SETHEO: A highperfomance theorem prover (context) - Letz, Schumann et al. - 1992
16 Non-elementary speedups between different versions of tablea.. (context) - Baaz, Fermller - 1995
15 METEOR: Exploring model elimination theorem proving - Astrachan - 1994
14 Seventy-five problems for testing automatic theorem provers (context) - Pelletier - 1986
14 The tableau-based theorem prover 3 T A P for multiple-valued.. (context) - Beckert, Gerberding et al. - 1992
14 IMPS: System description - Farmer, Guttman et al. - 1992
13 A man-machine theorem-proving system (context) - Bledsoe, Bruell - 1974
12 Grammar rewriting - McAllester - 1992
12 Computable Set Theory (context) - Cantone, Ferro et al. - 1989
11 An equational approach to theorem proving in first-order pre.. (context) - Kapur, Narendran - 1985
11 Empirical explorations of the geometrytheorem proving machin.. (context) - Gelernter, Hansen et al.
10 Adding equality to semantic tableaux - Beckert - 1994
10 Gazing: An approach to the problem of definition and lemma u.. (context) - Barker-Plummer - 1992
10 Van Nostrand Company (context) - Kelley, The et al. - 1955
10 Through the Looking Glass: And What Alice Found There (context) - Carroll - 1996
9 Mechanical Geometry Theorem Proving (context) - Chou - 1988
9 Proving properties of continuous systems: qualitative simula.. - Shults, Kuipers - 1997
8 Lean induction principles for tableaux - Baaz, Egly et al. - 1997
8 Empirical explorations with the logic theory machine (context) - Newell, Shaw et al. - 1957
7 Subgoal alternation in model elimination (context) - Ibens, Letz - 1997
7 The Consistency of the Axiom of Choice and the Generalized C.. (context) - Gdel - 1940
7 Checking natural language proofs (context) - Simon - 1988
6 The prehistory and early history of automated deduction (context) - Davis - 1983
6 Splitting and reduction heuristics in automatic theorem prov.. (context) - Bledsoe
5 The Gazer theorem prover (context) - Barker-Plummer, Rothenberg - 1992
5 MGTP: A model generation theorem prover---its advanced featu.. (context) - Hasegawa - 1997
5 Towards the automation of set theory and its logic (context) - Brown - 1978
5 volume 23 of Perspectives in Computing (context) - Boyer, Moore et al. - 1988
4 Journal of Logic and Computation (context) - Hhnle, Klingenbeck - 1996
4 Herky: High performance rewriting in RRL (context) - Zhang - 1992
4 Hyper-chaining and knowledge-based theorem proving (context) - Hines - 1988
4 What is automated theorem proving (context) - Bledsoe, Henschen - 1985
4 Set Theory and its Logic (context) - Quine - 1969
4 MKRP: A proof development environment - Huang, Kerber et al. - 1994
4 Microelectronics and Computer Technology Corporation (context) - Bledsoe, on et al. - 1986
3 A journal is born. Journal of Automated Reasoning (context) - Wos - 1985
3 Presenting machine-found proofs (context) - Huang, Fiedler - 1996
3 Introduction of Mathematical Logic (context) - Mendelson - 1987
3 Constraint propagation of CP and CMGTP: Experiments on quasi.. (context) - Hasegawa, Shirai - 1994
3 A computer program for Presburger's algorithm (context) - Davis - 1957
3 Challenge problems in first-order theories (context) - Shults - 1996
3 The creation and use of a knowledge base of mathematical the.. - Shults - 1995
3 I had a dream: AAAI Presidential address (context) - Bledsoe
3 Interactive proof presentation (context) - Bledsoe - 1991
2 On machines which prove theorems (context) - Beth
2 A framework for the creation and use of a knowledge base of .. - Shults - 1995
2 match: An inference rule for incrementally constructing set .. (context) - Bailin, Barker-Plummer - 1993
2 second corrected edition (context) - Smullyan, Dover et al.
2 Axiomatic Set Theory: with a Historical Introduction by Abra.. (context) - Bernays
2 The central variable strategy of Str ve (context) - Hines - 1992
2 A framework for using knowledge in tableau proofs - Shults - 1997
2 Natural language proof in nested cells representation (context) - Buchberger - 1997
2 Acta Philosohica Fennica (context) - Hintikka, content et al. - 1955
1 This is a translation of the second edition of Grundzge der .. (context) - Hilbert, Ackermann et al. - 1950
1 Automated deduction in von Neumann-Bernays-Gdel set theory (context) - Quaife - 1992
1 Str ve 1 : The Str ve-based subset prover (context) - Hines - 1990
1 The even more liberalized d -rule in free variable semantic .. (context) - Beckert, Hhnle et al. - 1993
1 Deduction based on Shannon graphs (context) - Posegga - 1992
1 Automated reasoning: It cannot exist (context) - Wos - 1992
1 IPR and English proofs (context) - Shults - 1997
1 Completeness for linear regular negation normal form inferen.. - Hhnle, Murray et al. - 1997
1 Ontic: A Knowledge Representation Language for Mathematics (context) - McAllester - 1989
1 submitted to the Tableau Workshop (context) - Kohlhase - 1995
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC