The following pages link to Rajeev Goré (Q229747):
Displaying 50 items.
- ExpTime tableaux for \(\mathcal {ALC}\) using sound global caching (Q352943) (← links)
- Completeness of hyper-resolution via the semantics of disjunctive logic programs (Q1041788) (← links)
- Cut-free sequent and tableau systems for propositional Diodorean modal logics (Q1337606) (← links)
- Issues in machine-checking the decidability of implicational ticket entailment (Q1694477) (← links)
- Well-founded unions (Q1799073) (← links)
- Display calculi for logics with relative accessibility relations (Q1973930) (← links)
- Cut-elimination for weak Grzegorczyk logic Go (Q2016062) (← links)
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT (Q2142066) (← links)
- A formally verified cut-elimination procedure for linear nested sequents for tense logic (Q2142082) (← links)
- Cut-elimination for provability logic by terminating proof-search: formalised and deconstructed using Coq (Q2142084) (← links)
- A proof-theoretic perspective on SMT-solving for intuitionistic propositional logic (Q2180511) (← links)
- Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Q2180517) (← links)
- (Q2703745) (← links)
- (Q2721200) (← links)
- (Q2753601) (← links)
- (Q2771720) (← links)
- Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi (Q2817943) (← links)
- (Q2843910) (← links)
- A Labelled Sequent Calculus for BBI: Proof Theory and Proof Search (Q2851943) (← links)
- VALENTINI’S CUT-ELIMINATION FOR PROVABILITY LOGIC RESOLVED (Q2890695) (← links)
- (Q2904053) (← links)
- BDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics (Q2908501) (← links)
- Sequent Calculus in the Topos of Trees (Q2948556) (← links)
- (Q2958523) (← links)
- On the Correspondence between Display Postulates and Deep Inference in Nested Sequent Calculi for Tense Logics (Q3003326) (← links)
- Craig Interpolation in Displayable Logics (Q3010362) (← links)
- (Q3086939) (← links)
- (Q3086940) (← links)
- From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic (Q3190166) (← links)
- And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL (Q3192179) (← links)
- A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description (Q3192197) (← links)
- Implementing Tableau Calculi Using BDDs: BDDTab System Description (Q3192204) (← links)
- Machine-Checked Proof-Theory for Propositional Modal Logics (Q3305555) (← links)
- A First-Order Policy Language for History-Based Transaction Monitoring (Q3393401) (← links)
- Clausal Tableaux for Multimodal Logics of Belief (Q3397155) (← links)
- Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic (Q3406690) (← links)
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (Q3454118) (← links)
- One-Pass Tableaux for Computation Tree Logic (Q3498455) (← links)
- An Experimental Evaluation of Global Caching for $\mathcal {ALC}$ (System Description) (Q3541710) (← links)
- Optimal Tableau Algorithms for Coalgebraic Logics (Q3557073) (← links)
- Machine Checking Proof Theory: An Application of Logic to Logic (Q3601798) (← links)
- Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs (Q3602955) (← links)
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS (Q3620615) (← links)
- Taming Displayed Tense Logics Using Nested Sequents with Deep Inference (Q3648731) (← links)
- Sound Global State Caching for ALC with Inverse Roles (Q3648732) (← links)
- Gaggles, Gentzen and Galois: how to display your favourite substructural logic (Q4221769) (← links)
- (Q4246973) (← links)
- (Q4247207) (← links)
- (Q4247208) (← links)
- (Q4263013) (← links)
