Solving partial order constraints for LPO termination

Michael Codish, Vitaly Lagoon, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations


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.

Original languageEnglish
Title of host publicationTerm Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540368345, 9783540368342
StatePublished - 1 Jan 2006
Event17th International Conference on Term Rewriting and Applications, RTA 2006 - Seattle, WA, United States
Duration: 12 Aug 200614 Aug 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4098 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference17th International Conference on Term Rewriting and Applications, RTA 2006
Country/TerritoryUnited States
CitySeattle, WA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Solving partial order constraints for LPO termination'. Together they form a unique fingerprint.

Cite this