CD(4) has bounded width

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that the constraint languages invariant under a short sequence of Jónsson terms (containing at most three non-trivial ternary terms) are tractable by showing that they have bounded width. This improves the previous result by Kiss and Valeriote and presents some evidence that the Larose-Zadori conjecture holds in the congruence-distributive case.

Keywords

Logic, Computational Complexity, 68N17 (Primary) 08A70, 08B10, 08B05, 03B70, 68T20 (Secondary)

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0709.1934
 http://arxiv.org/abs/0709.1934

Collections

arXiv