| 2006 |
|---|
| 86 | EE | Larry Wos:
Milestones for Automated Reasoning with Otter.
International Journal on Artificial Intelligence Tools 15(1): 3-20 (2006) |
| 2005 |
|---|
| 85 | EE | Larry Wos:
The Flowering of Automated Reasoning.
Mechanizing Mathematical Reasoning 2005: 204-227 |
| 84 | EE | Michael Beeson,
Robert Veroff,
Larry Wos:
Double-Negation Elimination in Some Propositional Logics.
Studia Logica 80(2-3): 195-234 (2005) |
| 2003 |
|---|
| 83 | EE | Michael Beeson,
Robert Veroff,
Larry Wos:
Double-Negation Elimination in Some Propositional Logics
CoRR cs.LO/0301026: (2003) |
| 82 | | Larry Wos:
The Strategy of Cramming.
J. Autom. Reasoning 30(2): 179-204 (2003) |
| 2002 |
|---|
| 81 | EE | Larry Wos:
A Spectrum of Applications of Automated Reasoning
CoRR cs.AI/0205078: (2002) |
| 80 | EE | Larry Wos,
Dolph Ulrich,
Branden Fitelson:
Vanquishing the XCB Question: The Methodology Discovery of the Last Shortest Single Axiom for the Equivalential Calculus
CoRR cs.LO/0211014: (2002) |
| 79 | EE | Larry Wos,
Dolph Ulrich,
Branden Fitelson:
XCB, the Last of the Shortest Single Axioms for the Classical Equivalential Calculus
CoRR cs.LO/0211015: (2002) |
| 78 | | William McCune,
Robert Veroff,
Branden Fitelson,
Kenneth Harris,
Andrew Feist,
Larry Wos:
Short Single Axioms for Boolean Algebra.
J. Autom. Reasoning 29(1): 1-16 (2002) |
| 77 | | Ruediger Thiele,
Larry Wos:
Hilbert's Twenty-Fourth Problem.
J. Autom. Reasoning 29(1): 67-89 (2002) |
| 76 | | Larry Wos,
Dolph Ulrich,
Branden Fitelson:
Vanquishing the XCB Question: The Methodological Discovery of the Last Shortest Single Axiom for the Equivalential Calculus.
J. Autom. Reasoning 29(2): 107-124 (2002) |
| 75 | | Zachary Ernst,
Branden Fitelson,
Kenneth Harris,
Larry Wos:
Shortest Axiomatizations of Implicational S4 and S5.
Notre Dame Journal of Formal Logic 43(3): 169-179 (2002) |
| 2001 |
|---|
| 74 | | Larry Wos:
Conquering the Meredith Single Axiom.
J. Autom. Reasoning 27(2): 175-199 (2001) |
| 73 | | Branden Fitelson,
Larry Wos:
Missing Proofs Found.
J. Autom. Reasoning 27(2): 201-225 (2001) |
| 72 | | Larry Wos:
A Milestone Reached and a Secret Revealed.
J. Autom. Reasoning 27(2): 89-95 (2001) |
| 71 | | Branden Fitelson,
Larry Wos:
Finding Missing Proofs with Automated Reasoning.
Studia Logica 68(3): 329-356 (2001) |
| 2000 |
|---|
| 70 | | Larry Wos,
Branden Fitelson:
Automating the Search for Answers to Open Questions.
TPHOLs 2000: 519-525 |
| 69 | | Larry Wos:
Appendix: Conjectures Concerning Proof, Design, and Verification.
TPHOLs 2000: 526-533 |
| 1999 |
|---|
| 68 | | Larry Wos,
Gail W. Pieper:
The Hot List Strategy.
J. Autom. Reasoning 22(1): 1-44 (1999) |
| 1998 |
|---|
| 67 | | Larry Wos:
Programs That Offer Fast, Flawless, Logical Reasoning.
Commun. ACM 41(6): 87-95 (1998) |
| 66 | | Larry Wos:
Automating the Search for Elegant Proofs.
J. Autom. Reasoning 21(2): 135-175 (1998) |
| 1997 |
|---|
| 65 | | William McCune,
Larry Wos:
Otter - The CADE-13 Competition Incarnations.
J. Autom. Reasoning 18(2): 211-220 (1997) |
| 1996 |
|---|
| 64 | | Larry Wos:
The Power of Combining Resonance with Heat.
J. Autom. Reasoning 17(1): 23-81 (1996) |
| 63 | | Larry Wos:
OTTER and the Moufang Identity Problem.
J. Autom. Reasoning 17(2): 215-257 (1996) |
| 1995 |
|---|
| 62 | | Larry Wos:
Searching for Circles of Pure Proofs.
J. Autom. Reasoning 15(3): 279-315 (1995) |
| 1994 |
|---|
| 61 | | Larry Wos,
Robert Veroff:
Logical basis for the automation of reasoning: Case studies.
Handbook of Logic in Artificial Intelligence and Logic Programming (2) 1994: 1-40 |
| 1993 |
|---|
| 60 | | Larry Wos:
The Problem of Automated Theorem Finding.
J. Autom. Reasoning 10(1): 137-138 (1993) |
| 59 | | Larry Wos:
The Problem of Selecting an Approach Based on Prior Success.
J. Autom. Reasoning 10(2): 283-284 (1993) |
| 58 | | Larry Wos:
The Kernel Strategy and Its Use for the Study of Combinatory Logic.
J. Autom. Reasoning 10(3): 287-343 (1993) |
| 57 | | Larry Wos:
The Problem of Reasoning by Analogy.
J. Autom. Reasoning 10(3): 421-422 (1993) |
| 56 | | Larry Wos:
The Problem of Naming and Function Replacement.
J. Autom. Reasoning 11(1): 147-148 (1993) |
| 55 | | Larry Wos:
The Problem of Reasoning by Case Analysis.
J. Autom. Reasoning 11(2): 289-291 (1993) |
| 54 | | Larry Wos:
The Problem of Induction.
J. Autom. Reasoning 11(3): 433-434 (1993) |
| 1992 |
|---|
| 53 | | Larry Wos:
The Impossibility of the Automation of Logical Reasoning.
CADE 1992: 1-3 |
| 52 | | William McCune,
Larry Wos:
Experiments in Automated Deduction with Condensed Detachment.
CADE 1992: 209-223 |
| 51 | | Ewing L. Lusk,
Larry Wos:
Benchmark Problems in Which Equality Plays the Major Role.
CADE 1992: 781-785 |
| 50 | | William McCune,
Larry Wos:
Application of Automated Deduction to the Search for Single Axioms for Exponent Groups.
LPAR 1992: 131-136 |
| 49 | | Larry Wos,
William McCune:
The Application of Automated Reasoning to Questions in Mathematics and Logic.
Ann. Math. Artif. Intell. 5(2-4): 321-369 (1992) |
| 48 | | Larry Wos:
The Problem of Choosing between Using and Avoiding Eqyality Predicates.
J. Autom. Reasoning 8(2): 307-309 (1992) |
| 47 | | Larry Wos:
The Problem of Reasoning from Inequalities.
J. Autom. Reasoning 8(3): 421-426 (1992) |
| 46 | | Larry Wos:
The Problem of Demodulation During Inference Rule Application.
J. Autom. Reasoning 9(1): 141-143 (1992) |
| 45 | | Larry Wos:
Note on McCune's Article on Discrimination Trees.
J. Autom. Reasoning 9(2): 145-146 (1992) |
| 44 | | Larry Wos:
The Problem of Demodulator Adjunction.
J. Autom. Reasoning 9(2): 289-290 (1992) |
| 43 | | Larry Wos:
The Problem of Demodulating Across Argument and Literal Boundaries.
J. Autom. Reasoning 9(3): 407-408 (1992) |
| 1991 |
|---|
| 42 | | Larry Wos:
Automated Reasoning and Bledsoe's Dream for the Field.
Automated Reasoning: Essays in Honor of Woody Bledsoe 1991: 297-345 |
| 41 | | Larry Wos,
Ross A. Overbeek,
Ewing L. Lusk:
Subsumption, a Sometimes Undervalued Procedure.
Computational Logic - Essays in Honor of Alan Robinson 1991: 3-40 |
| 40 | | Larry Wos:
The Problem of Finding a Restriction Strategy More Effective Than the Set of Support Strategy.
J. Autom. Reasoning 7(1): 105-107 (1991) |
| 39 | | Larry Wos:
The Problem of Choosing the Type of Subsumption to Use.
J. Autom. Reasoning 7(3): 435-438 (1991) |
| 38 | | Larry Wos:
The Problem of Choosing the Representation, Inference Rule, and Strategy.
J. Autom. Reasoning 7(4): 631-634 (1991) |
| 37 | | Larry Wos,
William McCune:
Automated Theorem Proving and Logic Programming.
J. Log. Program. 11(1&2): 1-53 (1991) |
| 36 | | William McCune,
Larry Wos:
The Absence and the Presence of Fixed Point Combinators.
Theor. Comput. Sci. 87(1): 221-228 (1991) |
| 1990 |
|---|
| 35 | | Larry Wos,
S. Winker,
William McCune,
Ross A. Overbeek,
Ewing L. Lusk,
Rick L. Stevens,
Ralph Butler:
Automated Reasoning Contributed to Mathematics and Logic.
CADE 1990: 485-499 |
| 34 | | Larry Wos:
The Problem of Choosing between Logic Programming and General-Purpose Automated Reasoning.
J. Autom. Reasoning 6(1): 77-78 (1990) |
| 33 | | Larry Wos:
The Problem of Finding a Mapping between Clause Representation and Natural-Deduction Representation.
J. Autom. Reasoning 6(2): 211-212 (1990) |
| 32 | | Larry Wos:
Meeting the Challenge of Fifty Years of Logic.
J. Autom. Reasoning 6(2): 213-232 (1990) |
| 31 | | Larry Wos:
The Problem of Finding a Semantic Strategy for Focusing Inference Rules.
J. Autom. Reasoning 6(3): 337-339 (1990) |
| 30 | | Larry Wos:
The Problem of Choosing between Predicate and Function Notation for Problem Representation.
J. Autom. Reasoning 6(4): 463-464 (1990) |
| 1989 |
|---|
| 29 | | Larry Wos:
The Problem of Finding an Inference Rule for Set Theory.
J. Autom. Reasoning 5(1): 93-95 (1989) |
| 28 | | Larry Wos:
The Problem of Determining the Size of a Complete Set of Reductions.
J. Autom. Reasoning 5(2): 235-237 (1989) |
| 27 | | Larry Wos:
The Problem of Guaranteeing the Existence of a Complete Set of Reductions.
J. Autom. Reasoning 5(3): 399-401 (1989) |
| 26 | | Larry Wos:
The Problem of Guaranteeing the Absence of a Complete Set of Reductions.
J. Autom. Reasoning 5(4): 531-532 (1989) |
| 1988 |
|---|
| 25 | | Larry Wos,
William McCune:
Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs.
CADE 1988: 714-729 |
| 24 | | Larry Wos:
The Problem of Finding a Strategy to Control Binary Paramodulation.
J. Autom. Reasoning 4(1): 101-107 (1988) |
| 23 | | Larry Wos:
The Problem of Explaining the Disparate Performance of Hyperresolution and Paramodulation.
J. Autom. Reasoning 4(2): 215-217 (1988) |
| 22 | | Larry Wos:
The Problem of Self-Analytically Choosing the Set of Support.
J. Autom. Reasoning 4(3): 327-329 (1988) |
| 21 | | Larry Wos:
The Problem of Self-Analytically Choosing the Weights.
J. Autom. Reasoning 4(4): 463-464 (1988) |
| 1987 |
|---|
| 20 | | Larry Wos:
Some Obstacles to the Automation of Reasoning and the Problem of Redundant Information.
J. Autom. Reasoning 3(1): 81-90 (1987) |
| 19 | | William McCune,
Larry Wos:
A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic.
J. Autom. Reasoning 3(1): 91-107 (1987) |
| 18 | | Larry Wos:
The Problem of Choosing the Inference Rule to Employ.
J. Autom. Reasoning 3(2): 201-209 (1987) |
| 17 | | Larry Wos:
The Problem of Extending the Set of Support Strategy.
J. Autom. Reasoning 3(3): 319-328 (1987) |
| 16 | | Larry Wos:
The Problem of Definition Expansion and Contraction.
J. Autom. Reasoning 3(4): 433-435 (1987) |
| 1986 |
|---|
| 15 | | Larry Wos,
William McCune:
Negative Paramodulation.
CADE 1986: 229-239 |
| 14 | | 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) |
| 1985 |
|---|
| 13 | | Larry Wos:
Editorial: A Journal Is Born.
J. Autom. Reasoning 1(1): 1-3 (1985) |
| 12 | | Larry Wos:
What Is Automated Reasoning?
J. Autom. Reasoning 1(1): 6-9 (1985) |
| 1984 |
|---|
| 11 | | Larry Wos,
Robert Veroff,
B. Smith,
William McCune:
The Linked Inference Principle, II: The User's Viewpoint.
CADE 1984: 316-332 |
| 10 | | Larry Wos,
S. Winker,
B. Smith,
Robert Veroff,
Lawrence J. Henschen:
A New Use of an Automated Reasoning Assistant: Open Questions in Equivalential Calculus and the Study of Infinite Domains.
Artif. Intell. 22(3): 303-356 (1984) |
| 1983 |
|---|
| 9 | | Larry Wos:
Automated Reasoning: Real Uses and Potential Uses.
IJCAI 1983: 867-876 |
| 1982 |
|---|
| 8 | | Larry Wos:
Solving Open Questions with an Automated Theorem-Proving Program.
CADE 1982: 1-31 |
| 7 | | S. K. Winker,
Larry Wos:
Procedure Implementation Through Demodulation and Related Tricks.
CADE 1982: 109-131 |
| 1980 |
|---|
| 6 | | Larry Wos,
Ross A. Overbeek,
Lawrence J. Henschen:
Hyperparamodulation: A Refinement of Paramodulation.
CADE 1980: 208-219 |
| 1976 |
|---|
| 5 | | John D. McCharen,
Ross A. Overbeek,
Larry Wos:
Problems and Experiments for and with Automated Theorem-Proving Programs.
IEEE Trans. Computers 25(8): 773-782 (1976) |
| 1974 |
|---|
| 4 | | Lawrence J. Henschen,
Ross A. Overbeek,
Larry Wos:
A Theorem-Proving Language for Experimentation.
Commun. ACM 17(6): 308-314 (1974) |
| 3 | EE | Lawrence J. Henschen,
Larry Wos:
Unit Refutations and Horn Sets.
J. ACM 21(4): 590-605 (1974) |
| 1967 |
|---|
| 2 | EE | Larry Wos,
George A. Robinson,
Daniel F. Carson,
Leon Shalla:
The Concept of Demodulation in Theorem Proving.
J. ACM 14(4): 698-709 (1967) |
| 1965 |
|---|
| 1 | EE | Larry Wos,
George A. Robinson,
Daniel F. Carson:
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving.
J. ACM 12(4): 536-541 (1965) |
