An Efficient Proof Method for Non-clausal Reasoning

Authors:
Edgar Altamirano;Gonzalo Escalada-Imaz
Affiliations:
-;-
Venue:
ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Year:
2000

Citing 6
Cited 1

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

Journal of Logic Programming
Dissolution: making paths vanish

Journal of the ACM (JACM)
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
Theorem Proving via General Matings

Journal of the ACM (JACM)
Non-clausal Reasoning with Propositional Definite Theories

AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
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

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

ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.01

Visualization

Abstract

Enlarging the class of tractable SAT problems is a relevant topic because of the repercussions in both practical applications and theoretical grounds. In this paper, it is proved that some non-clausal Hornlike formulas can be solved in linear time. In addition to its theoretical importance, this result has a special practical interest because Knowledge Based Systems could benefit of it due to the Horn-like structure of the formulas. In order to prove such linearity a correct refutational calculi is first provided and second, a linear algorithm is described.