Show simple item record

dc.contributor.authorCodish, M
dc.contributor.authorLagoon, V
dc.contributor.authorStuckey, PJ
dc.contributor.editorPfenning, F
dc.date.available2014-05-22T03:51:55Z
dc.date.issued2006-01-01
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000240072100002&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationCodish, 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.
dc.identifier.isbn3-540-36834-5
dc.identifier.isbn9783540368342
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/11343/31639
dc.description.abstractThis 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.
dc.languageEnglish
dc.publisherSPRINGER-VERLAG BERLIN
dc.source17th International Conference on Rewriting Techniques and Applications
dc.subjectComputer Software
dc.titleSolving partial order constraints for LPO termination
dc.typeConference Paper
dc.identifier.doi10.1007/11805618_2
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titleLecture Notes in Computer Science
melbourne.source.volume4098
melbourne.source.pages4-18
dc.description.pagestart4
melbourne.publicationid56166
melbourne.elementsid279989
melbourne.contributor.authorLAGOON, VITALY
melbourne.contributor.authorStuckey, Peter
dc.identifier.eissn1611-3349
melbourne.event.locationSeattle, WA
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record