Wos, Larry
Overview
Works:  53 works in 158 publications in 2 languages and 1,524 library holdings 

Genres:  Software 
Roles:  Author, Other, Editor 
Publication Timeline
.
Most widely held works by
Larry Wos
Automated reasoning : introduction and applications by
Larry Wos(
Book
)
25 editions published between 1984 and 1992 in English and Undetermined and held by 627 WorldCat member libraries worldwide
25 editions published between 1984 and 1992 in English and Undetermined and held by 627 WorldCat member libraries worldwide
Automated reasoning : 33 basic research problems by
Larry Wos(
Book
)
12 editions published between 1986 and 1988 in English and Undetermined and held by 264 WorldCat member libraries worldwide
12 editions published between 1986 and 1988 in English and Undetermined and held by 264 WorldCat member libraries worldwide
Automated reasoning and its applications : essays in honor of Larry Wos by
Robert Veroff(
Book
)
5 editions published in 1997 in English and held by 185 WorldCat member libraries worldwide
5 editions published in 1997 in English and held by 185 WorldCat member libraries worldwide
A fascinating country in the world of computing : your guide to automated reasoning by
Larry Wos(
Book
)
15 editions published in 1999 in English and held by 132 WorldCat member libraries worldwide
This book shows you — through examples and puzzles and intriguing questions — how to make your computer reason logically. To help you, the book includes a CDROM with OTTER, the world's most powerful generalpurpose reasoning program. The automation of reasoning has advanced markedly in the past few decades, and this book discusses some of the remarkable successes that automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design. Because the intended audience includes students and teachers, the book provides many exercises (with hints and also answers), as well as tutorial chapters that gently introduce readers to the field of logic and to automated reasoning in general. For more advanced researchers, the book presents challenging questions, many of which are still unsolved
15 editions published in 1999 in English and held by 132 WorldCat member libraries worldwide
This book shows you — through examples and puzzles and intriguing questions — how to make your computer reason logically. To help you, the book includes a CDROM with OTTER, the world's most powerful generalpurpose reasoning program. The automation of reasoning has advanced markedly in the past few decades, and this book discusses some of the remarkable successes that automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design. Because the intended audience includes students and teachers, the book provides many exercises (with hints and also answers), as well as tutorial chapters that gently introduce readers to the field of logic and to automated reasoning in general. For more advanced researchers, the book presents challenging questions, many of which are still unsolved
The automation of reasoning : an experimenter's notebook with OTTER tutorial by
Larry Wos(
Book
)
9 editions published in 1996 in English and held by 101 WorldCat member libraries worldwide
9 editions published in 1996 in English and held by 101 WorldCat member libraries worldwide
The collected works of Larry Wos by
Larry Wos(
Book
)
10 editions published in 2000 in English and held by 81 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features: (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and deep problems in mathematics and logic; (2) It provides a history of the field  from its earliest stages as mechanical theorem proving to its broad base now as automated reasoning; (3) It illustrates some of the remarkable successes automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design; (4) It includes a CDROM, with a searchable index of all the papers, enabling readers to peruse the papers easily for ideas
10 editions published in 2000 in English and held by 81 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features: (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and deep problems in mathematics and logic; (2) It provides a history of the field  from its earliest stages as mechanical theorem proving to its broad base now as automated reasoning; (3) It illustrates some of the remarkable successes automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design; (4) It includes a CDROM, with a searchable index of all the papers, enabling readers to peruse the papers easily for ideas
Automated reasoning and the discovery of missing and elegant proofs by
Larry Wos(
Book
)
2 editions published in 2003 in English and held by 18 WorldCat member libraries worldwide
2 editions published in 2003 in English and held by 18 WorldCat member libraries worldwide
The collected works of Larry Wos by
Larry Wos(
)
5 editions published in 2000 in English and held by 14 WorldCat member libraries worldwide
5 editions published in 2000 in English and held by 14 WorldCat member libraries worldwide
The collected works of Larry Wos by
Larry Wos(
Book
)
7 editions published in 2000 in English and held by 9 WorldCat member libraries worldwide
This twovolume work includes all the published papers of Dr Larry Wos. It illustrates some of the successes that automated reasoning programs have had in tackling problems in mathematics, logic, program verification and circuit design. The CDROM contains a searchable index of all the papers
7 editions published in 2000 in English and held by 9 WorldCat member libraries worldwide
This twovolume work includes all the published papers of Dr Larry Wos. It illustrates some of the successes that automated reasoning programs have had in tackling problems in mathematics, logic, program verification and circuit design. The CDROM contains a searchable index of all the papers
The Collected Works of Larry Wos (In 2 Vols) by
Larry Wos(
)
1 edition published in 2000 in English and held by 7 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features:. (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and d
1 edition published in 2000 in English and held by 7 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features:. (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and d
Theory institute in automated reasoning held at Argonne National Laboratory August 610, 1990 by
Larry Wos(
)
5 editions published between 1983 and 1990 in English and held by 6 WorldCat member libraries worldwide
On August 610, 1990, Argonne National Laboratory hosted a Theory Institute in Automated Reasoning. The institute was organized by the Mathematics and Computer Science Division and was supported by special funding from Argonne's Physical Research Program Administration. The focus of the Institute was on the obstacles confronting the effective automation of reasoning. The objective was to lay the groundwork for formulating a theory governing the interrelationship of representation, inference rule, and strategy. Here we summarize the activities that took place during the weeklong Institute. We also present an evaluation of the progress achievedprogress that includes the solution of challenge questions, the increasing use of both our database of problems and our automated reasoning program OTTER, and the discovery of new used for OTTER
5 editions published between 1983 and 1990 in English and held by 6 WorldCat member libraries worldwide
On August 610, 1990, Argonne National Laboratory hosted a Theory Institute in Automated Reasoning. The institute was organized by the Mathematics and Computer Science Division and was supported by special funding from Argonne's Physical Research Program Administration. The focus of the Institute was on the obstacles confronting the effective automation of reasoning. The objective was to lay the groundwork for formulating a theory governing the interrelationship of representation, inference rule, and strategy. Here we summarize the activities that took place during the weeklong Institute. We also present an evaluation of the progress achievedprogress that includes the solution of challenge questions, the increasing use of both our database of problems and our automated reasoning program OTTER, and the discovery of new used for OTTER
The collected works of Larry Wos by
Larry Wos(
)
1 edition published in 2000 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 2000 in English and held by 6 WorldCat member libraries worldwide
Searching for fixed point combinators by using automated theorem proving : a preliminary report by
Larry Wos(
)
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
In this report, we establish that the use of an automated theorem proving program to study deep questions from mathematics and logic is indeed an excellent move. Among such problems, we focus mainly on that concerning the construction of fixed point combinatorsa problem considered by logicians to be significant and difficult to solve, and often computationally intensive and arduous. To be a fixed point combinator, THETA must satisfy the equation THETAx = x(THETAx) for all combinators x. The specific questions on which we focus most heavily ask, for each chosen set of combinators, whether a fixed point combinator can be constructed from the members of that set. For answering questions of this type, we present a new, sound, and efficient method, called the kernel method, which can be applied quite easily by hand and very easily by an automated theoremproving program. For the application of the kernel method by a theoremproving program, we illustrate the vital role that is played by both paramodulation and demodulationtwo of the powerful features frequently offered by an automated theoremproving program for treating equality as if it is ''understood.'' We also state a conjecture that, if proved, establishes the completeness of the kernel method. From what we can ascertain, this methodwhich relies on the introduced concepts of kernel and superkerneloffers the first systematic approach for searching for fixed point combinators. We successfully apply the new kernel method to various sets of combinators and, for the set consisting of the combinators B and W, construct an infinite set of fixed point combinators such that no two of the combinators are equal even in the presence of extensionalitya law that asserts that two combinators are equal if they behave the same. 18 refs
4 editions published in 1988 in English and held by 6 WorldCat member libraries worldwide
In this report, we establish that the use of an automated theorem proving program to study deep questions from mathematics and logic is indeed an excellent move. Among such problems, we focus mainly on that concerning the construction of fixed point combinatorsa problem considered by logicians to be significant and difficult to solve, and often computationally intensive and arduous. To be a fixed point combinator, THETA must satisfy the equation THETAx = x(THETAx) for all combinators x. The specific questions on which we focus most heavily ask, for each chosen set of combinators, whether a fixed point combinator can be constructed from the members of that set. For answering questions of this type, we present a new, sound, and efficient method, called the kernel method, which can be applied quite easily by hand and very easily by an automated theoremproving program. For the application of the kernel method by a theoremproving program, we illustrate the vital role that is played by both paramodulation and demodulationtwo of the powerful features frequently offered by an automated theoremproving program for treating equality as if it is ''understood.'' We also state a conjecture that, if proved, establishes the completeness of the kernel method. From what we can ascertain, this methodwhich relies on the introduced concepts of kernel and superkerneloffers the first systematic approach for searching for fixed point combinators. We successfully apply the new kernel method to various sets of combinators and, for the set consisting of the combinators B and W, construct an infinite set of fixed point combinators such that no two of the combinators are equal even in the presence of extensionalitya law that asserts that two combinators are equal if they behave the same. 18 refs
The collected works of Larry Wos by
Larry Wos(
Book
)
2 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
2 editions published in 2000 in English and held by 5 WorldCat member libraries worldwide
On commutative prime power subgroups of the norm by
Larry Wos(
Book
)
4 editions published in 1957 in English and held by 5 WorldCat member libraries worldwide
4 editions published in 1957 in English and held by 5 WorldCat member libraries worldwide
Automated reasoning and its applications(
Book
)
3 editions published between 1994 and 1995 in English and held by 4 WorldCat member libraries worldwide
3 editions published between 1994 and 1995 in English and held by 4 WorldCat member libraries worldwide
The application of automated reasoning to proof translation and finding proofs with specified properties : a case study in
manyvalued sentential calculus by
Larry Wos(
Book
)
4 editions published between 1991 and 1992 in English and held by 4 WorldCat member libraries worldwide
In both mathematics and logic, many theorems exist such that each can be proved in entirely different ways. For a striking example, there exist theorems from group theory that can be proved by relying solely on equality and (from the viewpoint of automated reasoning) the use of paramodulation, but can also be proved in a notation in which equality is totally absent and the inference rule is condensed detachment (captured with a single clause and the rule hyperresolution). A study of such examples immediately shows how far from obvious is the problem of producing a proof in one system even in the presence of a proof in another; such problems can be viewed as ones of translation, where the rules of translation and the translation itself are frequently difficult to obtain. In this report, we discuss in detail various techniques that can be applied by the automated reasoning program OTTER to address the translation problem to obtain a proof in one notation and inference system given a proof in a completely different notation and inference system. To illustrate the techniques, we present a full treatment culminating in a successful translation'' of a proof of a theorem from manyvalued sentential calculus. To our delight and amazement, instead of the expected translation consisting of approximately 175 applications of condensed detachment, OTTER obtained a far shorter proof. We also touch on techniques for finding shorter proofs and techniques for finding proofs satisfying some given property
4 editions published between 1991 and 1992 in English and held by 4 WorldCat member libraries worldwide
In both mathematics and logic, many theorems exist such that each can be proved in entirely different ways. For a striking example, there exist theorems from group theory that can be proved by relying solely on equality and (from the viewpoint of automated reasoning) the use of paramodulation, but can also be proved in a notation in which equality is totally absent and the inference rule is condensed detachment (captured with a single clause and the rule hyperresolution). A study of such examples immediately shows how far from obvious is the problem of producing a proof in one system even in the presence of a proof in another; such problems can be viewed as ones of translation, where the rules of translation and the translation itself are frequently difficult to obtain. In this report, we discuss in detail various techniques that can be applied by the automated reasoning program OTTER to address the translation problem to obtain a proof in one notation and inference system given a proof in a completely different notation and inference system. To illustrate the techniques, we present a full treatment culminating in a successful translation'' of a proof of a theorem from manyvalued sentential calculus. To our delight and amazement, instead of the expected translation consisting of approximately 175 applications of condensed detachment, OTTER obtained a far shorter proof. We also touch on techniques for finding shorter proofs and techniques for finding proofs satisfying some given property
The collected works of Larry Wos by
Larry Wos(
)
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features: (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and deep problems in mathematics and logic; (2) It provides a history of the field  from its earliest stages as mechanical theorem proving to its broad base now as automated reasoning; (3) It illustrates some of the remarkable successes automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design; (4) It includes a CDROM, with a searchable index of all the papers, enabling readers to peruse the papers easily for ideas
1 edition published in 2000 in English and held by 4 WorldCat member libraries worldwide
Automated reasoning programs are successfully tackling challenging problems in mathematics and logic, program verification, and circuit design. This twovolume book includes all the published papers of Dr Larry Wos, one of the world's pioneers in automated reasoning. It provides a wealth of information for students, teachers, researchers, and even historians of computer science about this rapidly growing field. The book has the following special features: (1) It presents the strategies introduced by Wos which have made automated reasoning a practical tool for solving challenging puzzles and deep problems in mathematics and logic; (2) It provides a history of the field  from its earliest stages as mechanical theorem proving to its broad base now as automated reasoning; (3) It illustrates some of the remarkable successes automated reasoning programs have had in tackling challenging problems in mathematics, logic, program verification, and circuit design; (4) It includes a CDROM, with a searchable index of all the papers, enabling readers to peruse the papers easily for ideas
Konpyūta ni yoru suiron gihō(
Book
)
2 editions published in 1989 in Japanese and held by 4 WorldCat member libraries worldwide
2 editions published in 1989 in Japanese and held by 4 WorldCat member libraries worldwide
Solving open questions with an automated theoremproving program by
Larry Wos(
Book
)
3 editions published between 1979 and 1982 in English and held by 2 WorldCat member libraries worldwide
3 editions published between 1979 and 1982 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Pieper, Gail W. Other Author Editor
 Veroff, Robert Author
 Argonne National Laboratory
 McCune, W. (William) Author
 Lusk, Ewing Author
 United States Department of Energy
 Overbeek, Ross
 Argonne National Laboratory Mathematics and Computer Science Division
 川越, 恭二 1953
 United States Department of Energy Technical Information Center
Useful Links
Covers
Alternative Names
Larry Wos American mathematician
Larry Wos Amerikaans wiskundige
Larry Wos matemático estadounidense
Larry Wos matematico statunitense
Wos, L.
Wos, L. 1930
Wos, L. (Larry)
Wos Lawrence
Wos, Lawrence 1930
Wos Lawrence Thomas
Wos, Lawrence Thomas 1930
ウォス, L
ウォス, ラリー
Languages