default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Méry
Person information
- affiliation: Université de Lorraine, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Didier Galmiche, Daniel Méry:
Labelled Tableaux for Linear Time Bunched Implication Logic. FSCD 2023: 31:1-31:17- [i1]Tim S. Lyon, Agata Ciabattoni, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry, Nicola Olivetti, Revantha Ramanayake:
Internal and External Calculi: Ordering the Jungle without Being Lost in Translations. CoRR abs/2312.03426 (2023) - 2021
- [j6]Didier Galmiche, Daniel Méry:
Labelled cyclic proofs for separation logic. J. Log. Comput. 31(3): 892-922 (2021) - [c11]Didier Galmiche, Marta Gawek, Daniel Méry:
Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity. FSCD 2021: 13:1-13:21
2010 – 2019
- 2019
- [c10]Didier Galmiche, Michel Marti, Daniel Méry:
Relating Labelled and Label-Free Bunched Calculi in BI Logic. TABLEAUX 2019: 130-146 - 2018
- [c9]Didier Galmiche, Daniel Méry:
Labelled Connection-based Proof Search for Multiplicative Intuitionistic. ARQNL@IJCAR 2018: 49-63 - 2017
- [j5]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling
, Daniel Méry:
Separation Logic with One Quantified Variable. Theory Comput. Syst. 61(2): 371-461 (2017) - 2014
- [c8]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. CSR 2014: 125-138 - 2013
- [j4]Didier Galmiche, Daniel Méry:
A Connection-based Characterization of Bi-intuitionistic Validity. J. Autom. Reason. 51(1): 3-26 (2013) - 2011
- [c7]Didier Galmiche, Daniel Méry:
A Connection-Based Characterization of Bi-intuitionistic Validity. CADE 2011: 268-282 - 2010
- [j3]Didier Galmiche, Daniel Méry:
Tableaux and Resource Graphs for Separation Logic. J. Log. Comput. 20(1): 189-231 (2010)
2000 – 2009
- 2005
- [j2]Didier Galmiche, Daniel Méry, David J. Pym:
The semantics of BI and resource tableaux. Math. Struct. Comput. Sci. 15(6): 1033-1088 (2005) - [c6]Didier Galmiche, Daniel Méry:
Characterizing Provability in . LPAR 2005: 459-473 - 2004
- [b1]Daniel Méry:
Preuves et sémantiques dans des logiques de ressources. Henri Poincaré University, Nancy, France, 2004 - [c5]Didier Galmiche, Daniel Méry:
Resource Graphs and Countermodels in Resource Logics. D/PDPAR@IJCAR 2004: 117-135 - 2003
- [j1]Didier Galmiche, Daniel Méry:
Semantic Labelled Tableaux for Propositional BI. J. Log. Comput. 13(5): 707-753 (2003) - 2002
- [c4]Didier Galmiche, Daniel Méry:
Connection-Based Proof Search in Propositional BI Logic. CADE 2002: 111-128 - [c3]Didier Galmiche, Daniel Méry, David J. Pym:
Resource Tableaux. CSL 2002: 183-199 - 2001
- [c2]Dominique Larchey-Wendling, Daniel Méry, Didier Galmiche:
STRIP: Structural Sharing for Efficient Proof-Search. IJCAR 2001: 696-700 - [c1]Didier Galmiche, Daniel Méry:
Proof-Search and Countermodel Generation in Propositional BI Logic. TACS 2001: 263-282
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
