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 …

Term rewriting techniques are applicable to various fields of computer science, including
software engineering, programming languages, computer algebra, program verification …

Publisher Summary Mathematical logicians had developed the art of formalizing declarative
knowledge long before the advent of the computer age. But they were interested primarily in …

There are many automatic tools to prove termination of term rewrite systems, nowadays.
Most of these tools use a combination of many complex termination criteria. Hence …

AProVE 1.2 is one of the most powerful systems for automated termination proofs of term
rewrite systems (TRSs). It is the first tool which automates the new dependency pair …

The dependency pair technique is a powerful method for automated termination and
innermost termination proofs of term rewrite systems (TRSs). For any TRS, it generates …

Automated reasoning modulo an equational theory E is a fundamental technique in many
applications. If E can be split as a disjoint union E∪ Ax in such a way that E is confluent …

We present a new method for automatically proving termination of term rewriting. It is based
on the well-known idea of interpretation of terms where every rewrite step causes a …

The termination and complexity competition (termCOMP) focuses on automated termination
and complexity analysis for various kinds of programming paradigms, including categories …

We describe the system ProVE, an automated prover to verify (innermost) termination of term
rewrite systems (TRSs). For this system, we have developed and implemented efficient …