Proving Termination with (Boolean) Satisfaction

Authors:
Michael Codish
Affiliations:
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Logic-Based Program Synthesis and Transformation
Year:
2008

Citing 18
Cited 1

On recursive path ordering

Theoretical Computer Science
Termination of rewriting

Journal of Symbolic Computation
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A machine program for theorem-proving

Communications of the ACM
Efficient BDD encodings for partial order constraints with application to expert systems in software verification

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Logic programming with satisfiability

Theory and Practice of Logic Programming
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Matrix interpretations for proving termination of term rewriting

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Tyrolean termination tool

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination of string rewriting with matrix interpretations

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Size-Change termination analysis in k-bits

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

A New Approach to Non-termination Analysis of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

At some point there was the Davis-Putnam-Logemann-Loveland (DPLL) algorithm [6]. Forty five years later, research on Boolean satisfiability (SAT) is still ceaselessly generating even better SAT solvers capable of handling even larger SAT instances. Remarkably, the majority of these tools still bear the hallmark of the DPLL algorithm. In sync with the availability of progressively stronger SAT solvers is an accumulating number of applications which demonstrate that real world problems can often be solved by encoding them into SAT. When successful, this circumvents the need to redevelop complex search algorithms from scratch.