Thumbnail
Access Restriction
Subscribed

Author Naughton, Jeffrey F.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1989
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract Recursive inference rules arise in recursive definitions in logic programming systems and in database systems with recursive query languages. Let $\textit{D}$ be a recursive definition of a relation $\textit{t}.$ $\textit{D}$ is considered $\textit{minimal}$ if for any predicate $\textit{p}$ in a recursive rule in $\textit{D},$ $\textit{p}$ must appear in a recursive rule in any definition of $\textit{t}.$ It is shown that testing for minimality is, in general, undecidable. However, an efficient algorithm for a useful class of recursive rules is presented, and it is used to transform a recursive definition to a minimal recursive definition. Evaluating the minimized definition avoids redundant computation without the overhead of caching intermediate results and run-time checking for duplicate goals.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1989-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 36
Issue Number 1
Page Count 23
Starting Page 69
Ending Page 91


Open content in new tab

   Open content in new tab
Source: ACM Digital Library