SIGN IN
SIGN UP
Termination of programs in constraint query languages
Full Text:
PDF
Buy this Article
Authors:
A. Ghazal
The University of Illinois at Chicago
M. Aris Ouksel
The University of Illinois at Chicago
Published in:
· Proceeding
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Pages 266-270
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-647-6
doi>
10.1145/326619.326744
1994 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 4
· Downloads (cumulative): 138
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
experimentation
geometrical problems and computations
languages
logic expressions
management
measurement
performance
probabilistic algorithms
probabilistic algorithms
probabilistic computation
query languages
subsumption
termination
theory
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