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 wr ITten in {Boolean algebra} as (A & A => B) => B (if propos ITion A is true, and A implies B, then B is true). Or given that, 1. E ITher Denis is programming or Denis is sad and 2. Denis is not sad, we can infer that Denis is programming. This rule can be wr ITten ((A OR B) & not B) => A (If e ITher 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 - (2587 Reads) |