Alois Glanc
ABSTRACT
A pattern is a set of binary or ternary relations. A description of the pattern is a formula of many sorted predicate calculus with metric spaces defined on indices of predicate constants which is satisfied by the given pattern. The pattern recognition problem is to find whether the formula is satisfied by the given relation. The pattern description problem is to form from the given pattern the corresponding formula. To solve this problem usual training methods1 are applied together with techniques used for program synthesis2. The limitations imposed by these techniques imply limitations to our approach.
- 1.M.Minsky and S. Papert, "Perceptrons: An Introduction to Computational Geometry," The M.I.T. Press, 1969 Google Scholar
Digital Library
- 2.Z.Manna and R.J. Waldinger, "Towards automatic program synthesis." Comm. ACM 14, 151 (1971) Google ScholarDigital Library
Index Terms
- On pattern recognition and description using many sorted predicate calculi
Recommendations
Order-sorted logic programming with predicate hierarchy
Order-sorted logic has been formalized as first-order logic with sorted terms where sorts are ordered to build a hierarchy (called a sort-hierarchy). These sorted logics lead to useful expressions and inference methods for structural knowledge that ...
Many Sorted Observational Calculi for Multi-Relational Data Mining
ICDMW '06: Proceedings of the Sixth IEEE International Conference on Data Mining - WorkshopsObservational calculi approved as a tool for study logical properties of association rules. They are defined by modifications of classical predicate calculi. Many sorted observational calculi are introduced as a modification of classical many sorted ...
A many-sorted calculus based on resolution and paramodulation
IJCAI'83: Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2The first-order calculus whose well formed formulas are clauses and whose sole inference rules are factorization, resolution and paramodulation is extended to a many-sorted calculus. As a basis for Automated Theorem Proving, this many-sorted calculus ...
Comments