Elaine Pimentel

Dr. Elaine Pimentel

Computer Science Department, University College London, London WC1E 6BT, UK
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2013 in Theoretical Computer Science
Verified
Journal Article
Closed access
DMDale Miller
Dale Miller
Elaine PimentelElaine Pimentel
Elaine Pimentel

22 February 2019 in ACM Transactions on Computational Logic
Verified
Journal Article
Open access
PDF file
BLBjörn Lellmann
Björn Lellmann
Elaine PimentelElaine Pimentel
Elaine Pimentel
In this work, we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules, we obtain linear nested sequent calculi for a number of logics, including, to our knowledge, the first nested sequent calculi for a large class of simply dependent multimodal logics and for many standard non-normal modal logics. The resulting systems are modular and have separate left and right introduction rules for the modalities, which makes them amenable to specification as bipole clauses. While this granulation of the sequent rules introduces more choices for proof search, we show how linear nested sequent calculi can be restricted to blocked derivations, which directly correspond to ordinary sequent derivations.

25 January 2022 in Annals of Pure and Applied Logic
Verified
Journal Article
Closed access
SMSonia Marin
Sonia Marin
DMDale Miller
Dale Miller
Elaine PimentelElaine Pimentel
Elaine Pimentel
MVMarco Volpe
Marco Volpe

6 June 2014 in Journal of Logic and Computation
Verified
Journal Article
Closed access
PDF file
VNVivek Nigam
Vivek Nigam
Elaine PimentelElaine Pimentel
Elaine Pimentel
GRGiselle Reis
Giselle Reis
It has been shown that linear logic can be successfully used as a framework for both specifying proof systems for a number of logics, as well as proving fundamental properties about the specified systems. This article shows how to extend the framework with subexponentials in order to declaratively encode a wider range of proof systems, including a number of non-trivial proof systems such as multi-conclusion intuitionistic logic, classical modal logic S4, intuitionistic Lax logic, and Negri's labelled proof systems for different modal logics. Moreover, we propose methods for checking whether an encoded proof system has important properties, such as if it admits cut-elimination, the completeness of atomic identity rules, and the invertibility of its inference rules. Finally, we present a tool implementing some of these specification/verification methods.

1 November 2015 in Theoretical Computer Science
Verified
Journal Article
Closed access
COCarlos Olarte
Carlos Olarte
Elaine PimentelElaine Pimentel
Elaine Pimentel
VNVivek Nigam
Vivek Nigam

3 May 2019 in Synthese
Verified
Journal Article
Closed access
PDF file
Elaine PimentelElaine Pimentel
Elaine Pimentel
LPLuiz Carlos Pereira
Luiz Carlos Pereira
VPValeria de Paiva
Valeria de Paiva