Boolean expressions play a major role in computer science. They can be used to represent
sets, formulas of propositional logic and digital circuits. In this paper we present an algorithm …

Embedding sets as a datastructure into resolution-based deduction requires a unification
algorithm respecting associativity, commutativity and idempotence of the constructor function …

Sets are a basic data structure in artificial intelligence. Embedding this datastructure into
deductive processes based on resolution requires inventing a suitable unification algorithm (ACI…

In a recent paper A. Herold and J. Siekmann generalize ‘pure’ AC unification to terms containing
additional function symbols. Generalized AC unification thus attains practical relevance …

Unification in algebras is widely seen as a means of improving the expressiveness and
efficiency of resolution based deduction. In particular, finite algebras have recently gained …

The constraint satisfaction problem (CSP) over finite domains is reduced to unification in
finite algebras. A CSP defines a unification problem with a most general unifier that naturally …

Die Zentralabteilung Forschung und Entwicklung der Siemens AG hat im Oktober 1988 ein 3-Jahresprojekt
„Neurodemonstrator“gestartet mit dem Ziel, den Nutzen neuronaler Netze für …

Let congruence V be a vector space of dimension of V 2n. A partial is a system of n-dimensional
subspaces N= 2. In N with pairwise trivial intersections such that case the elements of …

One way to extend resolution based theorem proving is by means of unification in algebras
modelling interesting domains of application. We will discuss in this paper the theoretical and …

After decades of research the late eighties and the nineties have produced a number of “checkers”
verifying complex aspects of industrial designs and thus raising the attention of early …