In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success of proving termination, especially for constrained rewriting systems. In this paper, we show sufficient conditions of linear polynomial interpretations for ...

A parameterised Boolean equation system (PBES) is a set of equations that defines sets satisfying the equations as the least and/or greatest fixed-points. Thus this system is regarded as a declarative program defining predicates, where a program execution returns whether a given ground atomic formula holds or not. The program execution corresponds to the membership problem of PBESs, which is ho...

The symbolic manipulation program Schoonschip is being made freely available for a number of computers with Motorola 680x0 cpu’s. It can run on machines with relatively modest memory and disk resources, and is designed to run as fast as possible given the host constraints. Memory and disk utilization can be adapted to tune performance. Recently added capabilities include a system for efficient ...

Min introduces the type form (of object-formulae) and the infix constant −→ (for objectimplication). The constant [[ ]] maps form to the predefined type prop of meta-logic propositions. The proposition [[P ]] should be read as “the formula P is true”; we usually distinguish object-level formulae (form) from meta-level formulae (prop). In practice the brackets can be dropped; parser and pretty-p...