SIGN IN
SIGN UP
Complexity and expressive power of logic programming
Full Text:
PDF
Buy this Article
Authors:
Evgeny Dantsin
Roosevelt University, Chicago, IL, USA
Thomas Eiter
Vienna University of Technology, Vienna, Austria
Georg Gottlob
Vienna University of Technology, Vienna, Austria
Andrei Voronkov
University of Manchester, Manchester, United Kingdom
2001 Article
Bibliometrics
· Downloads (6 Weeks): 9
· Downloads (12 Months): 174
· Downloads (cumulative): 3,946
· Citation Count: 178
Published in:
· Journal
ACM Computing Surveys (CSUR)
Surveys Homepage
archive
Volume 33 Issue 3, September 2001
Pages 374-425
ACM
New York, NY
, USA
table of contents
doi>
10.1145/502807.502810
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
complexity
complexity measures and classes
computational logic
datalog
expressive power
languages
logic programming
nonmonotonic logic
query languages
query languages
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