SIGN IN
SIGN UP
Compilability and compact representations of revision of Horn knowledge bases
Full Text:
Pdf
Buy this Article
see
source materials
below for
more options
Author:
Paolo Liberatore
Univ. di Roma “La Sapienza” Rome, Italy
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 1 Issue 1, July 2000
Pages 131 - 161
ACM
New York, NY
, USA
table of contents
doi>
10.1145/343369.343391
2000 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 12
· Downloads (cumulative): 371
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
compact representations
compilability
nonmonotonic reasoning and belief revision
reducibility and completeness
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