- Author:
- James Melton Crawford
Access-Limited Logic (ALL) is a language for knowledge representation which formalizes the access limitations inherent in a network structured knowledge-base. Where a deductive method such as resolution would retrieve all assertions that satisfy a given pattern, an access-limited logic retrieves all assertions reachable by following an available access path. The time complexity of inference is thus a polynomial function of the size of the accessible portion of the knowledge-base, rather than the size of the entire knowledge-base. Access-Limited Logic, though incomplete, still has a well defined semantics and a weakened form of completeness, Socratic Completeness, which guarantees that for any query which is a logical consequence of the knowledge-base, there exists a series of queries after which the original query will succeed. We have implemented ALL in Lisp and it has been used to build several non-trivial systems, including versions of Qualitative Process Theory and Pearl's probability networks. ALL is a step toward providing the properties--clean semantics, efficient inference, expressive power--which will be necessary to build large, effective knowledge bases.
Cited By
- Litman D, Patel-Schneider P, Mishra A, Crawford J and Dvorak D (2002). R++, IEEE Transactions on Knowledge and Data Engineering, 14:3, (638-658), Online publication date: 1-May-2002.
Litman D, Patel-Schneider P and Mishra A Modeling dynamic collections of interdependent objects using path-based rules Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (77-92)- Litman D, Patel-Schneider P and Mishra A (2019). Modeling dynamic collections of interdependent objects using path-based rules, ACM SIGPLAN Notices, 32:10, (77-92), Online publication date: 9-Oct-1997.
- Hewett M and Hewett R Mechanisms for efficiency in blackboard systems Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (465-470)
- Aone C Resolution of collective-distributive ambiguity using model-based reasoning Proceedings of the 29th annual meeting on Association for Computational Linguistics, (1-8)
Index Terms
- Access-limited logic: a language for knowledge representation
Recommendations
Team Logic and Second-Order Logic
Logic, Language, Information and ComputationTeam logic is a new logic, introduced by Väänänen [12], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing functional dependence of variables on each other. It is known that on the ...
Constructive linear-time temporal logic: Proof systems and Kripke semantics
In this paper we study a version of constructive linear-time temporal logic (LTL) with the ''next'' temporal operator. The logic is originally due to Davies, who has shown that the proof system of the logic corresponds to a type system for binding-time ...
On Modal Grzegorczyk Logic
Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej GrzegorczykIn 1964-68 Andrzej Grzegorczyk investigated relational and topological semantics for the intuitionistic logic [15]-[18] . In this connection, following to McKinsey and Tarski, he also considered a semantics for modal logics. It is well known that there ...