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 - (2590 Reads) |