Computer aided evolutionary design for software engineering
ACM SIGART Bulletin
ACM Turing award lectures
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Overview of the programmer's apprentice
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
Dependency directed reasoning in the analysis of program modify complex data structure
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 2
A knowledge based program editor
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Domain specific debugging aids for novice programmers
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Meno-II: an intelligent tutoring system for novice programmers
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
The roles of knowledge and deduction in program synthesis
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
The layered architecture of a system for reasoning about programs
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
IAAI'92 Proceedings of the fourth conference on Innovative applications of artificial intelligence
Paper: Logic-based integrity constraints and the design of dental prostheses
Artificial Intelligence in Medicine
Hi-index | 0.00 |
This paper reports on the initial design and partial implementation of an interactive programming environment to be used by expert programmers. The system is based on three forms of program description: 1) definition of structured data objects, their parts, properties, and relations between them, 2) input-output specification of the behavior of program segments, and 3) a hierarchical representation of the internal structure of programs (plans). The plan representation is of major theoretical interest because it includes not only data flow and control flow relationships between subsegments of a program, but also goal-subgoal, prerequisite, and other logical dependencies between the specifications of the subsegments. Plans are utilized both for describing particular programs and in the compilation of a knowledge base of more abstract knowledge about programming, such as the concept of a loop and various specializations, such as enumeration loops and search loops. We also describe a deductive system which can verify the correctness of plans involving side effects on complex data with structure sharing.