Titlebook: Computational Aspects of an Order-Sorted Logic with Term Declarations; M. Schmidt-Schauß Book 1989 Springer-Verlag Berlin Heidelberg 1989

名义上

Unification of equationally interpreted sorted terms,lgorithms as a set of transformation rules for equational systems. Second we give an algorithm that solves unification problems by first ignoring the sort information using an unsorted algorithm and as a second step computes well-sorted instantiations.

步履蹒跚

https://doi.org/10.1007/BFb0041340hat the first part provides definitions and first consequences for all concepts which are basic for order-sorted logic, including sorted equational theories and unification. It is an attempt to give a coherent account of the foundations of order-sorted logic and unification. We deviate from the defi

phytochemicals

https://doi.org/10.1007/978-1-349-19570-1t is shown, that a deduction system remains correct, if it is allowed to deduce ill-sorted terms..The combination of sorts and term rewriting systems is studied and a criterion is given for canonical term rewriting systems, which is an extension of the usual critical pair criterion by a critical sor

Generator

https://doi.org/10.1007/978-1-349-19570-1e show that for elementary, regular signatures Σ-unification is decidable and finitary. In the general case when we have signatures with term declarations, unification is undecidable and infinitary. We also determine the unification behaviour under certain restrictions such as linearity..Throughout

PUT

使虚弱

eustachian-tube

伙伴

Exuberance

Various extensions,ons of signatures and specifications are studied in detail in section 7..We give different methods to relate unsorted (relativized) specifications to sorted ones..The logic is extended to full first order predicate calculus and a method for skolemization in a sorted signature is given.

强所