86 résultats  enregistrer la recherche


inria-00100048v1  Communication dans un congrès
Didier GalmicheDaniel MéryResource Graphs and Countermodels in Resource Logics
IJCAR 2004 Workshop W1 on Disproving - Non-Theorems, Non-validity, Non-Provability, 2004, Cork/Ireland, 2004
inria-00100046v1  Communication dans un congrès
Nicolas BiriDidier GalmicheResource Tree and Logics for Distribution - abstract
2nd APPSEM II Workshop - APPSEM'04, 2004, Tallinn/Estonia, 2004
inria-00100047v1  Communication dans un congrès
Didier GalmicheJulien GobillotDaniel MéryProofs and countermodels in BI's pointer logic
2nd APPSEM II Workshop - APPSEM'04, 2004, Tallinn/Estonia, 2004
inria-00100050v1  Communication dans un congrès
Didier GalmichePeter O'HearnDavid PymLogics for Resources, Processes and Programs
ICALP - LICS 2004 Workshop, 2004, Turku, Finland, 192 p, 2004
hal-00176787v1  Communication dans un congrès
Didier GalmicheDominique Larchey-WendlingExpressivity properties of Boolean BI through Relational Models
26th Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS 2006, Dec 2006, Kolkota, India. Springer Berlin / Heidelberg, 4337, pp.357-368, 2006, Lecture Notes in Computer Science - LNCS. <10.1007/11944836_33>
...
hal-00577919v1  Communication dans un congrès
Dominique Larchey-WendlingDidier GalmicheThe Undecidability of Boolean BI through Phase Semantics
25th Annual IEEE Symposium on Logic in Computer Science - LICS 2010, Jul 2010, Edinburgh, United Kingdom. IEEE, pp.140-149, 2010, <10.1109/LICS.2010.18>
hal-00580298v1  Communication dans un congrès
Didier GalmicheYakoub SalhiLabel-free Proof Systems for Intuitionistic Modal Logic IS5
Edmund M. Clarke and Andrei Voronkov. 16th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-16, Apr 2010, Dakar, Senegal. Springer Verlag, 6355, pp.255-271, 2010, Lecture Notes in Artificial Intelligence. <10.1007/978-3-642-17511-4_15>
hal-00580301v1  Communication dans un congrès
Didier GalmicheDaniel MeryA Connection-based Characterization of Bi-intuitionistic Validity
23rd International Conference on Automated Deduction, CADE-23, Jul 2011, Wroclaw, Poland. pp.253-267, 2011, Lectures Notes in Computer Science 6803
hal-00580304v1  Communication dans un congrès
Didier GalmicheResource Trees: Models and Separation Logic
Int Workshop on Logics for Agents and Mobility, LAM'08, 2008, Hamburg, Germany. 2008
hal-00580305v1  Communication dans un congrès
Didier GalmicheYakoub SalhiLabelled Calculi for Lukasiewicz Logics
Wilfrid Hodges and Ruy de Queiroz. 15th International Workshop on Logic, Language, Information and Computation - WoLLIC '08, Jul 2008, Edinburgh, United Kingdom. Springer Verlag, pp.194--207, 2008, Lecture Notes in Artificial Intelligence 5110
hal-00580307v1  Communication dans un congrès
Didier GalmicheDominique Larchey-WendlingYakoub SalhiProvability and Countermodels in Gödel-Dummett Logics
International Workshop on Disproving: Non-theorems, Non-validity, Non-Provability - DISPROVING'07, Jul 2007, Bremen, Germany. pp.35-52, 2007
hal-00580296v1  Article dans une revue
Didier GalmicheYakoub SalhiLabel-free Natural Deduction Systems for Intuitionistic and Classical Modal Logics
Journal of Applied Non Classical Logics, 2010, 20 (4), pp.373-421. <10.3166/jancl.20.373-421>
hal-00580300v1  Communication dans un congrès
Didier GalmicheDaniel MeryCharacterization of bi-intuitionistic validity through resource games
International Workshop on Games for Logic and Programming Languages VI, GaLoP VI, Mar 2011, Saarbrucken, Germany. pp.10, 2011
hal-00580306v1  Communication dans un congrès
Didier GalmicheYakoub SalhiCalculi for an Intuitionistic Hybrid Modal Logic
International Workshop on Intuitionistic Modal Logic and Applications - IMLA'08, Jun 2008, CMU, Pittsburg, United States. pp.15, 2008
hal-00580308v1  Communication dans un congrès
Didier GalmicheDaniel MeryConnection-based proof search in intuitionistic logic from transitive closure of constraints
International Workshop on Automated Deduction: Decidability, Complexity, Tractability - ADDCT'07, Jul 2007, Bremen, Germany. pp.15, 2007
hal-00176760v1  Communication dans un congrès
Didier GalmicheBI Logic, Resource Models and Proofs
Geometry of Computation -GEOCAL'06 Workshop on Interaction and Space, Logics and Concurrency, Feb 2006, Marseille, France
inria-00098993v1  Chapitre d'ouvrage
Didier GalmicheVincent BalatLabelled Proof Systems for Intuitionistic Provability
D. Basin, M. D'Agostino, D.M. Gabbay, S. Matthews, L. Vigano. Labelled Deduction, 17 (17), Kluwer Academic Publishers, 31 p, 2000, Applied Logic Series, 0-7923-6237-3
inria-00098994v1  Direction d'ouvrage, Proceedings
Didier GalmicheJean-Paul BahsounJosé Luiz FiadeiroSpecial Issue on Proof Theory of Concurrent Object-Oriented Programming
Cambridge University Press, 1999, Mathematical Structures in Computer Science
inria-00100575v1  Communication dans un congrès
Didier GalmicheConnection Methods in Linear Logic and Proof Nets Construction Generation in Mixed Logics
Semantic Foundations of Proof-search, 2001, Schloss Dagsthul/Germany, 2001
inria-00100565v1  Communication dans un congrès
Didier GalmicheDaniel MéryProof-search and countermodel generation in propositional BI Logic - extended abstract
N. Kobayashi, B.C. Pierce. 4th International Symposium on Theoretical Aspects of Computer Software - TACS 2001, 2001, Sendai, Japan, Springer, 2215, pp.263-282, 2001, Lecture Notes in Computer Science
inria-00100564v1  Communication dans un congrès
Didier GalmicheJean-Marc NotinCalculi with dependency relations for Mixed Linear Logic
International Workshop on Logic and Complexity in Computer Science - LCCS'2001, 2001, Creteil/France, pp.81-102, 2001
...
hal-01256804v1  Communication dans un congrès
Dominique Larchey-WendlingDidier GalmicheLooking at Separation Algebras with Boolean BI-eyes
Josep Diaz; Ivan Lanese; Davide Sangiorgi. 8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. Springer, Lecture Notes in Computer Science, LNCS-8705, pp. 326-340, Theoretical Computer Science. <10.1007/978-3-662-44602-7_25>
inria-00100789v1  Communication dans un congrès
Didier GalmicheResources, Labels and Proofs
Theory and Application of Abstract State Machines 2002, 2002, Schloss Dagstuhl, Wadern/Germany, 2002
inria-00100790v1  Communication dans un congrès
Didier GalmicheDaniel MéryConnection-based proof search in propositional BI logic
A. Voronkov. 18th International Conference on Automated Deduction - CADE-18, 2002, Copenhagen/Denmark, Springer Verlag, 2392, pp.111-128, 2002, Lecture Notes in Computer Science
inria-00100791v1  Communication dans un congrès
Luc HabertJean-Marc NotinDidier GalmicheLINK: a Proof Environment based on Proof nets
U. Egly, C.G. Fermüller. International Conference on Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX'02, 2002, Copenhagen, Denmark, Springer Verlag, 2381, pp.330-334, 2002, Lecture Notes in Computer Science
inria-00100798v1  Communication dans un congrès
Didier GalmicheDaniel MéryDavid PymResource Tableaux (extended abstract)
J.C. Bradfield. 16th International Workshop on Computer Science Logic - CSL' 2002, 2002, Edinburgh, Scotland, UK, Springer Verlag, 2471, pp.183-199, 2002, Lecture Notes in Computer Science
inria-00100792v1  Communication dans un congrès
Nicolas BiriDidier GalmicheA Modal Linear Logic for Distribution and Mobility - extended abstract
Workshop on Linear Logic - FLOC'02, 2002, Copenhagen, Danemark, 6 p, 2002
...
hal-00580302v2  Chapitre d'ouvrage
Didier GalmicheDominique Larchey-WendlingJoseph Vidal-RossetSome Remarks on Relations between Proofs and Games
Pierre Edouard Bour, Manuel Rebuschi, Laurent Rollet,. Construction - Festschrift for Gerhard Heinzmann, College Publications, 2010, 978-1-84890-016-5. <http://www.collegepublications.co.uk/tributes/?00014>
hal-01259770v1  Communication dans un congrès
Jean-René CourtaultDidier GalmicheA Modal BI Logic for Dynamic Resource Properties
Int. Symposium on Logical Foundations of Computer Science, LFCS, 2013, San Diego, CA, United States. Springer Verlag, 7734, pp.134-148, 2013, Lecture Notes in Computer Science