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 speedup 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.
oai:arar.sci.am:405402
ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան
Aug 7, 2025
Aug 7, 2025
1
https://arar.sci.am/publication/437419
Edition name | Date |
---|---|
Chubaryan, Anahit A., On Quantified Splitting Proof System for Propositional Calculi | Aug 7, 2025 |
Anahit A. Chubaryan
Anahit A. Chubaryan
Chubaryan, Anahit A.
Anahit A. Chubaryan Armine A. Chubaryan Գլխ. խմբ.՝ Անրի Ներսեսյան Պատ. խմբ.՝ Լինդա Խաչատրյան Խմբ. տեղակալ՝ Ռաֆայել Բարխուդարյան
Anahit A. Chubaryan Sergey Sayadyan
Apinyan, Levon A. Chubaryan, Anahit A.
Anahit A. Chubaryan Armine A. Chubaryan Sona R. Aleksanyan