Anil Shukla

According to our database, Anil Shukla authored at least 14 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Circuits, Proofs and Propositional Model Counting.

Sravanthi Chede, Leroy Chew, Anil Shukla

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023

Understanding Nullstellensatz for QBFs.

Sravanthi Chede, Leroy Chew, Balesh Kumar, Anil Shukla

Electron. Colloquium Comput. Complex., 2023

Extending Merge Resolution to a Family of QBF-Proof Systems.

Sravanthi Chede, Anil Shukla

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

2022

Extending Merge Resolution to a Family of Proof Systems.

Sravanthi Chede, Anil Shukla

Electron. Colloquium Comput. Complex., 2022

2021

QRAT Polynomially Simulates Merge Resolution.

Sravanthi Chede, Anil Shukla

Electron. Colloquium Comput. Complex., 2021

Does QRAT simulate IR-calc? QRAT simulation algorithm for $\forall$Exp+Res cannot be lifted to IR-calc.

Sravanthi Chede, Anil Shukla

Electron. Colloquium Comput. Complex., 2021

Does QRAT simulate IR-calc? QRAT simulation algorithm for ∀Exp+Res cannot be lifted to IR-calc.

Sravanthi Chede, Anil Shukla

CoRR, 2021

Extending Prolog for Quantified Boolean Horn Formulas.

Anish Mallick, Anil Shukla

CoRR, 2021

2018

Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

ACM Trans. Comput. Log., 2018

2016

Level-ordered Q-resolution and tree-like Q-resolution are incomparable.

Meena Mahajan, Anil Shukla

Inf. Process. Lett., 2016

Relating two width measures for resolution proofs.

Andreas Krebs, Meena Mahajan, Anil Shukla

Electron. Colloquium Comput. Complex., 2016

Are Short Proofs Narrow? QBF Resolution is not Simple.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Understanding Cutting Planes for QBFs.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

2015

Feasible Interpolation for QBF Resolution Calculi.

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015