2 citations · 2 across the 5 of their papers we have counts for
6 papers
On Knowledge Compilation Languages for QBFs
Sravanthi Chede, Vaibhav Krishan, Anil Shukla
In this work, we design knowledge compilation languages for quantified Boolean formulas (QBFs), with a particular focus on model counting. We introduce various languages in increas…
On Proof Systems for #QBF
Sravanthi Chede, Leroy Chew, Vaibhav Krishan +1
For a quantified Boolean formula (QBF), the problem of computing the number of winning strategies is known as the #QBF problem. This problem is considered harder than the analogous…
Extending Merge Resolution to a Family of Proof Systems
Sravanthi Chede, Anil Shukla
Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021]) is a recently introduced proof system for false QBFs. It stores the countermodels as merge maps. Merge maps are…
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…
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.
World War III Analysis using Signed Social Networks
Ranjana Roy Chowdhury, Shivam Gupta, Sravanthi Chede
In the recent period of time with a lot of social platforms emerging, the relationships among various units can be framed with respect to either positive, negative or no relation.…