Computer Science – Symbolic Computation
Scientific paper
2006-05-05
Computer Science
Symbolic Computation
29 pages, Seminar Report
Scientific paper
This 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.
No associations
LandOfFree
SAT Techniques for Lexicographic Path Orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with SAT Techniques for Lexicographic Path Orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and SAT Techniques for Lexicographic Path Orders will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-607845