Abstract This article examines the particular place of quintuple canonization 1622 in long history papal canonization. While papacy gradually imposed its control over creation new saints Middle Ages, Modern Era it faced a double challenge to practice. On one hand, Luther condemned elevation altars 1523 Saxon bishop Benno Meissen, which he saw idol. And, fact, silence from Roman Curia followed. ...

We consider innnitary logic with two variable symbols and counting quantiiers, C 2 , and its intersection with Ptime on nite relational structures. In particular we exhibit a Ptime canonization procedure for nite relational structures which provides unique representatives up to equivalence in C 2. As a consequence we obtain a recursive presentation for the class of all those queries on arbitrar...

Objectives. The objective of the work is to develop means for recognition (extraction) high-level structures in circuits on transistor level. This allows obtain a representation logical level, equivalent original flat description Obtaining such significantly reduces time perform VLSI topology check, but also provides basis reengineering integrated and reverse engineering detecting unauthorized ...

Regular types represent sets of structured data, and have been used in logic programming (LP) for verification. However, first-class regular type systems are uncommon in LP languages. In this paper we present a new approach to regular types, based on type canonization, aimed at providing a practical first-class regular type system. 1998 ACM Subject Classification D.3.3 Language Constructs and F...

We show that isomorphism testing of k-trees is in the class StUSPACE(log n) (strongly unambiguous logspace). This bound follows from a deterministic logspace algorithm that accesses a strongly unambiguous logspace oracle for canonizing k-trees. Further we give a logspace canonization algorithm for k-paths.

If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the disjoint union of the two theories? We prove this is possible whenever the original theories are convex. As an application, we prove that algorithms for solving equations in the two theories (solvers) cannot be combine...