Predictive Labeling with Dependency Pairs Using SAT

This paper combines predictive labeling with dependency pairs and reports on its implementation. Our starting point is the method of proving termination of rewrite systems using semantic labeling with infinite models in combination with lexicographic path orders. We replace semantic labeling with predictive labeling to weaken the quasi-model constraints and we combine it with dependency pairs (usable rules and argument filtering) to increase the power of the method. Encoding the resulting search problem as a propositional satisfiability problem and calling a state-of-the-art SAT solver yields a powerful technique for proving termination automatically.

• Type: Conference
• Year: 2007
• Where: CADE
• Authors: Adam Koprowski, Aart Middeldorp
• Keywords: Automated Reasoning, CADE 2007, Lexicographic Path Orders, Propositional Satisfiability Problem, State-of-the-art Sat Solver