A Proof Procedure Using Connection Graphs
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
MULTI - a LISP based multiprocessing system
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
Micro-Planner Reference Manual
Micro-Planner Reference Manual
Representing and locating deduction rules in a semantic network
ACM SIGART Bulletin
A Search Technique for Clause Interconnectivity Graphs
IEEE Transactions on Computers
A multi-processing approach to natural language
AFIPS '73 Proceedings of the June 4-8, 1973, national computer conference and exposition
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
| Hi-index | 0.00 |
Raouralva rules, such as "Your parents ancestors are your ancestors", although very useful for theorem proving, natural language understanding, question-answering and Information retrieval systems, present problems for many such systems, either causing infinite loopa or requiring that arbitrarily many copies of them be made. SNIP, the SNaPS Inference Package, can use reouralva rules without either of these problems. A raouralva rule oauaaa a cycle to ba built in an Active connection graph. Each pass of data through the cycle results in another answer. Cycling stops as soon as either the desired answer is produoed, no more answers can be produced or resource bounds are exceeded.