Knuth-Bendix constraint solving is NP-complete

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show the NP-completeness of the existential theory of term algebras with the Knuth-Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth-Bendix ordering constraints.
27 pages

Keywords

Logic in Computer Science, F.4.1

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv