FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2149743823> ?p ?o ?g. }

• W2149743823 abstract "Rule-based expert systems are those in which a certain number of IF-THEN rules are assumed to be true. Based on the verity of some assertions, the rules deduce as many new conclusions as possible. A standard technique used to make these deductions is forward-chaining. In forward-chaining, the program or 'inference engine' cycles through the rules. At each rule, the premises for the rule are checked against the current true assertions. If all the premises are found, the conclusion is added to the list of true assertions. At that point it is necessary to start over at the first rule, since the new conclusion may be a premise in a rule already checked. Therefore, each time a new conclusion is deduced it is necessary to start the rule checking procedure over. This process continues until no new conclusions are added and the end of the list of rules is reached. The above process, although quite costly in terms of CPU cycles due to the necessity of repeatedly starting the process over, is necessary if the rules contain 'pattern variables'. An example of such a rule is, 'IF X IS A BACTERIA, THEN X CAN BE TREATED WITH ANTIBIOTICS'. Since the rule can lead to conclusions for many values of X, it is necessary to check each premise in the rule against every true assertion producing an association list to be used in the checking of the next premise. However, if the rule does not contain variable data, as is the case in many current expert systems, then a rule can lead to only one conclusion. In this case, the rules can be stored in a graph, and the true assertions in an assertion list. The assertion list is traversed only once; at each assertion a premise is triggered in all the rules which have that assertion as a premise. When all premises for a rule trigger, the rule's conclusion is added to the END of the list of assertions. It must be added at the end so that it will eventually be used to make further deductions. In the current paper, the two methods are described in detail, the relative advantages of each is discussed, and a benchmark comparing the CPU cycles consumed by each is included. It is also shown that, in the case of reasoning under uncertainty, it is possible to properly combine the certainties derived from rules arguing for the same conclusion when the graph approach is used." @default.
• W2149743823 created "2016-06-24" @default.
• W2149743823 creator A5039264502 @default.
• W2149743823 date "1986-03-26" @default.
• W2149743823 modified "2023-10-05" @default.
• W2149743823 title "Forward-Chaining Versus A Graph Approach As The Inference Engine In Expert Systems" @default.
• W2149743823 cites W1579343146 @default.
• W2149743823 doi "https://doi.org/10.1117/12.964112" @default.
• W2149743823 hasPublicationYear "1986" @default.
• W2149743823 type Work @default.
• W2149743823 sameAs 2149743823 @default.
• W2149743823 citedByCount "4" @default.
• W2149743823 crossrefType "proceedings-article" @default.
• W2149743823 hasAuthorship W2149743823A5039264502 @default.
• W2149743823 hasConcept C129916263 @default.
• W2149743823 hasConcept C132525143 @default.
• W2149743823 hasConcept C142614401 @default.
• W2149743823 hasConcept C154945302 @default.
• W2149743823 hasConcept C15744967 @default.
• W2149743823 hasConcept C2776214188 @default.
• W2149743823 hasConcept C41008148 @default.
• W2149743823 hasConcept C46743427 @default.
• W2149743823 hasConcept C49020025 @default.
• W2149743823 hasConcept C542102704 @default.
• W2149743823 hasConcept C58328972 @default.
• W2149743823 hasConcept C80444323 @default.
• W2149743823 hasConceptScore W2149743823C129916263 @default.
• W2149743823 hasConceptScore W2149743823C132525143 @default.
• W2149743823 hasConceptScore W2149743823C142614401 @default.
• W2149743823 hasConceptScore W2149743823C154945302 @default.
• W2149743823 hasConceptScore W2149743823C15744967 @default.
• W2149743823 hasConceptScore W2149743823C2776214188 @default.
• W2149743823 hasConceptScore W2149743823C41008148 @default.
• W2149743823 hasConceptScore W2149743823C46743427 @default.
• W2149743823 hasConceptScore W2149743823C49020025 @default.
• W2149743823 hasConceptScore W2149743823C542102704 @default.
• W2149743823 hasConceptScore W2149743823C58328972 @default.
• W2149743823 hasConceptScore W2149743823C80444323 @default.
• W2149743823 hasLocation W21497438231 @default.
• W2149743823 hasOpenAccess W2149743823 @default.
• W2149743823 hasPrimaryLocation W21497438231 @default.
• W2149743823 hasRelatedWork W188597715 @default.
• W2149743823 hasRelatedWork W2001397031 @default.
• W2149743823 hasRelatedWork W2089462812 @default.
• W2149743823 hasRelatedWork W2105600282 @default.
• W2149743823 hasRelatedWork W2114012716 @default.
• W2149743823 hasRelatedWork W2399584202 @default.
• W2149743823 hasRelatedWork W3165080795 @default.
• W2149743823 hasRelatedWork W4297785738 @default.
• W2149743823 hasRelatedWork W904654316 @default.
• W2149743823 hasRelatedWork W3109504494 @default.
• W2149743823 isParatext "false" @default.
• W2149743823 isRetracted "false" @default.
• W2149743823 magId "2149743823" @default.
• W2149743823 workType "article" @default.