A language for pattern recognition

摘要: Abstract A pattern is defined to be any element of a finite Boolean Algebra generated by the elements pre-defined set partitions on an abstract set. An object “atomic patterns” in this Algebra, i.e. which cover least element. description statement obtained from basic predicates use usual logical connectives. Each predicate true for one and only partitions. If their have names are themselves objects another then complex patterns can often described comparatively simple statements express relations universe names. Examples been given show how language used describe “character-recognition” environment statements.