NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Efficient dynamic optimization of logic programsA summary is given of the dynamic optimization approach to speed up learning for logic programs. The problem is to restructure a recursive program into an equivalent program whose expected performance is optimal for an unknown but fixed population of problem instances. We define the term 'optimal' relative to the source of input instances and sketch an algorithm that can come within a logarithmic factor of optimal with high probability. Finally, we show that finding high-utility unfolding operations (such as EBG) can be reduced to clause reordering.
Document ID
19940008416
Acquisition Source
Legacy CDMS
Document Type
Technical Memorandum (TM)
Authors
Laird, Phil (NASA Ames Research Center Moffett Field, CA, United States)
Date Acquired
September 6, 2013
Publication Date
June 1, 1992
Subject Category
Cybernetics
Report/Patent Number
NASA-TM-109251
FIA-92-20
NAS 1.15:109251
Accession Number
94N12889
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Related Records

There are no records associated with this record.
No Preview Available