Extending Polynomiality to a Class of Non-clausal Many-Valued Horn-Like Formulas

Authors:
Edgar Altamirano;Gonzalo Escalada-Imaz
Affiliations:
-;-
Venue:
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2001

Citing 7
Cited 0

A linear control algorithm for a class of rule-based systems

Journal of Logic Programming
Automated deduction in multiple-valued logics

Automated deduction in multiple-valued logics
Polarity guided tractable reasoning

AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
An Efficient Proof Method for Non-clausal Reasoning

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Non-clausal Reasoning with Propositional Definite Theories

AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Transformations between Signed and Classical Clause Logic

ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Model-theoretic semantics and tractable algorithm for CNF-BCP

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we deal with the SAT problem in many-valued logics which 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 aim is to show that certain nonclausal 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.