DocumentCode
1992885
Title
Compilation of disjunctive logic programs using an extended WAM
Author
Shin, Dongha ; Hilton, Michael L.
Author_Institution
Div. of Comput. Technol., ETRI, Taejon, South Korea
fYear
1996
fDate
21-23 Aug 1996
Firstpage
138
Lastpage
144
Abstract
We show that disjunctive logic programs can be efficiently compiled to an extended version of Warren´s Abstract Machine (WAM). In this compilation, we use D.A. Plaisted´s (1988) Modified Problem Reaction Format (MPRF) as the basic proof procedure. Compilation of disjunctive logic programs is done in two stages: 1) the axioms and proof rules of MPRF are used to convert the disjunctive logic program into an equivalent Prolog program; and 2) this Prolog program is compiled to a WAM that has been modified to support efficient implementation of the axioms and splitting rule of MPRF. The modified WAM´s design and some measurements of its performance are presented
Keywords
PROLOG; logic programming; program compilers; MPRF; Modified Problem Reaction Format; Warren Abstract Machine; basic proof procedure; disjunctive logic program compilation; equivalent Prolog program; extended WAM; proof rules; splitting rule; Computer science; Logic design; Logic programming; Measurement;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Software and Applications Conference, 1996. COMPSAC '96., Proceedings of 20th International
Conference_Location
Seoul
ISSN
0730-3157
Print_ISBN
0-8186-7579-9
Type
conf
DOI
10.1109/CMPSAC.1996.544149
Filename
544149
Link To Document