This article surveys various complexity and expressiveness results on different forms of logic
programming. The main focus is on decidable forms of logic programming, in particular …

The unification problem and several variants are presented. Various algorithms and data
structures are discussed. Research on unification arising in several areas of computer …

In the two and a half years since the frrst edition of this book was published, the field of logic
programming has grown rapidly. Consequently, it seemed advisable to try to expand the …

The unification problem in f'mst-order predicate calculus is described in general terms as the
solution of a system of equations, and a nondeterministic algorithm is given. A new …

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 …

LINEAR UNIFICATION by MS Paterson* University of Warwick Coventry, England CV4 7AL
and MN Wegman IBM Thomas J. Watson Rese Page 1 LINEAR UNIFICATION by MS …

Most knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic
representation, support one basic operation:“matching of descriptions”. This operation …

A soft type system infers types for the procedures and data structures of dynamically typed
programs. Like conventional static types, soft types express program invariants and thereby …

This paper surveys various complexity results on different forms of logic programming. The
main focus is on decidable forms of logic programming, in particular propositional logic …

The aim of this chapter is to explain, by example, some methods for reasoning about
equivalence of programs based directly upon a type system and an operational semantics …