@inproceedings{4d41bc920df94d59895c8a833003fafe,
title = "Solving partial order constraints for LPO termination",
abstract = "This paper introduces a new kind of prepositional 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] prepositional 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 prepositional reasoning about partial orders.",
author = "Michael Codish and Vitaly Lagoon and Stuckey, \{Peter J.\}",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11805618\_2",
language = "English",
isbn = "3540368345",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "4--18",
booktitle = "Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings",
address = "Germany",
note = "17th International Conference on Term Rewriting and Applications, RTA 2006 ; Conference date: 12-08-2006 Through 14-08-2006",
}