3 papers
cs.CC2021
QRAT Polynomially Simulates Merge Resolution
Sravanthi Chede, Anil Shukla
Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021] ) is a refutational proof system for quantified Boolean formulas (QBF). Each line of MRes consists of clauses wit…
cs.CC2021
Does QRAT simulate IR-calc? QRAT simulation algorithm for Exp+Res cannot be lifted to IR-calc
Sravanthi Chede, Anil Shukla
We show that the QRAT simulation algorithm of Exp+Res from [B. Kiesl and M. Seidl, 2019] cannot be lifted to IR-calc.
cs.LO2021
Extending Prolog for Quantified Boolean Horn Formulas
Anish Mallick, Anil Shukla
Prolog is a well known declarative programming language based on propositional Horn formulas. It is useful in various areas, including artificial intelligence, automated theorem pr…