inference rule
A procedure which combines known facts to produce ("infer") new facts. For example, given that 1. Socrates is a man and that 2. all men are motal, we can infer that Socrates is mortal. This uses the rule known as "modus ponens" which can be written in {Boolean algebra} as (A & A => B) => B (if proposition A is true, and A implies B, then B is true). Or given that, 1. Either De NIS is programming or De NIS is sad and 2. De NIS is not sad, we can infer that De NIS is programming. This rule can be written ((A OR B) & not B) => A (If either A is true or B is true (or both), and B is false, then A must be true). (1994-10-31) In addition suitable contents: [ 2 ] [ = ] [ ad ] [ al ] [ algebra ] [ am ] [ an ] [ ar ] [ as ] [ at ] [ B ] [ b ] [ be ] [ bi ] [ bo ] [ Boolean ] [ Boolean algebra ] [ bot ] [ br ] [ ca ] [ ch ] [ co ] [ com ] [ cr ] [ D ] [ du ] [ E ] [ ed ] [ edu ] [ er ] [ es ] [ fact ] [ ge ] [ gi ] [ gr ] [ h ] [ hat ] [ ie ] [ implies ] [ in ] [ io ] [ is ] [ it ] [ kn ] [ li ] [ ls ] [ ma ] [ man ] [ mm ] [ mo ] [ mod ] [ mp ] [ mu ] [ ne ] [ nf ] [ ng ] [ ni ] [ no ] [ ns ] [ O ] [ om ] [ op ] [ OR ] [ pl ] [ pr ] [ procedure ] [ program ] [ programming ] [ re ] [ ro ] [ ru ] [ S ] [ sa ] [ se ] [ si ] [ sit ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ us ] [ ve ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (2608 Reads) |