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 …

This survey of the theory and applications of rewriting with equations discusses the
existence and uniqueness of normal forms, the KnuthBendix completion procedure and its …

This paper studies feature-description languages that have been developed for use in
unification grammars, logic programming, and knowledge representation. The distinctive …

An equational system is a set of equations. Often we are interested in knowing if an equation
follows logically from the given set. For example, given the equations x+ y= y+ x,(x+ y)+ z …

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 …

The promise of logic programming is that programs can be written relationally, without
distinguishing between input and output arguments. Relational programs are remarkably …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …

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 …

This paper presents a generic method for randomly generating well-typed expressions. It
starts from a specification of a ty** judgment in PLT Redex and uses a specialized solver …