 |
 |
 |
 |
|
|
|
|---|---|---|
|
inria-00100081v1
Communication dans un congrès
Philippe De Groote, Bruno Guillaume, Sylvain Salvati. Vertor Addition Tree Automata 19th Annual IEEE Symposium on Logic in Computer Science - LICS'04, 2004, Turku, Finland, pp.64-73, 2004 |
||
|
inria-00100082v1
Communication dans un congrès
Philippe De Groote, Sylvain Salvati. Higher-order Matching in the Linear lambda-calculus with Pairing Jerzy Marcinkowski, Andrzej Tarlecki. 18th International Workshop on Computer Science Logic - CSL'2004, Sep 2004, Karpacz, Poland, Springer, 3210, pp.220-234, 2004, Lecture notes in Computer Science |
||
|
inria-00100244v1
Communication dans un congrès
Lutz Strassburger, François Lamarche. On Proof Nets for Multiplicative Linear Logic with Units Jerzy Marcinkowski and Andrzej Tarlecki. 18th International Workshop on Computer Science Logic - CSL'2004, 2004, Karpacz, Poland, Springer-Verlag, 3210, pp.145--159, 2004, Lecture Notes in Computer Science |
||
|
tel-00424232v1
Thèse
Guillaume Bagan. Algorithmes et complexité des problèmes d'énumération pour l'évaluation de requêtes logiques Autre [cs.OH]. Université de Caen, 2009. Français |
||
|
tel-00011871v1
Thèse
Pierre Hyvernat. A Logical Investigation of Interaction Systems Mathematics [math]. Université de la Méditerranée - Aix-Marseille II, 2005. English |
||
|
inria-00099593v1
Communication dans un congrès
Sylvain Salvati, Philippe De Groote. On the complexity of higher-order matching in the linear $\lambda$-calculus Robert Nieuwenhuis. International Conference on Rewriting Techniques and Applications - RTA'2003, Jun 2003, Valencia, Spain, 2706, pp.234-245, 2003, Lecture notes in Computer Science |
||
|
inria-00099221v1
Communication dans un congrès
Philippe De Groote. Proof-search in implicative linear logic as a matching problem Michel Parigot, Andrei Voronkov. International Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, Springer, 1955, pp.257-274, 2000, Lecture Notes in Artificial Intelligence |
||
|
inria-00098993v1
Chapitre d'ouvrage
Didier Galmiche, Vincent Balat. Labelled 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-00098911v1
Communication dans un congrès
François Lamarche. Spaces for linguistic representations and the semantics of linear Logic Dagstuhl Seminar 22.08.1999 - 27.08.1999, Aug 1999, none, 248, 1999, Dagstuhl seminar report |
||
|
inria-00098934v1
Rapport
Didier Galmiche, Dominique Larchey-Wendling. From Ordered Monoids to Quantales and Petri Nets: Revised Semantics and Completeness Results in Intuitionistic Linear Logic [Intern report] 99-R-116 || galmiche99k, 1999, 30 p |
||
|
tel-01066751v1
Thèse
Kim Dung Dang. Aide à la réalisation de systèmes de pilotage de narration interactive : validation d'un scénario basée sur un modèle en logique linéaire Autre [cs.OH]. Université de La Rochelle, 2013. Français. <NNT : 2013LAROS397> |
||
|
tel-00185844v1
Thèse
Maxime Amblard. Calculs de représentations sémantiques et syntaxe générative : les grammaires minimalistes catégorielles Autre [cs.OH]. Université Sciences et Technologies - Bordeaux I, 2007. Français |
||
|
inria-00099011v1
Article dans une revue
Guy Perrier. Labelled Proof Nets for the Syntax and Semantics of Natural Languages Logic Journal of the IGPL, Oxford University Press (OUP), 1999, 7 (5), pp.629-654 |
||
|
inria-00100563v1
Communication dans un congrès
Dominique Larchey. Refutations as countermodels in intuitionistic linear logic Semantic Foundations of Proof-search, 2001, Schloss Dagsthul/Germany, 2001 |
||
|
inria-00100564v1
Communication dans un congrès
Didier Galmiche, Jean-Marc Notin. Calculi 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 |
||
|
inria-00100711v1
Article dans une revue
Richard F. Blute, François Lamarche, Paul Ruet. Entropic Hopf Algebras and Models of Non Commutative Logic Theory and Applications of Categories, Mount Allison University, 2002, 10 (17), pp.424-460 |
||
|
tel-00011205v1
Thèse
Emmanuel Beffara. Logique, Réalisabilité et Concurrence Mathématiques [math]. Université Paris-Diderot - Paris VII, 2005. Français |
||
|
inria-00100790v1
Communication dans un congrès
Didier Galmiche, Daniel Méry. Connection-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 Habert, Jean-Marc Notin, Didier Galmiche. LINK: 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-00100792v1
Communication dans un congrès
Nicolas Biri, Didier Galmiche. A Modal Linear Logic for Distribution and Mobility - extended abstract Workshop on Linear Logic - FLOC'02, 2002, Copenhagen, Danemark, 6 p, 2002 |
||
|
inria-00100667v1
Communication dans un congrès
Guy Perrier. Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions Robert Nieuwenhuis, Andrei Voronkov. 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning - LPAR 2001, 2001, Havana, Cuba, France. Springer, 2250, pp.233-248, 2001, Lecture Notes in Artificial Intelligence |
||
|
inria-00147384v1
Communication dans un congrès
Guy Perrier. From Intuitionistic Proof Nets to Interaction Grammars TAG + 5, 2000, Paris/France, 9 p, 2000 |
||
|
inria-00098602v1
Rapport
Didier Galmiche, Giorgio Delzanno, Maurizio Martelli. A Specification Logic for Concurrent Object-Oriented Programming [Intern report] 98-R-127 || galmiche98d, 1998, 27 p |
||
|
inria-00098442v1
Communication dans un congrès
François Lamarche, Christian Retoré. Proof Nets for the Lambek Calculus - an overview Third Roma Workshop: Proofs in Linguistic Categories, 1998, Roma, Italy, Universita di Bologna, pp.241-262, 1998, Rapporto di Ricerca del Dipartimento de Filosifia |
||
|
inria-00098440v1
Communication dans un congrès
Alain Lecomte, Christian Retoré. Words as modules: a lexicalised grammar in the framework of linear logic proof nets. Carlos Martin-Vide. Mathematical & Computational Analysis of Natural Language (Proceedings of International conference on mathematical linguistics II), 1998, Tarragone, John Benjamins, 45, pp.129-144, 1998 |
||
|
inria-00098600v1
Communication dans un congrès
Didier Galmiche. Proof construction in linear logic and programming COST 15 LIEGE Seminar on Non Classical Logics for Computer Science Applications, invited lecture, 1998, Liege/Belgium, 1 p, 1998 |
||
|
inria-00098529v1
Communication dans un congrès
Didier Galmiche, Vincent Balat. Proof Systems for Intuitionistic Provability in Linear Logic First International Workshop on Labelled Deduction - Ld'98, 1998, Freiburg/Germany, 1998 |
||
|
tel-00084344v1
Thèse
Virgile Mogbil. Sémantique des phases, réseaux de preuve et divers problèmes de décision en logique linéaire. Mathématiques [math]. Université de la Méditerranée - Aix-Marseille II, 2001. Français |
||
|
inria-00099554v1
Communication dans un congrès
Didier Galmiche, Jean-Marc Notin. Connection-based proof construction in Non-Commutative Logic Moshe Y. Vardi and Andrei Voronkov. 10th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2003 - LPAR'03, 2003, Almaty/Kazakhstan, Springer Verlag, 2850, pp.422 - 436, 2003, Lecture Notes in Computer Science. <10.1007/b13986> |
||
|
inria-00098989v1
Communication dans un congrès
Didier Galmiche. Proof Plans and Proof Nets in Linear Logic -Abstract Floc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p, 1999 |
||
|
|
|