A generalization of collapsible cases of circumscription

Authors:
Arkady Rabinov
Affiliations:
Stanford Univ., Stanford, CA
Venue:
Artificial Intelligence
Year:
1989

Citing 0
Cited 3

Proof-complexity results for nonmonotonic reasoning

ACM Transactions on Computational Logic (TOCL)
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning
Computing circumscription revisited: preliminary report

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract