Special-purpose, but domain-independent, inference mechanisms
Selected and updated papers from the proceedings of the 1982 European conference on Progress in artificial intelligence
Knowledge representation and reasoning
Annual review of computer science vol. 1, 1986
Computability and logic
Towards a theory of access-limited logic for knowledge representation
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Maintaining knowledge about temporal intervals
Communications of the ACM
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Readings in Knowledge Representation
Readings in Knowledge Representation
Associative Networks: The Representation and Use of Knowledge by Computers
Associative Networks: The Representation and Use of Knowledge by Computers
Access-Limited Logic -- A Language for Knowledge Representation
Access-Limited Logic -- A Language for Knowledge Representation
Towards a general theory of topological maps
Artificial Intelligence
Building place ontologies for the semantic web:: issues and approaches
Proceedings of the 4th ACM workshop on Geographical information retrieval
Building concept representations from reusable components
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Provenance explorer – customized provenance views using semantic inferencing
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
| Hi-index | 0.00 |
Access-Limited Logic (ALL) is a theory of 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 only those assertions reachable by following an available access path. The time complexity of inference in ALL is a polynomial function of the size of the accessible portion of the knowledge-base, rather than an exponential function of the size of the entire knowledge-base (as in much past work). Access-Limited Logic, though incomplete, still has a well defined semantics and a weakened form of completeness, Socratic Completeness, which guarantees that for any fact which is a logical consequence of the knowledge-base, there is a series of preliminary queries and assumptions after which a query of the fact will succeed.