Filtrer vos résultats
- 94
- 12
- 61
- 28
- 10
- 4
- 2
- 1
- 104
- 4
- 1
- 3
- 3
- 1
- 4
- 8
- 2
- 3
- 1
- 4
- 6
- 2
- 3
- 6
- 1
- 3
- 4
- 2
- 5
- 4
- 4
- 5
- 5
- 9
- 6
- 9
- 2
- 1
- 105
- 1
- 103
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 106
- 27
- 21
- 11
- 9
- 6
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
106 résultats
A Connection-based Characterization of Bi-intuitionistic ValidityJournal of Automated Reasoning, 2013, 51 (1), pp.3--26. ⟨10.1007/s10817-013-9279-4⟩
Article dans une revue
istex
hal-01258963v1
|
|||
Labelled Connection-based Proof Search for Multiplicative Intuitionistic Linear LogicInternational Workshop on Automated Reasoning in Quantified Non-Classical Logics, ARQNL 2018, 2018, Oxford, United Kingdom. pp.49-63
Communication dans un congrès
hal-02982539v1
|
|||
An Epistemic Resource Logic based on Boolean BIInt. Workshop Substructural Logics: Semantics, Proof Theory and Applications, SYSMICS 2018, 2018, Vienna, Austria
Communication dans un congrès
hal-02986789v1
|
|||
|
Separation Logic with One Quantified Variable9th International Computer Science Symposium (CSR 2014), Jun 2014, Moscou, Russia. ⟨10.1007/978-3-319-06686-8_10⟩
Communication dans un congrès
hal-01258802v1
|
||
STRIP: Structural sharing and intuitionistic proof-search[Intern report] A00-R-342 || galmiche00h, 2000, 5 p
Rapport
inria-00099328v1
|
|||
|
Connection Methods in Linear Logic and Proof nets ConstructionTheoretical Computer Science, 2000, 232 (1-2), pp.231-272. ⟨10.1016/S0304-3975(99)00176-0⟩
Article dans une revue
inria-00099205v1
|
||
Labelled Calculi for Lukasiewicz Logics15th International Workshop on Logic, Language, Information and Computation - WoLLIC '08, Jul 2008, Edinburgh, United Kingdom. pp.194--207
Communication dans un congrès
hal-00580305v1
|
|||
Connection Methods in Linear Logic and Proof Nets Construction Generation in Mixed LogicsSemantic Foundations of Proof-search, 2001, Schloss Dagsthul/Germany
Communication dans un congrès
inria-00100575v1
|
|||
The semantics of BI and resource tableauxMathematical Structures in Computer Science, 2005, 15, pp.1033-1088
Article dans une revue
hal-00076735v1
|
|||
Special issue of Philosophia Scientiae - Alan Turing16 (3), 2012
Ouvrages
hal-01262634v1
|
|||
|
A Separation Logic for Resource Distribution23rd Conference on Foundations of Software Technology and Theoretical Computer Science 2003 - FST TCS'03, 2003, Mumbai/India, pp.23-37, ⟨10.1007/b94618⟩
Communication dans un congrès
inria-00099555v1
|
||
A Connection-based Characterization of Bi-intuitionistic Validity23rd International Conference on Automated Deduction, CADE-23, Jul 2011, Wroclaw, Poland. pp.253-267
Communication dans un congrès
hal-00580301v1
|
|||
Beth Semantics and Labelled Deduction for Intuitionistic Sentential Calculus with Identity6th International Conference on Formal Structures for Computation and Deduction, FSCD 2021, Jul 2021, Buenos Aires/online, Argentina. pp.1-21, ⟨10.4230/LIPIcs.FSCD.2021.13⟩
Communication dans un congrès
hal-03563655v1
|
|||
Alan TuringJack Copeland; Didier Galmiche; Dominique Larchey-Wendling; Joseph Vidal-Rosset. , 2012, 9782841746033
Ouvrages
hal-01245182v1
|
|||
|
The Undecidability of Boolean BI through Phase Semantics25th Annual IEEE Symposium on Logic in Computer Science - LICS 2010, Jul 2010, Edinburgh, United Kingdom. pp.140-149, ⟨10.1109/LICS.2010.18⟩
Communication dans un congrès
hal-00577919v1
|
||
Expressivity properties of Boolean BI through Relational Models26th Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS 2006, Dec 2006, Kolkota, India. pp.357-368, ⟨10.1007/11944836_33⟩
Communication dans un congrès
istex
hal-00176787v1
|
|||
Connection-based proof search in propositional BI logic18th International Conference on Automated Deduction - CADE-18, 2002, Copenhagen/Denmark, pp.111-128
Communication dans un congrès
inria-00100790v1
|
|||
LINK: a Proof Environment based on Proof netsInternational Conference on Automated Reasoning with Analytic Tableaux and Related Methods - TABLEAUX'02, 2002, Copenhagen, Denmark, pp.330-334
Communication dans un congrès
inria-00100791v1
|
|||
Label-free Natural Deduction Systems for Intuitionistic and Classical Modal LogicsJournal of Applied Non-Classical Logics, 2010, 20 (4), pp.373-421. ⟨10.3166/jancl.20.373-421⟩
Article dans une revue
hal-00580296v1
|
|||
Some Issues about Proof Search in Linear Logic - abstractLogic & Computation - LC'99, Workshop on Proofs, 1999, Edinburgh, Scotland, 36 p
Communication dans un congrès
inria-00098991v1
|
|||
Structural Sharing and Efficient Proof-Search in Propositional Intuitionistic LogicAsian Computing Science Conference - ASIAN'99, 1999, Phuket, Thailand, pp.101-112
Communication dans un congrès
inria-00098992v1
|
|||
|
Connection-based proof construction in Non-Commutative Logic10th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2003 - LPAR'03, 2003, Almaty/Kazakhstan, pp.422 - 436, ⟨10.1007/b13986⟩
Communication dans un congrès
inria-00099554v1
|
||
Quantales as completions of ordered monoids: revised semantics for Intuitionistic Linear LogicElectronic Notes in Theoretical Computer Science, 2000, 35, 15 p
Article dans une revue
inria-00099226v1
|
|||
Workshop on Type-theoretic Languages: Proof-search and Semantics17th Conference on Automated DEduction - CADE-17, D. Galmiche, 2000, CMU, Pittsburgh/USA, 90 p
Communication dans un congrès
inria-00099240v1
|
|||
Special Issue on Computational Logic ( in honor to Roy Dyckhoff) of Journal of Logic and ComputationOxford University Press (OUP), 26 (2), 2016, ⟨10.1093/logcom/exu039⟩
Ouvrages
hal-01263202v1
|
|||
|
Foundations of Proof Search Strategies Design in Linear LogicLogical Foundations of Computer Science, 1994, St-Petersburg, Russia. pp.101-113
Communication dans un congrès
hal-01297758v1
|
||
Labelled Cyclic Proofs for Separation LogicInternational Workshop on Automated Deduction for Separation Logics, ADSL 2018, 2018, Oxford, United Kingdom
Communication dans un congrès
hal-02982617v1
|
|||
|
Separation Logic with One Quantified VariableTheory of Computing Systems, 2017, 61 (2), pp.371-461. ⟨10.1007/s00224-016-9713-1⟩
Article dans une revue
hal-01258821v1
|
||
Resource Tree and Logics for Distribution - abstract2nd APPSEM II Workshop - APPSEM'04, Institute of Cybernetics, 2004, Tallinn/Estonia
Communication dans un congrès
inria-00100046v1
|
|||
Resource Graphs and Countermodels in Resource LogicsIJCAR 2004 Workshop W1 on Disproving - Non-Theorems, Non-validity, Non-Provability, 2004, Cork/Ireland
Communication dans un congrès
inria-00100048v1
|