Unification is a fundamental process upon which many methods for automated deduction
are based. Unification theory abstracts from the specific applications of this process: it …

Historically, logic programming (LP) originated from first order logic (FOL). Two results of
FOL were crucial. The first is Skolem's theorem, according to which we can reformulate …

We present an algorithm for unification in the simply typed lambda calculus which
enumerates complete sets of unifiers using a finitely branching search space. In fact, the …

Modularity is a central problem in automated deduction in equational theories. The problem
may be stated as follows: given two equational theories E1 and E2 and algorithms for …

Type-directed component-based program synthesis is the task of automatically building a
function with applications of available components and whose type matches a given goal …

In this extended abstract we report on an investigation of Higher-Order E-Unification, which
consists of unifying typed lambda terms in the context of a first-order set of equations E. This …

It is well-known that the set of support strategy is incomplete in paramodulation theorem
provers if paramodulation into variables is forbidden. In this paper, we present a …

Introduction h—ns l—thèseD nous étudions les moyens de présent—tion des™ onn—iss—
n™ es m—thém—tiques—insi que les s™ hém—s du r—isonnement m—thém—tiqueF xotre …

A novel approach is described for the combination of unification algorithms for two
equational theories E 1 and E 2 which share function symbols. We are able to identify a set …

It is well known that the connection refinement of clause tableaux with paramodulation is
incomplete (even with weak connections). In this paper, we present a new connection …