BibSLEIGH — Rajeev

Travelled to:

1 × Australia
1 × Austria
1 × Brazil
1 × Canada
1 × Cyprus
1 × Poland
1 × The Netherlands
2 × Germany
2 × Italy
3 × USA
4 × United Kingdom

Collaborated with:

J.Thomson A.Tiu J.E.Dawson R.Clouston ∅ F.Widmann B.Beckert Z.Hou C.Kupke D.Pattinson L.Postniece S.Demri K.Ramamohanarao K.Olesen J.Wu C.Schürmann J.Brotherston N.Dershowitz A.Awad J.Thomson M.Weidlich L.Schröder J.Posegga A.Slater H.Vogt T.Lyon

Talks about:

logic (17) descript (6) intuitionist (5) proposit (5) theorem (5) system (5) sequent (4) calculi (4) use (4) bdd (4)

Person: Rajeev Goré

DBLP: Gor=eacute=:Rajeev

Facilitated 1 volumes:

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2004

1999

1998

1996

1989

2016

2018

2020

Wrote 26 papers:

CADE-2015-HouGT #automation #logic #proving #theorem proving: Automated Theorem Proving for Assertions in Separation Logic with All Connectives (ZH, RG, AT), pp. 501–516.
FoSSaCS-2015-CloustonG #calculus: Sequent Calculus in the Topos of Trees (RC, RG), pp. 133–147.
IJCAR-2014-Gore #fixpoint #logic #ltl: And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL (RG), pp. 26–45.
IJCAR-2014-GoreOT #calculus #implementation #using: Implementing Tableau Calculi Using BDDs: BDDTab System Description (RG, KO, JT), pp. 337–343.
IJCAR-2014-GoreTW #logic #proving #theorem proving #using: A History-Based Theorem Prover for Intuitionistic Propositional Logic Using Global Caching: IntHistGC System Description (RG, JT, JW), pp. 262–268.
POPL-2014-HouCGT #logic #proving: Proof search for propositional abstract separation logics via labelled sequents (ZH, RC, RG, AT), pp. 465–476.
CADE-2013-BeckertGS #algorithm #logic: Analysing Vote Counting Algorithms via Logic — And Its Application to the CADE Election Scheme (BB, RG, CS), pp. 135–144.
CADE-2013-GoreT #logic: An Improved BDD Method for Intuitionistic Propositional Logic: BDDIntKt System Description (RG, JT), pp. 275–281.
CSL-2013-CloustonDGT #calculus #linear #logic: Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.
IJCAR-2012-GoreT #automation #logic #reasoning: BDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics (RG, JT), pp. 301–315.
CAiSE-2011-AwadGTW #approach #process #synthesis: An Iterative Approach for Business Process Template Synthesis from Compliance Rules (AA, RG, JT, MW), pp. 406–421.
IJCAR-2010-GoreKPS #algebra #logic: Global Caching for Coalgebraic Description Logics (RG, CK, DP, LS), pp. 46–60.
IJCAR-2010-GoreW #logic: Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (RG, FW), pp. 225–239.
TACAS-2010-GoreKP #algebra #algorithm #logic: Optimal Tableau Algorithms for Coalgebraic Logics (RG, CK, DP), pp. 114–128.
CADE-2009-GoreW #on the fly #satisfiability: An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability (RG, FW), pp. 437–452.
RTA-2009-TiuG #analysis #proving: A Proof Theoretic Analysis of Intruder Theories (AT, RG), pp. 103–117.
IJCAR-2008-GoreP #evaluation: An Experimental Evaluation of Global Caching for (RG, LP), pp. 299–305.
CSL-2004-DawsonG #termination #theorem: A General Theorem on Termination of Rewriting (JED, RG), pp. 100–114.
CADE-1999-DemriG #first-order #logic: Tractable Transformations from Modal Provability Logics into First-Order Logic (SD, RG), pp. 16–30.
CADE-1998-BeckertG: System Description: leanK 2.0 (BB, RG), pp. 51–55.
CADE-1998-GorePSV #proving #smarttech #theorem proving: System Description: card TAP: The First Theorem Prover on a Smart Card (RG, JP, AS, HV), pp. 47–50.
CSL-1996-Gore #algebra #calculus: Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.
DAC-1989-GoreR #array #automation #equation #logic #programmable #synthesis #using: Automatic Synthesis of Boolean Equations Using Programmable Array Logic (RG, KR), pp. 283–289.
IJCAR-2016-DawsonBG #calculus #logic #theorem #using: Machine-Checked Interpolation Theorems for Substructural Logics Using Display Calculi (JED, JB, RG), pp. 452–468.
IJCAR-2018-DawsonDG: Well-Founded Unions (JED, ND, RG), pp. 117–133.
CSL-2020-LyonTGC #logic: Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents (TL, AT, RG, RC), p. 16.