[[abstract]]Unification is introduced as the basic operation in the inference-rule-of-resolution principle in first-order logic. In fact, unification must be performed at every inference step, and thus the efficiency of this operation affects crucially the performance of the whole theorem-proving process. An overlapping algorithm that is based on the original unification algorithm is proposed. By overlapping it is meant that some of the operations in the algorithm can be executed in parallel. This algorithm is simple and suitable for hardware implementation. An architecture for elegant execution of the algorithm is presented, and its performance is discussed.[[fileno]]2030201030029[[department]]資訊工程學
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
In this dissertation, we introduce a source-to-source transformation technique called program unific...
This paper presents a method which allows standard data structure sharing techniques to be applied i...
Unification algorithms are an essential component of automated reasoning and term rewriting systems....
Typescript (photocopy).Unification, which has applications in databases, expert and knowledge-based ...
[[abstract]]The design of a parallel theorem prover for first-order logic is described. The parallel...
[[abstract]]This paper presents the design of a special‐purpose cellular tree architecture for the u...
The unification problem and several variants are presented. Various algorithms and data structures a...
Resolution as an inference procedure forms the basis of most automated theorem-proving and reasoning...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
AbstractThe deductive approach is a formal program construction method in which the derivation of a ...
D The problem of unification of terms is log-space complete for P. In deriving this lower bound no u...
AbstractUnification in first-order languages is a central operation in symbolic computation and logi...
AbstractA resolution proof procedure that operates on well-formed formulae with all quantifiers in p...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
In this dissertation, we introduce a source-to-source transformation technique called program unific...
This paper presents a method which allows standard data structure sharing techniques to be applied i...
Unification algorithms are an essential component of automated reasoning and term rewriting systems....
Typescript (photocopy).Unification, which has applications in databases, expert and knowledge-based ...
[[abstract]]The design of a parallel theorem prover for first-order logic is described. The parallel...
[[abstract]]This paper presents the design of a special‐purpose cellular tree architecture for the u...
The unification problem and several variants are presented. Various algorithms and data structures a...
Resolution as an inference procedure forms the basis of most automated theorem-proving and reasoning...
AbstractAn algorithm is presented for solving equations in a combination of arbitrary theories over ...
AbstractThe deductive approach is a formal program construction method in which the derivation of a ...
D The problem of unification of terms is log-space complete for P. In deriving this lower bound no u...
AbstractUnification in first-order languages is a central operation in symbolic computation and logi...
AbstractA resolution proof procedure that operates on well-formed formulae with all quantifiers in p...
In this monograph we study two generalizations of standard unification, E-unification and higher-ord...
This paper describes a procedure for unification in extensional higher order logics. The procedure i...
In this dissertation, we introduce a source-to-source transformation technique called program unific...