DMCA
Automated SAT Encoding for Termination Proofs with Semantic Labelling∗
BibTeX
@MISC{Bau_automatedsat,
author = {Er Bau and René Thiemann and Johannes Waldmann},
title = {Automated SAT Encoding for Termination Proofs with Semantic Labelling∗},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We discuss design choices for SAT-encoding constraints for termination orders based on semantic labelling and unlabelling, linear interpretations, recursive path orders with argument filters, within the dependency pairs framework. We specify constraints in a high-level Haskell-like language, and translate to SAT fully auto-matically by the CO4 compiler. That way, constraints can be combined easily. This allows to write a single constraint for find a model, and a sequence of ordering constraints for the labelled system, such that at least one original rule can be removed completely. Reliability is achieved via certification of generated proofs. The size of the resulting propositional logic formulas can be reduced by strengthening the constraints. We discuss an encoding of finite maps via patterns. 1
Keyphrases
termination proof sat encoding sat-encoding constraint propositional logic formula termination order original rule design choice finite map argument filter high-level haskell-like language single constraint linear interpretation recursive path order generated proof semantic labelling co4 compiler labelled system
