Solving partial order constraints for LPO termination

Authors:
Michael Codish;Vitaly Lagoon;Peter J. Stuckey
Affiliations:
Department of Computer Science, Ben-Gurion University, Israel;Department of Computer Science and Software Engineering, The University of Melbourne, Australia;Department of Computer Science and Software Engineering, The University of Melbourne, Australia
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 8
Cited 17

On recursive path ordering

Theoretical Computer Science
Termination of rewriting

Journal of Symbolic Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
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
Tsukuba termination tool

RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Tyrolean termination tool

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Proving Termination of Context-Sensitive Rewriting with MU-TERM

Electronic Notes in Theoretical Computer Science (ENTCS)
Logic programming with satisfiability

Theory and Practice of Logic Programming
Constraints for Argument Filterings

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
Telecommunications Feature Subscription as a Partial Order Constraint Problem

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
KBO Orientability

Journal of Automated Reasoning
Transforming SAT into Termination of Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative encoding of telecommunications feature subscription in SAT

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A new approach to bounded model checking for branching time logics

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
A SAT-based approach to size change termination with global ranking functions

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Argument filterings and usable rules for simply typed dependency pairs

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Decreasing Diagrams and Relative Termination

Journal of Automated Reasoning
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Decreasing diagrams and relative termination

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new kind of propositional encoding for reasoning about partial orders. The symbols in an unspecified partial order are viewed as variables which take integer values and are interpreted as indices in the order. For a partial order statement on n symbols each index is represented in ⌈log2n⌉ propositional variables and partial order constraints between symbols are modeled on the bit representations. We illustrate the application of our approach to determine LPO termination for term rewrite systems. Experimental results are unequivocal, indicating orders of magnitude speedups in comparison with current implementations for LPO termination. The proposed encoding is general and relevant to other applications which involve propositional reasoning about partial orders.