inference rule
A procedure which combine s known fact s to produce ("infer") new fact s. For example, given that 1. socrate s i s a man and that 2. all men are motal, we can infer that socrate s i s mortal. Thi s u se s the rule known a s "modu s ponen s" which can be written in {Boolean algebra} a s (A & A => B) => B (if propo sition A i s true, and A implie s B, then B i s true). Or given that, 1. Either Deni s i s programming or Deni s i s sad and 2. Deni s i s not sad, we can infer that Deni s i s programming. Thi s rule can be written ((A OR B) & not B) => A (If either A i s true or B i s true (or both), and B i s fal se, then A mu st be true). (1994-10-31) style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">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 - (2589 Reads) |