The SCEAS System
| |||||||

## Search the dblp DataBase
Rajeev Goré:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jennifer M. Davoren, Rajeev Goré
**Bimodal Logics for Reasoning About Continuous Dynamics.**[Citation Graph (0, 0)][DBLP] Advances in Modal Logic, 2000, pp:91-111 [Conf] - Nicolette Bonnette, Rajeev Goré
**A Labelled Sequent System for Tense Logic K**[Citation Graph (0, 0)][DBLP]_{t}. Australian Joint Conference on Artificial Intelligence, 1998, pp:71-82 [Conf] - Jeremy E. Dawson, Rajeev Goré
**Machine-Checking the Timed Interval Calculus.**[Citation Graph (0, 0)][DBLP] Australian Joint Conference on Artificial Intelligence, 2002, pp:95-106 [Conf] - Jeremy E. Dawson, Rajeev Goré
**A Mechanisation of Classical Modal Tense Logics Using Isabelle.**[Citation Graph (0, 0)][DBLP] Australian Joint Conference on Artificial Intelligence, 1998, pp:107-118 [Conf] - Andrew Slater, Rajeev Goré, Joachim Posegga, Harald Vogt
**cardT**[Citation Graph (0, 0)][DBLP]^{A}P: Automated Deduction on a Smart Card. Australian Joint Conference on Artificial Intelligence, 1998, pp:239-247 [Conf] - Bernhard Beckert, Rajeev Goré
**System Description:**[Citation Graph (0, 0)][DBLP]*lean*K 2.0. CADE, 1998, pp:51-55 [Conf] - Stéphane Demri, Rajeev Goré
**Tractable Transformations from Modal Provability Logics into First-Order Logic.**[Citation Graph (0, 0)][DBLP] CADE, 1999, pp:16-30 [Conf] - Rajeev Goré, Joachim Posegga, Andrew Slater, Harald Vogt
**System Description:**[Citation Graph (0, 0)][DBLP]*card**T*^{A}*P*: The First Theorem Prover on a Smart Card. CADE, 1998, pp:47-50 [Conf] - Jeremy E. Dawson, Rajeev Goré
**A General Theorem on Termination of Rewriting.**[Citation Graph (0, 0)][DBLP] CSL, 2004, pp:100-114 [Conf] - Rajeev Goré
**Cut-free Display Calculi for Relation Algebras.**[Citation Graph (0, 0)][DBLP] CSL, 1996, pp:198-210 [Conf] - Rajeev Goré, Kotagiri Ramamohanarao
**Automatic Synthesis of Boolean Equations Using Programmable Array Logic.**[Citation Graph (0, 0)][DBLP] DAC, 1989, pp:283-289 [Conf] - Rajeev Goré, Phuong Thê Nguyên
**CardS4: Modal Theorem Proving on Java Smartcards.**[Citation Graph (0, 0)][DBLP] E-smart, 2001, pp:111-123 [Conf] - Jennifer M. Davoren, Thomas Moor, Rajeev Goré, Vaughan Coulthard, Anil Nerode
**On Two-Sided Approximate Model-Checking: Problem Formulation and Solution via Finite Topologies.**[Citation Graph (0, 0)][DBLP] FORMATS/FTRTFT, 2004, pp:52-67 [Conf] - Stéphane Demri, Rajeev Goré
**An O ((**[Citation Graph (0, 0)][DBLP]*n*·log*n*)^{3})-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic. FTP (LNCS Selection), 1998, pp:152-166 [Conf] - Agnes Boskovitz, Rajeev Goré, Markus Hegland
**A Logical Formalisation of the Fellegi-Holt Method of Data Cleaning.**[Citation Graph (0, 0)][DBLP] IDA, 2003, pp:554-565 [Conf] - Rajeev Goré, Lan Duy Nguyen
**CardKt: Automated Multi-modal Deduction on Java Cards for Multi-application Security.**[Citation Graph (0, 0)][DBLP] Java Card Workshop, 2000, pp:38-51 [Conf] - Jeremy E. Dawson, Rajeev Goré
**A Mechanised Proof System for Relation Algebra using Display Logic.**[Citation Graph (0, 0)][DBLP] JELIA, 1998, pp:264-278 [Conf] - Pietro Abate, Rajeev Goré
**The Tableaux Work Bench.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 2003, pp:230-236 [Conf] - Stéphane Demri, Rajeev Goré
**Cut-Free Display Calculi for Nominal Tense Logics.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 1999, pp:155-170 [Conf] - Bernhard Beckert, Rajeev Goré
**Free Variable Tableaux for Propositional Modal Logics.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 1997, pp:91-106 [Conf] - Bernhard Beckert, Rajeev Goré
**leanK 2.0.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 1998, pp:33-34 [Conf] - Rajeev Goré
**Dual Intuitionistic Logic Revisited.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 2000, pp:252-267 [Conf] - Rajeev Goré, Linh Anh Nguyen
**A Tableau Calculus with Automaton-Labelled Formulae for Regular Grammar Logics.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 2005, pp:138-152 [Conf] - Vijay Boyapati, Rajeev Goré
**KtSeqC: System Description.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 1999, pp:29-31 [Conf] - Jeremy E. Dawson, Rajeev Goré
**Formalised Cut Admissibility for Display Logic.**[Citation Graph (0, 0)][DBLP] TPHOLs, 2002, pp:131-147 [Conf] - Jeremy E. Dawson, Rajeev Goré
**A New Machine-checked Proof of Strong Normalisation for Display Logic.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal] - Carlos Areces, Enrico Franconi, Rajeev Goré, Maarten de Rijke, Bernd-Holger Schlingloff
**Editorial.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 2000, v:8, n:3, pp:- [Journal] - Rajeev Goré
**Substructural Logics on Display.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 1998, v:6, n:3, pp:451-504 [Journal] - Rajeev Goré
**Gaggles, Gentzen and Galois: How to display your favourite substructural logic.**[Citation Graph (0, 0)][DBLP] Logic Journal of the IGPL, 1998, v:6, n:5, pp:669-694 [Journal] - Linh Anh Nguyen, Rajeev Goré
**Completeness of hyper-resolution via the semantics of disjunctive logic programs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2005, v:95, n:2, pp:363-369 [Journal] - Rajeev Goré
**Displaying Modal Logic, Heinrich Wansing.**[Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 2000, v:9, n:2, pp:269-272 [Journal] - Stéphane Demri, Rajeev Goré
**Display Calculi for Logics with Relative Accessibility Relations.**[Citation Graph (0, 0)][DBLP] Journal of Logic, Language and Information, 2000, v:9, n:2, pp:213-236 [Journal] - Stéphane Demri, Rajeev Goré
**Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2002, v:12, n:5, pp:861-884 [Journal] - Stéphane Demri, Rajeev Goré
**Display Calculi for Nominal Tense Logics.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2002, v:12, n:6, pp:993-1016 [Journal] - Rajeev Goré, Wolfgang Heinle, Alain Heuerding
**Relations Between Propositional Normal Modal Logics: An Overview.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 1997, v:7, n:5, pp:649-658 [Journal] - Valeria de Paiva, Rajeev Goré, Michael Mendler
**Editorial.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2004, v:14, n:4, pp:439-446 [Journal] - Valeria de Paiva, Rajeev Goré, Michael Mendler
**Forthcoming Papers.**[Citation Graph (0, 0)][DBLP] J. Log. Comput., 2004, v:14, n:4, pp:621-622 [Journal] - Bernhard Beckert, Rajeev Goré
**Free-Variable Tableaux for Propositional Modal Logics.**[Citation Graph (0, 0)][DBLP] Studia Logica, 2001, v:69, n:1, pp:59-96 [Journal] - Rajeev Goré
**Cut-free sequent and tableau systems for propositional Diodorean modal logics.**[Citation Graph (0, 0)][DBLP] Studia Logica, 1994, v:53, n:3, pp:433-458 [Journal] - Jeremy E. Dawson, Rajeev Goré
**Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle.**[Citation Graph (0, 0)][DBLP] Electr. Notes Theor. Comput. Sci., 2001, v:42, n:, pp:- [Journal] - Pietro Abate, Rajeev Goré, Florian Widmann
**One-Pass Tableaux for Computation Tree Logic.**[Citation Graph (0, 0)][DBLP] LPAR, 2007, pp:32-46 [Conf] - Rajeev Goré, Linh Anh Nguyen
**EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 2007, pp:133-148 [Conf] - Linda Buisman, Rajeev Goré
**A Cut-Free Sequent Calculus for Bi-intuitionistic Logic.**[Citation Graph (0, 0)][DBLP] TABLEAUX, 2007, pp:90-106 [Conf] - Linda Buisman, Rajeev Goré
**A Cut-free Sequent Calculus for Bi-Intuitionistic Logic: Extended Version**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Valentini's cut-elimination for provability logic resolved.**[Citation Graph (, )][DBLP]**Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.**[Citation Graph (, )][DBLP]**An Experimental Evaluation of Global Caching for (System Description).**[Citation Graph (, )][DBLP]**An Optimal On-the-Fly Tableau-Based Decision Procedure for PDL-Satisfiability.**[Citation Graph (, )][DBLP]**Global Caching for Coalgebraic Description Logics.**[Citation Graph (, )][DBLP]**Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse.**[Citation Graph (, )][DBLP]**Termination of Abstract Reduction Systems.**[Citation Graph (, )][DBLP]**Analytic Cut-Free Tableaux for Regular Modal Logics of Agent Beliefs.**[Citation Graph (, )][DBLP]**EXPTIME Tableaux for ALC Using Sound Global Caching.**[Citation Graph (, )][DBLP]**Global Caching, Inverse Roles and Fixpoint Logics.**[Citation Graph (, )][DBLP]**A First-Order Policy Language for History-Based Transaction Monitoring.**[Citation Graph (, )][DBLP]**A Proof Theoretic Analysis of Intruder Theories.**[Citation Graph (, )][DBLP]**Sound Global State Caching for**[Citation Graph (, )][DBLP]*ALC*with Inverse Roles.**Taming Displayed Tense Logics Using Nested Sequents with Deep Inference.**[Citation Graph (, )][DBLP]**Optimal Tableau Algorithms for Coalgebraic Logics.**[Citation Graph (, )][DBLP]**Machine Checking Proof Theory: An Application of Logic to Logic.**[Citation Graph (, )][DBLP]**An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability**[Citation Graph (, )][DBLP]**A proof theoretic analysis of intruder theories**[Citation Graph (, )][DBLP]**A decidable policy language for history-based transaction monitoring**[Citation Graph (, )][DBLP]**Optimal Tableaux for Propositional Dynamic Logic with Converse**[Citation Graph (, )][DBLP]**A Proof Theoretic Analysis of Intruder Theories**[Citation Graph (, )][DBLP]**Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic**[Citation Graph (, )][DBLP]**The Tableau Workbench.**[Citation Graph (, )][DBLP]**An On-the-fly Tableau-based Decision Procedure for PDL-satisfiability.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |