Dieter Hutter and Michael Kohlhase. Managing structural information by higher-order colored unication. Journal of Automated Reasoning, 25(2):123-164, 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....leave out full equality treatment in which tableaux systems traditionally are rather weak. 5 Implementation The RM calculus together with its extension by HOU have been implemented in the constraint logic programming language Oz [24] The implementation includes higher order colored unification [16] as an inference procedure that concurrently solves higher order equations while model generation tries to build consistent interpretations. Formulas with free higher order variables that can not immediately be treated by model generation are kept as unsolved constraints until higher order ....

D. Hutter and M. Kohlhase. Managing structural information by higher-order colored unification. Journal of Automated Reasoning, 1999. forthcoming.

....to the integration of sorts into machined oriented calculus, the concept of annotations can be combined with various calculi. Rippling, as a special instance of this concept, has been implemented, for instance, into a sequent calculus [7] a resolution calculus [15] and a simply typed calculus [16]. We wish to emphasize the generality of annotations allowing for a wide range of possible instantiations, rather than to focus on technical issues of particular calculi. Thus we illustrate our framework with the help of a particular ( rst order) logic. We describe how to incorporate annotations ....

....various applications. Some of these applications have been presented in this paper. We wish to emphasize that both annotated logics and annotated calculi are more or less examples or instances of the presented methodology. We may change, for instance, the underlying logic to a lambda calculus (cf. [16] for a specialized version of it) or replace the rewriting calculus by a resolution or a sequent calculus. While some technical points have of course to be changed, the overall procedure will be the same. The uni cation procedure in section 5 is an example of how to incorporate annotations into a ....

Dieter Hutter and Michael Kohlhase. Managing structural information by higher-order colored unication. Journal of Automated Reasoning, 25(2):123-164, 2000.

....(but interacting) modules. This in turn suggests a modular treatment of the interaction between the different linguistic components. In the field of theorem proving with mathematical induction, there is a technique for guiding induction proof search which is known as term coloring [HUT 97b, HUT 99] and uses a modified version of higher order unification (HOU) namely Higher Order Colored Unification (HOCU) Crucially, coloring allows one to add arbitrary information to term occurrences, and to maintain and exploit this information during the infer1. Linguistic theory usually distinguishes ....

....constraints on semantic construction. Since the formal presentation of the HOCU theory involves a lot of technical machinery which we cannot present fully here, we concentrate instead on presenting its underlying intuitions and motivations. For details and proofs, we refer the reader to [HUT 97b, HUT 99] The colored calculus is a variant of the simply typed calculus [CHU 40] where symbol occurrences can be annotated with so called colors (color constants C = fa; b; g and color variables X = fA; B; g) Colors are indicated by subscripts labeling symbol occurrences. Whenever they ....

[Article contains additional citation context not shown here]

HUTTER D. and KOHLHASE M., Managing Structural Information by HigherOrder Colored Unification . Journal of Automated Reasoning, 1999. forthcoming.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC