A SAT-based approach to size change termination with global ranking functions

15Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

We describe a new approach to proving termination with size change graphs. This is the first decision procedure for size change termination (SCT) which makes direct use of global ranking functions. It handles a well-defined and significant subset of SCT instances, designed to be amenable to a SAT-based solution. We have implemented the approach using a state-of-the-art Boolean satisfaction solver. Experimentation indicates that the approach is a viable alternative to the complete SCT decision procedure based on closure computation and local ranking functions. Our approach has the extra benefit of producing an explicit witness to prove termination in the form of a global ranking function. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ben-Amram, A. M., & Codish, M. (2008). A SAT-based approach to size change termination with global ranking functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4963 LNCS, pp. 218–232). https://doi.org/10.1007/978-3-540-78800-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free