PEARL(1)

NAME
pearl - PEARL AI programming language

SYNOPSIS
pearl

DESCRIPTION
Pearl is an AI programming language built on top of FRANZ LISP. PEARL (Package for Efficient Access to Representations in Lisp) was developed with space and time efficiencies in mind. In addition to providing the usual AI facilities such as slot-filler objects, demons and associative data bases, PEARL introduces stronger typing on slots, user-assisted hashing mechanisms, and a forest of data bases.

There are too many functions to list here; one should refer to the reports listed below.

AUTHORS
PEARL was implemented at Berkeley by Joseph Faletti and Michael Deering under the direction of Robert Wilensky. PEARL was originally implemented under UCILisp on a DEC 2040, moved without modification to a PDP 10 under TOPS 10, and then (with significant modification) to a VAX 11/780 under FRANZ LISP.

SEE ALSO
Deering, M., Faletti, J., and Wilensky, R. 1981. PEARL: An Efficient Language for Artificial Intelligence Programming. In the Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Vancouver, British Columbia. August, 1981.

Deering, M., Faletti, J., and Wilensky, R. 1982. The PEARL Users Manual. Berkeley Electronic Research Laboratory Memorandum No. UCB/ERL/M82/19. March, 1982.