Is intractability of nonmonotonic reasoning a real drawback?

作者:

摘要

Several studies about computational complexity of nonmonotonic reasoning (NMR) showed that nonmonotonic inference is significantly harder than classical, monotonic inference. This contrasts with the general idea that NMR can be used to make knowledge representation and reasoning simpler, not harder.

论文关键词:Knowledge representation,Nonmonotonic reasoning,Computational complexity,Compact representations

论文评审过程:Available online 16 February 1999.

论文官网地址:https://doi.org/10.1016/S0004-3702(96)00009-4