Subramani, K.; Wojciechowski, Piotr; Sheng, Ying Read-once refutations in Horn constraint systems: an algorithmic approach. (English) Zbl 07589711 J. Log. Comput. 32, No. 4, 667-696 (2022). MSC: 03-XX 68-XX PDFBibTeX XMLCite \textit{K. Subramani} et al., J. Log. Comput. 32, No. 4, 667--696 (2022; Zbl 07589711) Full Text: DOI
Subramani, K.; Wojciechowski, Piotr Exact and parameterized algorithms for read-once refutations in Horn constraint systems. (English) Zbl 07551727 Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10–13, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13137, 327-345 (2022). MSC: 03B70 PDFBibTeX XMLCite \textit{K. Subramani} and \textit{P. Wojciechowski}, Lect. Notes Comput. Sci. 13137, 327--345 (2022; Zbl 07551727) Full Text: DOI
Wojciechowski, Piotr; Subramani, K. Copy complexity of Horn formulas with respect to unit read-once resolution. (English) Zbl 1514.68086 Theor. Comput. Sci. 890, 70-86 (2021). MSC: 68Q25 03F20 PDFBibTeX XMLCite \textit{P. Wojciechowski} and \textit{K. Subramani}, Theor. Comput. Sci. 890, 70--86 (2021; Zbl 1514.68086) Full Text: DOI
Kleine Büning, Hans; Wojciechowski, P.; Subramani, K. NAE-resolution: a new resolution refutation technique to prove not-all-equal unsatisfiability. (English) Zbl 1492.68064 Math. Struct. Comput. Sci. 30, No. 7, 736-751 (2020). MSC: 68Q25 03B35 03F20 68Q17 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Math. Struct. Comput. Sci. 30, No. 7, 736--751 (2020; Zbl 1492.68064) Full Text: DOI
Kleine Büning, Hans; Wojciechowski, Piotr; Chandrasekaran, R.; Subramani, K. Restricted cutting plane proofs in Horn constraint systems. (English) Zbl 1435.68303 Herzig, Andreas (ed.) et al., Frontiers of combining systems. 12th international symposium, FroCoS 2019, London, UK, September 4–6, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11715, 149-164 (2019). MSC: 68T20 03B70 03F07 68Q17 90C10 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Lect. Notes Comput. Sci. 11715, 149--164 (2019; Zbl 1435.68303) Full Text: DOI
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. Finding read-once resolution refutations in systems of 2CNF clauses. (English) Zbl 1435.03086 Theor. Comput. Sci. 729, 42-56 (2018). MSC: 03F20 68Q17 68Q25 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Theor. Comput. Sci. 729, 42--56 (2018; Zbl 1435.03086) Full Text: DOI
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. The complexity of finding read-once NAE-resolution refutations. (English) Zbl 1483.68145 Ghosh, Sujata (ed.) et al., Logic and its applications. 7th Indian conference, ICLA 2017, Kanpur, India, January 5–7, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10119, 64-76 (2017). MSC: 68Q25 03B05 03B35 03F20 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Lect. Notes Comput. Sci. 10119, 64--76 (2017; Zbl 1483.68145) Full Text: DOI
Wojciechowski, Piotr; Eirinakis, Pavlos; Subramani, K. Erratum to: “Analyzing restricted fragments of the theory of linear arithmetic”. (English) Zbl 1393.68054 Ann. Math. Artif. Intell. 79, No. 4, 371-392 (2017). MSC: 68Q15 03D15 90C05 PDFBibTeX XMLCite \textit{P. Wojciechowski} et al., Ann. Math. Artif. Intell. 79, No. 4, 371--392 (2017; Zbl 1393.68054) Full Text: DOI
Kleine Büning, Hans; Wojciechowski, Piotr; Subramani, K. On the computational complexity of read once resolution decidability in 2CNF formulas. (English) Zbl 1485.68110 Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 362-372 (2017). MSC: 68Q25 03B35 03F07 68R07 68Q17 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Lect. Notes Comput. Sci. 10185, 362--372 (2017; Zbl 1485.68110) Full Text: DOI arXiv
Wojciechowski, Piotr; Eirinakis, Pavlos; Subramani, K. Analyzing restricted fragments of the theory of linear arithmetic. (English) Zbl 1390.68318 Ann. Math. Artif. Intell. 79, No. 1-3, 245-266 (2017); erratum ibid. 79, No. 4, 371-392 (2017). MSC: 68Q15 03D15 90C05 PDFBibTeX XMLCite \textit{P. Wojciechowski} et al., Ann. Math. Artif. Intell. 79, No. 1--3, 245--266 (2017; Zbl 1390.68318) Full Text: DOI
Eirinakis, Pavlos; Ruggieri, Salvatore; Subramani, K.; Wojciechowski, Piotr On quantified linear implications. (English) Zbl 1319.68102 Ann. Math. Artif. Intell. 71, No. 4, 301-325 (2014). MSC: 68Q17 03D15 90C05 PDFBibTeX XMLCite \textit{P. Eirinakis} et al., Ann. Math. Artif. Intell. 71, No. 4, 301--325 (2014; Zbl 1319.68102) Full Text: DOI
Ruggieri, Salvatore; Eirinakis, Pavlos; Subramani, K.; Wojciechowski, Piotr On the complexity of quantified linear systems. (English) Zbl 1358.03051 Theor. Comput. Sci. 518, 128-134 (2014). MSC: 03D15 68Q15 68Q25 90C05 PDFBibTeX XMLCite \textit{S. Ruggieri} et al., Theor. Comput. Sci. 518, 128--134 (2014; Zbl 1358.03051) Full Text: DOI
Subramani, K.; Williamson, Matthew; Gu, Xiaofeng Improved algorithms for optimal length resolution refutation in difference constraint systems. (English) Zbl 1259.68261 Formal Asp. Comput. 25, No. 2, 319-341 (2013). MSC: 68W40 03B35 PDFBibTeX XMLCite \textit{K. Subramani} et al., Formal Asp. Comput. 25, No. 2, 319--341 (2013; Zbl 1259.68261) Full Text: DOI
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun Boolean functions as models for quantified Boolean formulas. (English) Zbl 1126.03015 J. Autom. Reasoning 39, No. 1, 49-75 (2007). MSC: 03B05 06E30 68Q25 68Q60 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., J. Autom. Reasoning 39, No. 1, 49--75 (2007; Zbl 1126.03015) Full Text: DOI
Subramani, K.; Desovski, D. Out of order quantifier elimination for standard quantified linear programs. (English) Zbl 1125.68142 J. Symb. Comput. 40, No. 6, 1383-1396 (2005). MSC: 68W30 03C10 03B35 68Q25 90C05 PDFBibTeX XMLCite \textit{K. Subramani} and \textit{D. Desovski}, J. Symb. Comput. 40, No. 6, 1383--1396 (2005; Zbl 1125.68142) Full Text: DOI
Subramani, K.; Desovski, D. A new verification procedure for partially clairvoyant scheduling. (English) Zbl 1124.68014 Pettersson, Paul (ed.) et al., Formal modeling and analysis of timed systems. Third international conference, FORMATS 2005, Uppsala, Sweden, September 26–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30946-2/pbk). Lecture Notes in Computer Science 3829, 127-141 (2005). MSC: 68M20 68Q60 90B35 68W30 03C10 PDFBibTeX XMLCite \textit{K. Subramani} and \textit{D. Desovski}, Lect. Notes Comput. Sci. 3829, 127--141 (2005; Zbl 1124.68014) Full Text: DOI
Subramani, K. Tractable fragments of Presburger arithmetic. (English) Zbl 1090.68101 Theory Comput. Syst. 38, No. 5, 647-668 (2005). MSC: 68T20 03B25 03F30 68Q17 90C10 91A80 PDFBibTeX XMLCite \textit{K. Subramani}, Theory Comput. Syst. 38, No. 5, 647--668 (2005; Zbl 1090.68101) Full Text: DOI
Subramani, K. Optimal length tree-like resolution refutations for 2SAT formulas. (English) Zbl 1367.68114 ACM Trans. Comput. Log. 5, No. 2, 316-320 (2004). MSC: 68Q25 03F20 PDFBibTeX XMLCite \textit{K. Subramani}, ACM Trans. Comput. Log. 5, No. 2, 316--320 (2004; Zbl 1367.68114) Full Text: DOI
Kleine Büning, Hans; Subramani, K.; Zhao, Xishun On Boolean models for quantified Boolean Horn formulas. (English) Zbl 1204.03017 Giunchiglia, Enrico (ed.) et al., Theory and applications of satisfiability testing. 6th international conference, SAT 2003, Santa Margherita Ligure, Italy, May 5–8, 2003. Selected revised papers. Berlin: Springer (ISBN 3-540-20851-8/pbk). Lect. Notes Comput. Sci. 2919, 93-104 (2004). MSC: 03B05 68Q25 68Q60 68T15 PDFBibTeX XMLCite \textit{H. Kleine Büning} et al., Lect. Notes Comput. Sci. 2919, 93--104 (2004; Zbl 1204.03017) Full Text: DOI
Subramani, K. On determining the minimum length, tree-like resolution refutation of 2SAT, and extended 2SAT formulas. (English) Zbl 1030.68570 Jean-Marie, Alain (ed.), Advances in computing science - ASIAN 2002. Internet computing and modeling, grid computing, peer-to-peer computing, and cluster computing. 7th Asian computing science conference, Hanoi, Vietnam, December 4-6, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2550, 57-65 (2002). MSC: 68T15 68Q17 03F20 PDFBibTeX XMLCite \textit{K. Subramani}, Lect. Notes Comput. Sci. 2550, 57--65 (2002; Zbl 1030.68570) Full Text: Link