ACM Home Page
Please provide us with feedback. Feedback
Goal-directed semantic tutor
Full text PdfPdf (434 KB)
Source International conference on Industrial and engineering applications of artificial intelligence and expert systems archive
Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 table of contents
Tullahoma, Tennessee, United States
Pages: 171 - 176  
Year of Publication: 1988
ISBN:0-89791-271-3
Authors
Hikyoo Koh  Lamar Univ., Beaumont, TX
Daniel Ming-Jen Wu  Lamar Univ., Beaumont, TX
Sponsor
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 6,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/51909.51930
What is a DOI?

ABSTRACT

An efficient Pascal semantic tutoring system is being built that aims at detecting and correcting semantic errors in Pascal programs after programs have been successfully compiled. In order to determine that an input program is correct (more precisely, the program seems to be correct), we attempt to compare the program against certain properties deemed necessary for a correct program. Basic approaches taken include: A problem description which an input program is intended to solve is converted to several properties called, goals, all of which a correct input program must satisfy. From each goal, plans are established which become the conditioin parts of production rules. The action parts of production rules contain certain effects that reflect consequences of goals so far satisfied by the input test program. The input test program is converted to an equivalent LISP expression that preserves the program semantic with such auxiliary words as BEGIN, END, DO, TO, ELSE, THEN eliminated. The resulting expression is more suitable for comparison against aforementioned plans.Pattern symbols and pattern variables are used to facilitate more flexible and powerful pattern matching. In addition, association lists are used to keep track of variables that are actually used in the input test program.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
Carbonell, J.R.,"AI in CAI: An Artificial Intelligence Approacg to Computer-Assisted Instruction, "IEEE Transaction on Man Machine Systems, Dec 1977,pp.190-202.
4
 
5
Rychener Michael D., Production Systems as a Programming Language for Artificial Intelligence Applications computer science Department, Carnegie-Mellon University 1975.
 
6
 
7
 
8
Wertz,- H., Stereotyped Program Debugging: An aid for Novice Progammers," International Journal of Man-Machine Studies, No. 16, 1982, PP. 379-392.
 
9

Collaborative Colleagues:
Hikyoo Koh: colleagues
Daniel Ming-Jen Wu: colleagues