Emula%ing Prolog in an IBM PC APL Environment Maria J. Tobar and M. Alfonseca Introduction Since P R O L O G is a highly used language in Artificial Intelligence applications, it has been our aim to test the APL capabilities to emulate it, in this way combining the properties of both languages in a single system, where A P L would provide its number-crunching and file handling facilities, while PROLOG-like A P L functions would make it possible to perform logical inferences in a non-procedural environment. All the work took place in a Personal Computer, using IBM PC APL as the basis syst,em. PROLOG operates with the so-called Horn's clauses formed by u conjunction of affirmative propositions. The answer to a certain goal is obtained by using Robinson's Resolution Principle, i.e. checking t h a t the set formed by the premises in the negation of the goal is inconsistent. It can be proved t h a t this process is complete and correct. The fact t h a t a generally accepted PROLOG standard does not exist has the consequence that almost each PROLOG system available is unique and incompatible with the others. On the one
/lp/association-for-computing-machinery/emulating-prolog-in-an-ibm-pc-apl-environment-Lv1SPji9Ca