MOVES Seminar 12. Dezember 2006, 14:00

SAT-based methods for automated termination analysis with polynomial
orderings

 

 

Carsten Fuhs 

 

Abstract:

 

Polynomial orderings are among the most prominent techniques within automated termination analysis frameworks for term rewriting. During the search for a suitable polynomial ordering, we tackle the problem of finding a satisfying assignment for (in)equalities of multivariate polynomials over the naturals.

 

Recently, involved techniques for finding solutions for such constraints have been developed, but their performance on practically occurring instances is often not sufficient. Instead of a dedicated search algorithm, we propose a reduction to a Boolean satisfiability problem with a subsequent application of a modern SAT solver.Experimental results indicate that our approach leads to significant increases in performance when compared with the state of the art.