Publications

Extending polinomiality to a class of non-clausal many-valued Horn-like formulas

Publication Type:

Conference Paper

Authors:

Edgar Altamirano; Gonzalo Escalada-Imaz

Source:

Lecture notes in artificial intelligence, Springer, Volume 2143, p.792-804 (2001)

Abstract:

In this paper we deal with the SAT problem in many-valued logics wich is of relevant interest in many areas of Artificial Intelligence and Computer Science. Regarding tractability issues, several works have been previously published solving polynomially some clausal many-valued SAT problems. Thus, our aims is to show that certain non-clausal many-valued SAT problems can be solved in polynomial time too, extending in this way, earlier results from the clausal framework to the more general non-clausal one.

Projects: 
DENOC
»