Michael Kohlhase. Higher-order order-sorted resolution. Seki Report SR-94-01, FB Informatik, Universitat des Saarlandes, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Calculus and a System Architecture for Extensional.. - Benzmüller (1997) (Correct)
....position in a literal by a general binding that imitates a logical connective or quantifier. Concerning the adaption of techniques from first order resolution to higherorder resolution some important cornerstones have been established by the sorted higher order resolution calculus described in [Koh94a, Koh94b] or the higher order indexing techniques examined in [Kle97] Indeed, the treatment of equality and extensionality is still a challenging problem for all higher order theorem provers. In fact there is no automated higher order theorem prover known to the author which can effectively and ....
....by existing systems. In the first part of this paper we introduce an extension of the Huet style cal 1 Logical Engine for Omega. The Leo project is strongly connected to the Omega project [BCF 97] and Leo s main intention is to become a powerful subsystem of Omega. culus introduced in [Koh94a, Koh94b] 2 in order to establish full extensionality. Although a formal proof for this conjecture is still lacking, the different examples discussed in this paper provide strong evidence for the Henkin completeness of the extended resolution calculus. Leo wants to reach a considerable power on ....
[Article contains additional citation context not shown here]
Michael Kohlhase. Higher-order order-sorted resolution. Seki Report SR-94-1, Fachbereich Informatik, Universitat des Saarlandes, 1994.
Unification in a Sorted λ-Calculus with Term Declarations .. - Kohlhase (1994) Self-citation (Kohlhase) (Correct)
....base sorts, function restriction and extensionality, and of term declarations with sorted conversion. We have presented correct and complete sets of transformations for uni cation and pre uni cation in HOL, which form the basis of a sorted higher order resolution calculus described in [13]. In rst order predicate logic, the introduction of term declarations has been a major step to the development of dynamic sorted logics [22] where variables are restricted to sorts, but where the sorts can also be treated as unary predicates in the logic; thus the signature is no longer xed ....
Michael Kohlhase. Higher-order order-sorted resolution. Seki Report SR-94-01, FB Informatik, Universitat des Saarlandes, 1994.
Model Existence for Higher Order Logic - Benzmüller, Kohlhase (2000) Self-citation (Kohlhase) (Correct)
....calculi such as [Hue73, ALCMP84] even though it is weaker than the intuitive one given by Henkin Models. The semantical notions in Section 3 come from the attempt to achieve completeness with respect to Henkin models for higher order tableaux [Koh95, Koh98] and higher order resolution [Koh94a, Ben97, BK97b] A model existence theorem for a logical system S (i.e. a logical language LS together with a consequence relation j= S LS LS ) is a theorem of the form: If a set of sentences in S is a member of an abstract consistency class , then there exists a S model for . Thus, if we ....
Michael Kohlhase. Higher-order order-sorted resolution. Seki Report SR-94-1, Fachbereich Informatik, Universitat des Saarlandes, 1994.
Unification in a Sorted λ-Calculus with Term Declarations .. - Kohlhase (1994) Self-citation (Kohlhase) (Correct)
....base sorts, function restriction and extensionality, and of term declarations with sorted fi conversion. We have presented correct and complete sets of transformations for unification and pre unification in SigmaT , which form the basis of a sorted higher order resolution calculus described in [13]. In first order predicate logic, the introduction of term declarations has been a major step to the development of dynamic sorted logics [22] where variables are restricted to sorts, but where the sorts can also be treated as unary predicates in the logic; thus the signature is no longer fixed ....
Michael Kohlhase. Higher-order order-sorted resolution. Seki Report SR-94-01, FB Informatik, Universitat des Saarlandes, 1994.
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