The complexity of minimum partial truth assignments and implication in negation-free formulae

@article{Delgrande1996TheCO,
  title={The complexity of minimum partial truth assignments and implication in negation-free formulae},
  author={James P. Delgrande and Arvind Gupta},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={1996},
  volume={18},
  pages={51-67}
}
In Artificial Intelligence there has been a great deal of interest in the tradeoff between expressiveness and tractability for various areas of symbolic reasoning. Here we present several complexity theory results for two areas, wherein we restrict the application of negation. First, we consider the problem of determining a minimum satisfying assignment for a (restricted) propositional sentence. We show that the problem of determining a minimum satisfying assignment for a sentence in negation… CONTINUE READING