Semantical characterizations and complexity of equivalences in answer set programming

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Thomas Eiter Technische Universität Wien, Vienna, Austria
Michael Fink Technische Universität Wien, Vienna, Austria
Stefan Woltran Technische Universität Wien, Vienna, Austria
Published in:
Cover Image
 
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 8 Issue 3, July 2007
Article No. 17
ACM New York, NY, USA
table of contents doi>10.1145/1243996.1244000
Semantical characterizations and complexity of equivalences in answer set programming Published by ACM 2007 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 23
· Downloads (cumulative): 299
· Citation Count: 27


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