Anupam Das

Colleges, School and Institutes

View graph of relations

Most downloaded publications

On linear rewriting systems for Boolean logic and some applications to proof theory
Anupam Das, 27 Apr 2017, In: Logical Methods in Computer Science. 12, 4, p. 1-27 27 p., 9.

Research output: Contribution to journal › Article › peer-review

72 downloads
From positive and intuitionistic bounded arithmetic to monotone proof complexity
Anupam Das, 5 Jul 2016, LICS '16 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. Association for Computing Machinery (ACM), p. 126-135

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

71 downloads
A cut-free cyclic proof system for kleene algebra
Anupam Das, 30 Aug 2017, Automated Reasoning with Analytic Tableaux and Related Methods : 26th International Conference, TABLEAUX 2017, Brasilia, Brazil, September 25-28 2017, Proceedings. Nalon, C. & Schmidt, R. A. (eds.). Springer, p. 261-277 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10501 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

64 downloads
Focussing, MALL and the Polynomial Hierarchy
Anupam Das, 30 Jun 2018, Automated Reasoning: 9th International Joint Conference, IJCAR 2018, Held as Part of the Federated Logic Conference, FloC 2018, Proceedings. Sebastiani, R., Galmiche, D. & Schulz, S. (eds.). Springer, p. 689-705 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10900 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

51 downloads
From QBFs to MALL and back via focussing
Anupam Das, Oct 2020, In: Journal of Automated Reasoning. 64, 7, p. 1221-1245 25 p.

Research output: Contribution to journal › Article › peer-review

37 downloads

Recent publications

From QBFs to MALL and back via focussing
Anupam Das, Oct 2020, In: Journal of Automated Reasoning. 64, 7, p. 1221-1245 25 p.

Research output: Contribution to journal › Article › peer-review

On the logical complexity of cyclic arithmetic
Anupam Das, 6 Jan 2020, In: Logical Methods in Computer Science. 16, 1, p. 1:1 - 1:39 39 p., 4818.

Research output: Contribution to journal › Article › peer-review

Proof complexity of systems of (non-deterministic) decision trees and branching programs
Anupam Das, 31 Dec 2019, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Fernández, M. & Muscholl, A. (eds.). Schloss Dagstuhl, p. 12:1-12:17 17 p. 12. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 152).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

View all (16)