Horn clause
A set of atomic literals with at most one {positive literal}. Usually written L <- L1, ..., Ln or <- L1, ..., Ln where n>=0, "<-" means "is implied by" and comma stands for conjuction ("AND"). If L is false the clause is regarded as a goal. Horn clauses can express a subset of statements of first order logic. The name "Horn Clause" comes from the logician Alfred Horn, who first pointed out the significance of such clauses in 1951, in the article "On sentences which are true of direct unions of algebras", Journal of Symbolic Logic, 16, 14-21. A definite clause is a Horn clause that has exactly one positive literal. (2000-01-24) In addition suitable contents:
[ 2 ] [ = ] [ al ] [ algebra ] [ am ] [ an ] [ AND ] [ ar ] [ arc ] [ as ] [ at ] [ atomic ] [ au ] [ b ] [ bo ] [ br ] [ bs ] [ by ] [ C ] [ ca ] [ ch ] [ ci ] [ cl ] [ clause ] [ co ] [ com ] [ comma ] [ con ] [ D ] [ de ] [ definite clause ] [ du ] [ ec ] [ ed ] [ eg ] [ er ] [ era ] [ es ] [ et ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ fr ] [ fred ] [ ga ] [ ge ] [ gi ] [ gn ] [ goal ] [ h ] [ hat ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ ir ] [ is ] [ it ] [ J ] [ la ] [ Lex ] [ li ] [ lite ] [ literal ] [ ls ] [ ly ] [ ma ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ N ] [ na ] [ nc ] [ ND ] [ ne ] [ ni ] [ ns ] [ O ] [ om ] [ ph ] [ pl ] [ point ] [ pr ] [ query ] [ rc ] [ re ] [ ro ] [ ru ] [ S ] [ se ] [ sentence ] [ set ] [ si ] [ sig ] [ sit ] [ st ] [ state ] [ su ] [ T ] [ th ] [ to ] [ tr ] [ tt ] [ ua ] [ union ] [ us ] [ ve ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (5123 Reads) |
