A Prolog technology theorem prover: a new exposition and implementation in Prolog
Theoretical Computer Science - Selected papers on theoretical issues of design and implementation of symbolic computation systems
A Logic-Based System for Application Integration
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
PROTEIN: A PROver with a Theory Extension INterface
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Description logic programs: combining logic programs with description logic
WWW '03 Proceedings of the 12th international conference on World Wide Web
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Ontology schema for an agent belief store
International Journal of Human-Computer Studies
Prolog Based Description Logic Reasoning
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Efficient description logic reasoning in prolog: The dlog system
Theory and Practice of Logic Programming
Scalable Web Reasoning Using Logic Programming Techniques
RR '09 Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems
Description logic reasoning in prolog
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
| Hi-index | 0.00 |
In this paper we present a novel approach for determining the instances of description logic concepts when huge amounts of underlying data are expected. In such cases, traditional description logic theorem proving techniques cannot be used due to performance problems. Our idea is to transform a concept description into a Prolog program which represents a query-plan. This transformation is done without any knowledge of the particular data. Data are accessed dynamically during the normal Prolog execution of the generated program. With this technique only those pieces of data are accessed which are indeed important for answering the query, i.e. we solve the original problem in a database friendly way. We evaluate the performance of our approach and compare it to several description logic reasoners.