Publisher Summary This chapter focuses on rewrite systems, which are directed equations
used to compute by repeatedly replacing sub-terms of a given formula with equal terms until …

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 …

Rewriting logic [40] is proposed as a logical framework in which other logics can be
represented, and as a semantic framework for the specification of languages and systems …

A framework for first-order constrained deduction is proposed in this paper. The syntax and
semantics of symbolic constraints and constrained formulae are defined. Constrained …

We present an NP decision procedure for the formal analysis of protocols in presence of
modular exponentiation with products allowed in exponents. The number of factors that may …

The central concept of theorem designates a claim backed by an irrefutable argument that
follows formal rules, called a proof. Proving theorems is very useful in both Computer …

Reduktions-und Vervollständigungstechniken dienen zum Rechnen und Schließen in
gleichungsdefinierten algebraischen Strukturen wie Abstrakten Datentypen. In dieser ersten …

We propose a set of transformation rules for first order formulae whose atoms are either
equations between terms or" membership constraints" t∈ ζ. ζ can be interpreted as a regular …

Hybrid knowledge representation systems (such as those of the KL-ONE family) distinguish
between taxonomical information (that is represented in the T-Box) and assertional …

We propose a refinement of the type theory underlying the LF logical framework by a form of
subtypes and intersection types. This refinement preserves desirable features of LF, such as …