Explaining User Errors in Knowledge Base Completion

Explore this paper's citation graph

Summary

The problem of explaining user errors in knowledge base completion is considered, and it is shown that for this setting, the problem of deciding the existence of an explanation within a specified cardinality bound is NP-complete, and theproblem of counting explanations that are minimal w.r.t. set inclusion is #P-complete.

Type
article
Published
2008-01-01
Cited by
3
References
20

Keywords

Computer science, Knowledge base, Base (topology), Completion (oil and gas wells), Information retrieval

References

Cited by

Related papers