Monadic datalog over finite structures with bounded treewidth

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Georg Gottlob Oxford University
Reinhard Pichler TU Wien
Fang Wei TU Wien
Published in:
· Proceeding
PODS '07 Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Pages 165 - 174
ACM New York, NY, USA ©2007
table of contents ISBN: 978-1-59593-685-1 doi>10.1145/1265530.1265554
Monadic datalog over finite structures with bounded treewidth Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 20
· Downloads (cumulative): 271
· Citation Count: 9


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder