3 research outputs found
Primal Infon Logic: Derivability in Polynomial Time
No full textPrimal infon logic (PIL), introduced by Gurevich and Neeman in 2009, is a logic for authorization in distributed systems. It is a variant of the (and, implies)-fragment of intuitionistic modal logic. It presents many interesting technical challenges -- one of them is to determine the complexity of the derivability problem. Previously, some restrictions of propositional PIL were proved to have a linear time algorithm, and some extensions have been proved to be PSPACE-complete. In this paper, we provide an O(N^3) algorithm for derivability in propositional PIL. The solution involves an interesting interplay between the sequent calculus formulation (to prove the subformula property) and the natural deduction formulation of the logic (based on which we provide an algorithm for the derivability problem)
ELUCIDATION OF PLAUSIBLE MECHANISMS OF KABASURAKUDINEER FOR COVID-19 BY MOLECULAR DOCKING AGAINST SARS COV-2
No full textThe COVID-19 virus main protease (Mpro)and papain like protease (PLpro) which are the key CoV enzyme, in mediating viral replication and transcription, making it an attractive drug target for this virus. Also, the spike protein also the potential targets for the SARS Cov-2 from which viral entry inhibitors can be designed. The Kabasurakudineer is known to possess the immune modulating and some of the ingredients has anti-viral activity. The docking of phytoconstituents in Kabasurakudineer to the above mentioned three targets shows that the phytoconstituents binds near the hotspot-31 and hotspot-353 residues and key residues of the receptor binding domain of the spike protein. It also inhibits virus main protease (Mpro) and papain like protease (PLpro) suggested by high binding affinity.
Keywords: Kabasuraku dineer, COVID-19, SARS Cov-2,in-silico, molecular docking, Antivira
