Completeness Guarantees for Incomplete Reasoners

Abstract. We extend our recent work on evaluating incomplete reasoners by introducing strict testing bases. We show how they can be used in practice to identify ontologies and queries where applications can exploit highly scalable incomplete query answering systems while enjoying completeness guarantees normally available only when using computationally intensive reasoning systems.

• Type: Journal
• Year: 2010
• Where: SEMWEB
• Authors: Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrocks
• Keywords: Intensive Reasoning Systems, Internet Technology, Scalable Incomplete Query, SEMWEB 2010, Strict Testing Bases