The inference problem for template dependencies
dc.contributor.author | Gurevich, Yuri | en_US |
dc.contributor.author | Lewis, Harry R. | en_US |
dc.date.accessioned | 2006-04-07T17:47:31Z | |
dc.date.available | 2006-04-07T17:47:31Z | |
dc.date.issued | 1982 | en_US |
dc.identifier.citation | Gurevich, Yuri, Lewis, Harry R. (1982)."The inference problem for template dependencies." Information and Control 55(1-3): 69-79. <http://hdl.handle.net/2027.42/23841> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B7MFM-4DX44G9-138/2/3c9ad4ad34d32540d4d7daee934d0dc0 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/23841 | |
dc.description.abstract | A template dependency is a formalized integrity constraint on a relational database, stating that whenever tuples exist in the database that agree on certain attributes, an additional tuple must also be present that agrees with the others in a specified way. It is shown that the inference problem for template dependencies is undecidable, that is, there can be no algorithm for determining whether a given dependency is a logical consequence of a given finite set of dependencies. The undecidability result holds whether or not databases are considered to be necessarily finite. | en_US |
dc.format.extent | 551603 bytes | |
dc.format.extent | 3118 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Elsevier | en_US |
dc.title | The inference problem for template dependencies | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Science (General) | en_US |
dc.subject.hlbsecondlevel | Information and Library Science | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.subject.hlbtoplevel | Social Sciences | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | University of Michigan, Ann Arbor, Michigan 48109, USA | en_US |
dc.contributor.affiliationother | Aiken Computation Laboratory, Harvard University, 33 Oxford Street Cambridge, Massachusetts 02138, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/23841/1/0000080.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0019-9958(82)90420-X | en_US |
dc.identifier.source | Information and Control | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.