University Library
  • Login
A gateway to Melbourne's research publications
Minerva Access is the University's Institutional Repository. It aims to collect, preserve, and showcase the intellectual output of staff and students of the University of Melbourne for a global audience.
View Item 
  • Minerva Access
  • Engineering
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
  • Minerva Access
  • Engineering
  • Computing and Information Systems
  • Computing and Information Systems - Research Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

    Solving partial order constraints for LPO termination

    Thumbnail
    Citations
    Scopus
    Altmetric
    14
    Author
    Codish, M; Lagoon, V; Stuckey, PJ
    Editor
    Pfenning, F
    Date
    2006-01-01
    Source Title
    TERM REWRITING AND APPLICATIONS, PROCEEDINGS
    Publisher
    SPRINGER-VERLAG BERLIN
    University of Melbourne Author/s
    LAGOON, VITALY; Stuckey, Peter
    Affiliation
    Computer Science and Software Engineering
    Metadata
    Show full item record
    Document Type
    Conference Paper
    Citations
    Codish, M., Lagoon, V. & Stuckey, P. J. (2006). Solving partial order constraints for LPO termination. Pfenning, F (Ed.) TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 4098, pp.4-18. SPRINGER-VERLAG BERLIN. https://doi.org/10.1007/11805618_2.
    Access Status
    This item is currently not available from this repository
    URI
    http://hdl.handle.net/11343/31639
    DOI
    10.1007/11805618_2
    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 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.
    Keywords
    Computer Software

    Export Reference in RIS Format     

    Endnote

    • Click on "Export Reference in RIS Format" and choose "open with... Endnote".

    Refworks

    • Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References


    Collections
    • Minerva Elements Records [45770]
    • Computing and Information Systems - Research Publications [1456]
    Minerva AccessDepositing Your Work (for University of Melbourne Staff and Students)NewsFAQs

    BrowseCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects
    My AccountLoginRegister
    StatisticsMost Popular ItemsStatistics by CountryMost Popular Authors