Application of theorem proving to problem solving

Authors:
Cordell Green
Affiliations:
Stanford Research Institute, Menlo Park, California
Venue:
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
Year:
1969

Citing 8
Cited 31

Experiments with a Heuristic Compiler

Journal of the ACM (JACM)
Fact Retrieval and Deductive Question-Answering Information Retrieval Systems

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Experiments with a deductive question-answering program

Communications of the ACM
The use of theorem-proving techniques in question-answering systems

ACM '68 Proceedings of the 1968 23rd ACM national conference
LISP 1.5 Programmer's Manual

LISP 1.5 Programmer's Manual
A computer program which "understands"

AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I

Knowledge systems: Principles and practice

IBM Journal of Research and Development
STORK and PENGUIN: logic programming systems using general clauses and defaults

IBM Journal of Research and Development
Act, and the rest will follow: exploiting determinism in planning as satisfiability

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Logic-Based Hybrid Agents

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Web Agents Cooperating Deductively

FAABS '00 Proceedings of the First International Workshop on Formal Approaches to Agent-Based Systems-Revised Papers
Minimal Answer Computation and SOL

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Software Construction and Analysis Tools for Future Space Missions

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Decision-Theoretic Control of Planetary Rovers

Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Amphion/NAV: Deductive Synthesis of State Estimation Software

Proceedings of the 16th IEEE international conference on Automated software engineering
GOLOG and PDDL: what is the relative expressiveness?

PCAR '06 Proceedings of the 2006 international symposium on Practical cognitive agents and robots
A Hole in Goal Trees: Some Guidance from Resolution Theory

IEEE Transactions on Computers
R69-31 A Formal Deductive Problem-Solving System

IEEE Transactions on Computers
Generating Programs Plus Proofs by Refinement

Verified Software: Theories, Tools, Experiments
Challenge to artificial intelligence: programming problems to be solved

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Explanation in the situation calculus

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Knowledge and reasoning in program synthesis

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Towards an Operational Semantics for Alloy

FM '09 Proceedings of the 2nd World Congress on Formal Methods
Challenges for action theories

Challenges for action theories
Preconditions for structural synthesis of programs

PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
A survey of automated deduction

Artificial intelligence today
The deductive synthesis of imperative LISP programs

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The Situation Calculus: A Case for Modal Logic

Journal of Logic, Language and Information
The deductive synthesis of imperative LISP programs

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Automatically generating universal attachments through compilation

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Software synthesis procedures

Communications of the ACM
Backward-Chaining flexible planning

ICMLC'05 Proceedings of the 4th international conference on Advances in Machine Learning and Cybernetics
Bugs, moles and skeletons: symbolic reasoning for software development

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Inductive rule learning on the knowledge level

Cognitive Systems Research
On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and Brouwer

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Program extrapolation with jennisys

Proceedings of the ACM international conference on Object oriented programming systems languages and applications

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper shows how an extension of the resolution proof procedure can be used to construct problem solutions. The extended proof procedure can solve problems involving state transformations. The paper explores several alternate problem representations and provides a discussion of solutions to sample problems including the "Monkey and Bananas" puzzle and the 'Tower of Hanoi" puzzle. The paper exhibits solutions to these problems obtained by QA3, a computer program bused on these theorem-proving methods. In addition, the paper shows how QA3 can write simple computer programs and can solve practical problems for a simple robot.