Publisher Summary Equations and formulas occur frequently in mathematics, logic, and
computer science. This chapter reviews the main results concerning equations and the …

This textbook offers a unified, self-contained introduction to the field of term rewriting. Baader
and Nipkow cover all the basic material--abstract reduction systems, termination …

This paper describes the structure-map** engine (SME), a program for studying
analogical processing. SME has been built to explore Gentner's structure-map** theory of …

This chapter describes some existing Maude-based tools that are available for download.
The first section describes tools concerned with analysis of either Maude specifications, or of …

Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
Page 1 Confluent Reductions: Abstract Properties and Applications to Term Rewriting …

Handbook of Knowledge Representation describes the essential foundations of Knowledge
Representation, which lies at the core of Artificial Intelligence (AI). The book provides an up …

抄録< jats: p> This book develops the theory of typed feature structures, a data structure that
generalizes both first-order terms and feature structures of unification-based grammars to …

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 …

Resolution Theorem Proving Page 1 Chapter 2 Resolution Theorem Proving Leo Bachmair
Harald Ganzinger Second readers: David McAllester and Christopher Lynch. Contents 1 …

UNIVERSAL UNIFICATION Page 1 UNIVERSAL UNIFICATION Jorg H. Siekmann
Universitat Kaiserslautern FB Informatik Postfach 3049 D-6750 Kaiserslautern Uberhaupt …