No photo of Anupam Das

View Scopus Profile

Anupam Das

Dr.

20112024

Research activity per year

  • 27 Conference contribution
  • 8 Article
  • 6 Preprint
  • 1 Foreword/postscript
Filter
Conference contribution

Search results

  • 2024

    Intuitionistic Gödel-Löb Logic, à la Simpson: Labelled Systems and Birelational Semantics

    Das, A., van der Giessen, I. & Marin, S., 7 Feb 2024, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Murano, A. & Silva, A. (eds.). Schloss Dagstuhl, p. 22:1-22:18 18 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 288).

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

    Open Access
    File
    71 Downloads (Pure)
  • 2023

    Comparing Infinitary Systems for Linear Logic with Fixed Points

    Das, A., De, A. & Saurin, A., 12 Dec 2023, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). Bouyer, P., Srinivasan, S. & Srinivasan, S. (eds.). Schloss Dagstuhl, p. 40:1-40:17 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 284).

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

    Open Access
    File
    9 Downloads (Pure)

  • Computational expressivity of (circular) proofs with fixed points

    Curzi, G. & Das, A., 14 Jul 2023, 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Institute of Electrical and Electronics Engineers (IEEE), 13 p. 10175772. (Proceedings - Symposium on Logic in Computer Science).

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

  • Cyclic Proofs for Arithmetical Inductive Definitions

    Das, A. & Melgaard, L., 28 Jun 2023, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Gaboardi, M. & van Raamsdonk, F. (eds.). Schloss Dagstuhl, 18 p. 27. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 260).

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

    Open Access
    File
    25 Downloads (Pure)

  • Non-Uniform Complexity via Non-Wellfounded Proofs

    Curzi, G. & Das, A., 1 Feb 2023, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Klin, B. & Pimentel, E. (eds.). Schloss Dagstuhl, 18 p. 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 252).

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

    Open Access
    File
    18 Downloads (Pure)

  • On Intuitionistic Diamonds (and Lack Thereof)

    Das, A. & Marin, S., 14 Sept 2023, Automated Reasoning with Analytic Tableaux and Related Methods: 32nd International Conference, TABLEAUX 2023, Prague, Czech Republic, September 18–21, 2023, Proceedings. Ramanayake, R. & Urban, J. (eds.). Springer, p. 283-301 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 14278 LNAI).

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

    Open Access
  • 2022

    Cyclic Implicit Complexity

    Curzi, G. & Das, A., 4 Aug 2022, LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Baier, C. (ed.). Association for Computing Machinery (ACM), 13 p. 19. (LICS: Logic in Computer Science).

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

  • Cyclic Proofs, Hypersequents, and Transitive Closure Logic

    Das, A. & Girlando, M., 17 Jul 2022, Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, Proceedings. Blanchette, J., Kovács, L. & Pattinson, D. (eds.). 1 ed. Springer, p. 509-528 20 p. (Lecture Notes in Computer Science; vol. 13385).

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

    Open Access
    File
    2 Citations (Scopus)
    11 Downloads (Pure)

  • Decision Problems for Linear Logic with Least and Greatest Fixed Points

    Das, A., De, A. & Saurin, A., 28 Jun 2022, 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Felty, A. P. (ed.). Schloss Dagstuhl, 20 p. 20. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 228).

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

    Open Access
    File
    1 Citation (Scopus)
    11 Downloads (Pure)

  • Modal logic and the polynomial hierarchy: from QBFs to K and back

    Das, A. & Marin, S., 25 Aug 2022, Advances in Modal Logic: Volume 14. Fernández-Duque, D., Palmigiano, A. & Pinchinat, S. (eds.). College Publications, p. 329-348 20 p. (Advances in Modal Logic; vol. 14).

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

    Open Access

  • Proof Complexity of Monotone Branching Programs

    Das, A. & Delkos, A., 26 Jun 2022, Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings. Berger, U., Franklin, J. N. Y., Manea, F. & Pauly, A. (eds.). 1 ed. Springer, p. 74-87 14 p. (Lecture Notes in Computer Science; vol. 13359).

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

  • 2021

    New minimal linear inferences in boolean logic independent of switch and medial

    Das, A. & Rice, A. A., 6 Jul 2021, 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021). Kobayashi, N. (ed.). Schloss Dagstuhl, 19 p. 14. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 195).

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

    Open Access
    File
    1 Citation (Scopus)
    13 Downloads (Pure)

  • On the logical strength of confluence and normalisation for cyclic proofs

    Das, A., 6 Jul 2021, 6th International Conference on Formal Structures for Computation and Deduction (FSCD 2021). Kobayashi, N. (ed.). Schloss Dagstuhl, 23 p. 29. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 195).

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

    Open Access
    File
    24 Downloads (Pure)
  • 2020

    Proof complexity of systems of (non-deterministic) decision trees and branching programs

    Buss, S., Das, A. & Knop, A., 6 Jan 2020, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Fernandez, M. & Muscholl, A. (eds.). Schloss Dagstuhl, 17 p. 12. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 152).

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

    Open Access
    File
    2 Citations (Scopus)
    79 Downloads (Pure)
  • 2018

    A recursion-theoretic characterisation of the positive polynomial-time functions

    Das, A. & Oitavem, I., 1 Aug 2018, 27th EASCL Annual Conference on Computer Science Logic 2018 (CSL 2018). Ghica, D. R. & Jung, A. (eds.). Schloss Dagstuhl, 17 p. 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 119).

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

    Open Access
    File
    23 Downloads (Pure)

  • Focussing, MALL and the Polynomial Hierarchy

    Das, A., 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

    Open Access
    File
    1 Citation (Scopus)
    192 Downloads (Pure)

  • Left-handed completeness for Kleene algebra, via cyclic proofs

    Das, A., Doumane, A. & Pous, D., 23 Oct 2018, LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Barthe, G., Sutcliffe, G. & Veanes, M. (eds.). EasyChair Publications, p. 271-289 19 p. (EPiC Series in Computing; vol. 57).

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

    Open Access
    10 Citations (Scopus)

  • Non-wellfounded proof theory for (Kleene+action)(Algebras+lattices)

    Das, A. & Pous, D., 1 Aug 2018, 27th EACSL Annual Conference on Computer Science Logic 2018 (CSL 2018). Ghica, D. R. & Jung, A. (eds.). Schloss Dagstuhl, p. 19:1 - 19:18 18 p. 19. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 119).

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

    Open Access
    File
    7 Citations (Scopus)
    47 Downloads (Pure)
  • 2017

    A cut-free cyclic proof system for kleene algebra

    Das, A. & Pous, D., 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

    Open Access
    File
    12 Citations (Scopus)
    178 Downloads (Pure)
  • 2016

    Free-cut elimination in linear logic and an application to a feasible arithmetic

    Baillot, P. & Das, A., 1 Aug 2016, 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). Talbot, J-M. & Regnier, L. (eds.). Schloss Dagstuhl, p. 40:1-40:18 18 p. 40. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 62).

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

    Open Access
    File
    26 Downloads (Pure)

  • From positive and intuitionistic bounded arithmetic to monotone proof complexity

    Das, A., 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 10 p. (LICS: Logic in Computer Science).

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

    Open Access
    File
    1 Citation (Scopus)
    166 Downloads (Pure)
  • 2015

    A Complete Axiomatization of MSO on Infinite Trees

    Das, A. & Riba, C., 3 Aug 2015, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science . Institute of Electrical and Electronics Engineers (IEEE), p. 390-401 12 p. 7174898. (Proceedings - Symposium on Logic in Computer Science).

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

    Open Access
    File
    2 Citations (Scopus)
    15 Downloads (Pure)

  • No complete linear term rewriting system for propositional logic

    Das, A. & Straßburger, L., 17 Jun 2015, 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Fernandez, M. (ed.). Schloss Dagstuhl, p. 127-142 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 36).

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

    Open Access
    4 Citations (Scopus)
  • 2014

    On the pigeonhole and related principles in deep inference and monotone systems

    Das, A., 14 Jul 2014, CSL-LICS '14: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) . Association for Computing Machinery (ACM), 10 p. 36. (LICS: Logic in Computer Science).

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

    Open Access
    File
    6 Citations (Scopus)
    16 Downloads (Pure)
  • 2013

    Rewriting with linear inferences in propositional logic

    Das, A., 2013, 24th International Conference on Rewriting Techniques and Applications, RTA 2013. van Raamsdonk, F. (ed.). Schloss Dagstuhl, p. 158-173 16 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 21).

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

    11 Citations (Scopus)
  • 2012

    Complexity of deep inference via atomic flows

    Das, A., 2012, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Proceedings. p. 139-150 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7318 LNCS).

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

    9 Citations (Scopus)
  • 2011

    On the proof complexity of cut-free bounded deep inference

    Das, A., 2011, Automated Reasoning with Analytic Tableaux and Related Methods - 20th International Conference, TABLEAUX 2011, Proceedings. p. 134-148 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6793 LNAI).

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

    10 Citations (Scopus)