SAT Techniques for Lexicographic Path Orders

Simple item page
dc.creatorZankl, Harald
dc.date2006-05-05
dc.date.accessioned2026-07-07T07:09:27Z
dc.date.available2026-07-07T07:09:27Z
dc.descriptionThis seminar report is concerned with expressing LPO-termination of term rewrite systems as a satisfiability problem in propositional logic. After relevant algorithms are explained, experimental results are reported.
dc.description29 pages, Seminar Report
dc.identifierhttps://arxiv.org/abs/cs/0605021
dc.identifierhttp://arxiv.org/abs/cs/0605021
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111070
dc.subjectSymbolic Computation
dc.titleSAT Techniques for Lexicographic Path Orders
dc.typetext

Files

Collections

arXiv