TY - JOUR
T1 - Off-line reasoning for on-line efficiency
T2 - Knowledge bases
AU - Moses, Yoram
AU - Tennenholtz, Moshe
N1 - Funding Information:
This work was supportedi n part by a grant from the US-Israel Binational Science Foundation. The first author was supportedb y a Helen and Milton A. Kimmelman Career Development Chair. The second author was supportedi n part by an Eshkol fellowship of the Israeli Ministry of Science and Technology, and later by the Air Force Office of Scientific Research. Part of the research was carried out while the second author was in the Departmento f Applied Mathematicsa nd Computer Science at the Weizmann Institute of Science, and part while he was in the Computer Science Department at Stanford University.
PY - 1996/6
Y1 - 1996/6
N2 - The complexity of reasoning is a fundamental issue in AI. In many cases, the fact that an intelligent system needs to perform reasoning on-line contributes to the difficulty of this reasoning. This paper considers the case in which an intelligent system computes whether a query is entailed by the system's knowledge base. It investigates how an initial phase of off-line preprocessing and design can improve the on-line complexity considerably. The notion of an efficient basis for a query language is presented, and it is shown that off-line preprocessing can be very effective for query languages that have an efficient basis. The usefulness of this notion is illustrated by showing that a fairly expressive language has an efficient basis. A dual notion of an efficient disjunctive basis for a knowledge base is introduced, and it is shown that off-line preprocessing is worthwhile for knowledge bases that have an efficient disjunctive basis.
AB - The complexity of reasoning is a fundamental issue in AI. In many cases, the fact that an intelligent system needs to perform reasoning on-line contributes to the difficulty of this reasoning. This paper considers the case in which an intelligent system computes whether a query is entailed by the system's knowledge base. It investigates how an initial phase of off-line preprocessing and design can improve the on-line complexity considerably. The notion of an efficient basis for a query language is presented, and it is shown that off-line preprocessing can be very effective for query languages that have an efficient basis. The usefulness of this notion is illustrated by showing that a fairly expressive language has an efficient basis. A dual notion of an efficient disjunctive basis for a knowledge base is introduced, and it is shown that off-line preprocessing is worthwhile for knowledge bases that have an efficient disjunctive basis.
UR - http://www.scopus.com/inward/record.url?scp=0030170414&partnerID=8YFLogxK
U2 - 10.1016/0004-3702(95)00015-1
DO - 10.1016/0004-3702(95)00015-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0030170414
SN - 0004-3702
VL - 83
SP - 229
EP - 239
JO - Artificial Intelligence
JF - Artificial Intelligence
IS - 2
ER -