Research Initiation: Compilation of Logic Programs for      Multiprocessor Computers
{'Code': '05010400', 'Directorate': {'Abbreviation': 'CSE', 'LongName': 'Direct For Computer & Info Scie & Enginr'}, 'Division': {'Abbreviation': 'CCF', 'LongName': 'Division of Computing and Communication Foundations'}}
{'SignBlockName': 'Forbes D. Lewis', 'PO_EMAI': None, 'PO_PHON': None}
Knowledge-based techniques are being used to solve an increasingly wide         range of complex problems and this has resulted in higher performance           demands for symbolic computation.  Researchers have therefore shown             great interest in exploiting the inherent parallelism in logic                  programming languages such as Prolog.  Among the many approaches which          have been proposed, DeGroot's Restricted And-Parallelism (RAP)                  execution model seems particularly promising.  This model is notable in         that it achieves a great deal of parallelism automatically, i.e.,               without explicit commands from the programmer, yet the run-time support         mechanisms have low overhead.  This is accomplished by compiling                programs into special control expressions, called Execution Graph               Expressions (EGEs), which initiate goals on the basis of tests on               program variables.                                                                                                                                              Research on the RAP model has focused primarily on the problem of               implementing EGEs efficiently on multiprocessor computers.  The                 research proposed here will focus on the complementary problem of               compiling clauses into EGEs.  A clause is first converted into a graph-         based computational form which achieves Maximal And-Parallelism.  This          graph is then gradually transformed into an EGE, potentially at a loss          of parallelism, using two rewrite rules over a hybrid execution model.          A specific compilation algorithms for Prolog using this framework will          be designed, developed and evaluated.
{'FirstName': 'Dean', 'LastName': 'Jacobs', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Dean Jacobs', 'EmailAddress': None, 'NSF_ID': '000467806', 'StartDate': '06/15/1988', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Southern California', 'CityName': 'LOS ANGELES', 'ZipCode': '90033', 'PhoneNumber': '2137407762', 'StreetAddress': '3720 S FLOWER ST FL 3', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'California', 'StateCode': 'CA', 'CONGRESSDISTRICT': '34', 'CONGRESS_DISTRICT_ORG': 'CA34', 'ORG_UEI_NUM': 'G88KLJR3KYT5', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF SOUTHERN CALIFORNIA', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '287500', 'Text': 'SYSTEM SOFTWARE'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1988&All=true', 'xml': '8807171.xml'}