Datalog vs first-order logic
dc.contributor.author | Ajtai, Miklos | en_US |
dc.contributor.author | Gurevich, Yuri | en_US |
dc.date.accessioned | 2006-04-10T17:43:56Z | |
dc.date.available | 2006-04-10T17:43:56Z | |
dc.date.issued | 1994-12 | en_US |
dc.identifier.citation | Ajtai, Miklos, Gurevich, Yuri (1994/12)."Datalog vs first-order logic." Journal of Computer and System Sciences 49(3): 562-588. <http://hdl.handle.net/2027.42/31164> | en_US |
dc.identifier.uri | http://www.sciencedirect.com/science/article/B6WJ0-4GX77T3-6/2/80470b72eba573e14bdb3f9c4abe265f | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/31164 | |
dc.description.abstract | Our main result is that every datalog query expressible in first-order logic is bounded; in terms of classical model theory it is a kind of compactness theorem for finite structures. In addition, we give some counter-examples delimiting the main result. | en_US |
dc.format.extent | 1460372 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 | Datalog vs first-order logic | en_US |
dc.type | Article | en_US |
dc.rights.robots | IndexNoFollow | en_US |
dc.subject.hlbsecondlevel | Philosophy | en_US |
dc.subject.hlbsecondlevel | Computer Science | en_US |
dc.subject.hlbtoplevel | Humanities | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, Michigan 48109-2122, USA | en_US |
dc.contributor.affiliationother | IBM Almaden Research Center, San Jose, California 95120, USA | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/31164/1/0000063.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1016/S0022-0000(05)80071-6 | en_US |
dc.identifier.source | Journal of Computer and System Sciences | 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.