Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SEMWEB
2010
Springer

favoriteEmaildiscussreport

151views Internet Technology» more SEMWEB 2010»

Completeness Guarantees for Incomplete Reasoners

13 years 2 months ago

Completeness Guarantees for Incomplete Reasoners

Download www.comlab.ox.ac.uk

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.

Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrock

Real-time Traffic

Intensive Reasoning Systems | Internet Technology | Scalable Incomplete Query | SEMWEB 2010 | Strict Testing Bases |

claim paper

Related Content

» Completeness Guarantees for Incomplete Ontology Reasoners Theory and Practice

» How Incomplete Is Your Semantic Web Reasoner

» A Completeness Result for Reasoning with Incomplete FirstOrder Knowledge Bases

» Completing Queries Rewriting of Incomplete Web Queries Under Schema Constraints

» Decidable Reasoning in FirstOrder Knowledge Bases with Perfect Introspection

» Spectrally optimal factorization of incomplete matrices

» Abstract Patterns of Compositional Reasoning

» Completeness Analysis for Incomplete ObjectOriented Programs

» Repairing Incomplete Reasoners

Post Info
More Details (n/a)

Added	15 Feb 2011
Updated	15 Feb 2011
Type	Journal
Year	2010
Where	SEMWEB
Authors	Giorgos Stoilos, Bernardo Cuenca Grau, Ian Horrocks

Comments (0)