Computing with logic: logic programming with Prolog
Computing with logic: logic programming with Prolog
Maintaining knowledge about temporal intervals
Communications of the ACM
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
A Framework for Representing Knowledge
A Framework for Representing Knowledge
The Description Logic Handbook
The Description Logic Handbook
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
Towards a digital library theory: a formal digital library ontology
International Journal on Digital Libraries
Approximate OWL-Reasoning with Screech
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Using Semantic Distances for Reasoning with Inconsistent Ontologies
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
Scalable semantic retrieval through summarization and refinement
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Conjunctive query answering for the description logic SHIQ
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reasoning with inconsistent ontologies
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
Scalable highly expressive reasoner (SHER)
Web Semantics: Science, Services and Agents on the World Wide Web
The DL-lite family and relations
Journal of Artificial Intelligence Research
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Synergistic Annotation of Multimedia Content
ACHI '10 Proceedings of the 2010 Third International Conference on Advances in Computer-Human Interactions
Logic-based knowledge representation
Artificial intelligence today
KDTA: automated knowledge-driven text annotation
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
A probabilistic abduction engine for media interpretation based on ontologies
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
The summary abox: cutting ontologies down to size
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Proceedings of the Third international joint conference on Automated Reasoning
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Hi-index | 0.00 |
In the last years, the vision of the Semantic Web fostered the interest in reasoning over large and very large sets of assertional statements in knowledge bases. Traditional tableau-based reasoning systems perform bad answering queries over large data sets, because these reasoning systems are based on efficient use of main memory data structures. Increasing expressivity and worst-case complexity further tighten the memory burden. The purpose of our work is to investigate how to release the main memory burden from tableau-based reasoning systems and perform efficient instance checking over SHI-knowledge bases. The key idea is to reduce instance checking for an individual in a knowledge base to smaller subsets of relevant axioms. Modularization techniques are introduced and further refined in order to increase the granularity of modules. For evaluation purposes, experiments on benchmark and real world knowledge bases are carried out. The principal conclusion is that the main memory burden for instance checking can be released from tableau-based reasoning systems for semi-expressive Description Logics, by using modularization techniques.