Solving Partial Order Constraints for LPO Termination
<|reference_start|>Solving Partial Order Constraints for LPO Termination: 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 log2 n 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.<|reference_end|>
@article{codish2005solving,
    title={Solving Partial Order Constraints for LPO Termination},
    author={Michael Codish, Vitaly Lagoon, and Peter J. Stuckey},
    journal={Journal of Satisfiability, Boolean Modeling and Computation,
  5:193-215: 2008},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0512067},
    primaryClass={cs.PL cs.LO cs.SC}
}