Home // AFIN 2011, The Third International Conference on Advances in Future Internet // View article

Automatic Generation of Efficient Solver for Query-Answering Problems

Authors:
He Songhao
Akama Kiyoshi
Li Bin

Keywords: Query-Answering problem; bottom-up solution; specific solver; unfold transformation; support set

Abstract:
The Query-Answering (QA) problem is a class of the logical problem that is more general than the proof problem and the database searching problem, and can be applied in the semantic web. In this paper, we develop a new technology about how to generate an efficient solver (C program) corresponding to a given QA problem. We expect to generate the specific solver, not the general solver for all kinds of QA problem. The solver is generated based on the bottom-up solution used to update models in the QA problem. We have also developed the technology to suppress the size of the solver to deal with the large-scale QA problem.

Pages: 114 to 119

Copyright: Copyright (c) IARIA, 2011

Publication date: August 21, 2011

Published in: conference

ISSN: 2308-4340

ISBN: 978-1-61208-148-9

Location: Nice/Saint Laurent du Var, France

Dates: from August 21, 2011 to August 27, 2011