SAT Techniques for Lexicographic Path Orders

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
29 pages, Seminar Report

Keywords

Symbolic Computation

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/111070

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0605021
 http://arxiv.org/abs/cs/0605021

Collections

arXiv