(Enter summary)
Abstract: Introduction
Many researchers who study the theoretical aspects of inference systems believe
that if inference rule A is complete and more restrictive than inference rule B, then
the use of A will lead more quickly to proofs than will the use of B. The literature
contains many statements of the sort "our rule is complete and it heavily prunes the
search space; therefore it is efficient". This is nonsense. Such researchers have little
or no experience with the practical use of automated... (Update)
Context of citations to this paper: More
...to prove that any of these conditions follow from the axioms. Then, in 1996, with the development of a new theorem prover called EQP [McCune, 1997b] the problem was cracked. The 133 step solution, which relied on a technique known as associativecommutative unification [Stickel,...
Cited by: More
Visualising First-Order Proof Search - Steel (2005)
(Correct)
Theory and Implementation of an Efficient Tactic-Based Logical.. - Nogin (2002)
(Correct)
The New WALDMEISTER Loop at Work - Gaillourdet, Hillenbrand, Löchner.. (2003)
(Correct)
Similar documents (at the sentence level):
76.7%: 33 Basic Test Problems: A Practical Evaluation of Some.. - McCune (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Rewrite Proofs and Computations - Jouannaud (1995)
(Correct)
0.2: The Hot List Strategy - Wos, Pieper (1997)
(Correct)
0.2: Experiments with the Hot List Strateg - Wos (1997)
(Correct)
Similar documents based on text: More All
0.1: OTTER 3.0 Reference Manual and Guide - McCune (1994)
(Correct)
0.1: Otter: The CADE-13 Competition Incarnations - McCune, Wos (1997)
(Correct)
0.1: Rewrite-based Deduction and Symbolic Constraints - Nieuwenhuis (1997)
(Correct)
Related documents from co-citation: More All
17: Argonne National Laboratory (context) - McCune - 1994
12: Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
8: Robbins Algebra: Conditions That Make a Near-Boolean Algebra Boolean (context) - Winker - 1990
BibTeX entry: (Update)
W. McCune. 33 basic test problems: A practical evaluation of some paramodulation strategies. Preprint ANL/MCS-P618-1096, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1996. http://citeseer.ist.psu.edu/article/mccune96basic.html More
@misc{ mccune96basic,
author = "W. McCune",
title = "basic test problems: A practical evaluation of some paramodulation strategies",
text = "W. McCune. 33 basic test problems: A practical evaluation of some paramodulation
strategies. Preprint ANL/MCS-P618-1096, Mathematics and Computer Science
Division, Argonne National Laboratory, Argonne, IL, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/article/mccune96basic.html" }
Citations (may not include all citations):
272
Argonne National Laboratory (context) - McCune, Reference et al. - 1994
74
Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
67
Paramodulation and theorem-proving in first-order theories w.. (context) - Robinson, Wos - 1969
64
Basic superposition is complete (context) - Niewenhuis, Rubio - 1992
62
A unification algorithm for associative-commutative function.. (context) - Stickel - 1981
52
On word problems in equational theories (context) - Hsiang, Rusinowitch - 1987
44
Experiments with discrimination tree indexing and path index..
- McCune - 1992
34
A technique for establishing completeness results in theorem.. (context) - Peterson - 1983
30
Robbins algebra: Conditions that make a near-Boolean algebra.. (context) - Winker - 1990
27
Experiments in automated deduction with condensed detachment (context) - McCune, Wos - 1992
26
An algorithm to generate the basis of solutions to homogeneo.. (context) - Huet - 1978
25
Automated Deduction in Equational Logic and Cubic Curves
- McCune, Padmanabhan - 1996
23
The concept of demodulation in theorem proving (context) - Wos, Robinson et al. - 1967
22
Only prime superpositions need be considered in the Knuth-Be.. (context) - Kapur, Musser et al. - 1988
22
RRL: Rewrite rule laboratory user's manual (context) - Kapur, Zhang - 1989
18
The Automation of Reasoning: An Experimenter's Notebook with.. (context) - Wos - 1996
9
Distributed theorem proving by Peers (context) - Bonacina, McCune - 1994
5
A case study of the completion procedure: Proving ring commu.. (context) - Kapur, Zhang - 1991
5
Automating the search for elegant proofs
- Wos - 1996
3
University of Texas at Austin (context) - Lankford, Tech et al. - 1975
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ese-metz.fr.html): More
ObjectProDSP Developer's Reference - Budnik (1994)
(Correct)
The Perl Data Structures Cookbook: General Tips - Christiansen (1995)
(Correct)
Switch-Borne Router for High Performance Packet Forwarding .. - Hoymany, Mossé (1996)
(Correct)
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