SIGN IN
SIGN UP
Variable independence for first-order definable constraints
Full Text:
Pdf
Buy this Article
Author:
Leonid Libkin
University of Toronto, Ontario, Canada
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 4 Issue 4, October 2003
Pages 431 - 451
ACM
New York, NY
, USA
table of contents
doi>
10.1145/937555.937557
2003 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 325
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
database applications
definable sets
expressions and their representation
first-order logic
languages
linear constraints
mathematical logic
numerical algorithms and problems
polynomial constraints
spatio-temporal databases
theory
variable independence
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder