Off-line reasoning for on-line efficiency: knowledge bases
نویسندگان
چکیده
منابع مشابه
Off-line Reasoning for On-line Efficiency
The complex i ty of reasoning is a fundamenta l issue in A I . In many cases, the fact tha t an intel l igent system needs to per form reasoning on-l ine contr ibutes to the di f f icul ty of this reasoning. In this paper we investigate a couple of contexts in which an i n i t i a l phase of off-l ine preprocessing and design can improve the on-l ine complexi ty considerably. The first context ...
متن کاملOo-line Reasoning for On-line Eeciency: Knowledge Bases
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 diiculty 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 oo-line preprocessing and design can...
متن کاملA formal approach for automated reasoning about off-line and undetectable on-line guessing (short paper)
Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line and on-line guessing and can distinguish between them. We add our guessing rules as state transitions to protocol models that are input to model checking tools. With our proof-of-concept implementation we have automatically det...
متن کاملA Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line and on-line guessing and can distinguish between them. We add our guessing rules as state transitions to protocol models that are input to model checking tools. With our proof-of-concept implementation we have automatically det...
متن کاملOff-line and On-line execution
. Like classical planning, the execution of high-level agent programs requires a reasoner to look all the way to a final goal state before even a single action can be taken in the world. This deferral is a serious problem in practice for large programs. Furthermore, the problem is compounded in the presence of sensing actions which provide necessary information, but only after they are executed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1996
ISSN: 0004-3702
DOI: 10.1016/0004-3702(95)00015-1