|Títol||Extending polinomiality to a class of non-clausal many-valued Horn-like formulas|
|Publication Type||Conference Paper|
|Year of Publication||2001|
|Authors||Altamirano E, Escalada-Imaz G|
|Editor||Benferhat S, Besnard P|
|Conference Name||Lecture notes in artificial intelligence|
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.
- Quant a IIIA