Author: Claude Cordell Green
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 186
Book Description
The paper shows how a question-answering system can use first-order logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction algorithm is given whereby the system is able not only to produce yes or no answers but also to find or construct an object satisfying a specified condition. A working computer program, QA3, based on these ideas, is described. Methods are presented for solving state transformation problems. In addition to question-answering, the program can do automatic programming, control and problem solving for a simple robot, pattern recognition, and puzzles. (Author).
The Application of Theorem Proving to Question-answering Systems
Author: Claude Cordell Green
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 186
Book Description
The paper shows how a question-answering system can use first-order logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction algorithm is given whereby the system is able not only to produce yes or no answers but also to find or construct an object satisfying a specified condition. A working computer program, QA3, based on these ideas, is described. Methods are presented for solving state transformation problems. In addition to question-answering, the program can do automatic programming, control and problem solving for a simple robot, pattern recognition, and puzzles. (Author).
Publisher:
ISBN:
Category : Algorithms
Languages : en
Pages : 186
Book Description
The paper shows how a question-answering system can use first-order logic as its language and an automatic theorem prover, based upon the resolution inference principle, as its deductive mechanism. The resolution proof procedure is extended to a constructive proof procedure. An answer construction algorithm is given whereby the system is able not only to produce yes or no answers but also to find or construct an object satisfying a specified condition. A working computer program, QA3, based on these ideas, is described. Methods are presented for solving state transformation problems. In addition to question-answering, the program can do automatic programming, control and problem solving for a simple robot, pattern recognition, and puzzles. (Author).
˜Theœ Application of Theorem Proving to Question-answering Systems
Author: Claude C. Green
Publisher:
ISBN:
Category :
Languages : en
Pages : 324
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 324
Book Description
The Application of Theorem Proving to Question-answering Systems
Author: Claude Cordell Green
Publisher: Dissertations-G
ISBN:
Category : Computers
Languages : en
Pages : 192
Book Description
Publisher: Dissertations-G
ISBN:
Category : Computers
Languages : en
Pages : 192
Book Description
An Application of Theorem-proving to a Question-answering System Based on the Resolution Method
Author: Fung-Huey Hong
Publisher:
ISBN:
Category :
Languages : en
Pages : 226
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 226
Book Description
The Use of Theorem-proving Techniques in Question-answering Systems
Author: Claude Cordell Green
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Theorem Proving by Resolution as a Basis for Question Answering Systems
Author: SRI International
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages :
Book Description
Theorem Proving by Resolution as a Basic for Question- Answering Systems
Author: Cordell Green
Publisher:
ISBN:
Category :
Languages : en
Pages : 39
Book Description
Publisher:
ISBN:
Category :
Languages : en
Pages : 39
Book Description
Symbolic Logic and Mechanical Theorem Proving
Author: Chin-Liang Chang
Publisher: Academic Press
ISBN: 0080917283
Category : Mathematics
Languages : en
Pages : 349
Book Description
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Publisher: Academic Press
ISBN: 0080917283
Category : Mathematics
Languages : en
Pages : 349
Book Description
This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving and its applications. The book consists of three major parts. Chapters 2 and 3 constitute an introduction to symbolic logic. Chapters 4-9 introduce several techniques in mechanical theorem proving, and Chapters 10 an 11 show how theorem proving can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Automation of Reasoning
Author: J. Siekmann
Publisher: Springer Science & Business Media
ISBN: 3642819559
Category : Computers
Languages : en
Pages : 641
Book Description
"Kind of crude, but it works, boy, it works!" AZan NeweZZ to Herb Simon, Christmas 1955 In 1954 a computer program produced what appears to be the first computer generated mathematical proof: Written by M. Davis at the Institute of Advanced Studies, USA, it proved a number theoretic theorem in Presburger Arithmetic. Christmas 1955 heralded a computer program which generated the first proofs of some propositions of Principia Mathematica, developed by A. Newell, J. Shaw, and H. Simon at RAND Corporation, USA. In Sweden, H. Prawitz, D. Prawitz, and N. Voghera produced the first general program for the full first order predicate calculus to prove mathematical theorems; their computer proofs were obtained around 1957 and 1958, about the same time that H. Gelernter finished a computer program to prove simple high school geometry theorems. Since the field of computational logic (or automated theorem proving) is emerging from the ivory tower of academic research into real world applications, asserting also a definite place in many university curricula, we feel the time has corne to examine and evaluate its history. The article by Martin Davis in the first of this series of volumes traces the most influential ideas back to the 'prehistory' of early logical thought showing how these ideas influenced the underlying concepts of most early automatic theorem proving programs.
Publisher: Springer Science & Business Media
ISBN: 3642819559
Category : Computers
Languages : en
Pages : 641
Book Description
"Kind of crude, but it works, boy, it works!" AZan NeweZZ to Herb Simon, Christmas 1955 In 1954 a computer program produced what appears to be the first computer generated mathematical proof: Written by M. Davis at the Institute of Advanced Studies, USA, it proved a number theoretic theorem in Presburger Arithmetic. Christmas 1955 heralded a computer program which generated the first proofs of some propositions of Principia Mathematica, developed by A. Newell, J. Shaw, and H. Simon at RAND Corporation, USA. In Sweden, H. Prawitz, D. Prawitz, and N. Voghera produced the first general program for the full first order predicate calculus to prove mathematical theorems; their computer proofs were obtained around 1957 and 1958, about the same time that H. Gelernter finished a computer program to prove simple high school geometry theorems. Since the field of computational logic (or automated theorem proving) is emerging from the ivory tower of academic research into real world applications, asserting also a definite place in many university curricula, we feel the time has corne to examine and evaluate its history. The article by Martin Davis in the first of this series of volumes traces the most influential ideas back to the 'prehistory' of early logical thought showing how these ideas influenced the underlying concepts of most early automatic theorem proving programs.
A Forecast of Space Technology, 1980-2000
Author: United States. National Aeronautics and Space Administration. Scientific and Technical Information Office
Publisher:
ISBN:
Category : Interstellar communication
Languages : en
Pages : 340
Book Description
Publisher:
ISBN:
Category : Interstellar communication
Languages : en
Pages : 340
Book Description