Undecidability of the unification and admissibility problems for modal and description logics

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Frank Wolter University of Liverpool, Liverpool, U.K.
Michael Zakharyaschev Birkbeck College London, London, U.K.
Published in:
Cover Image
 
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 9 Issue 4, August 2008
Article No. 25
ACM New York, NY, USA
table of contents doi>10.1145/1380572.1380574
Undecidability of the unification and admissibility problems for modal and description logics Published by ACM 2008 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 20
· Downloads (cumulative): 214
· Citation Count: 5


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