Abstract
In this paper, some new quantified propositional proof system is introduced and compared by proof complexities with other quantified and not quantified propositional proof systems. It is proved that the introduced system 1) is polynomially equivalent to its quantifier-free variant and 2) has exponential speed-up by sizes over some variants of the quantified resolution system. As the introduced system has a very simple proof construction strategy, it can be very useful not only in Logic, and therefore in Artificial Intelligence, but also in areas such as Computational Biology and Medical Diagnosis.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call