Stéphane Demri

165 papers A* 12A 10B 29C 5Misc 4Journal 79Unranked 20

Year	Rank	Type	Title / Venue / Authors
2026	B	`conf`	Robustness of Constraint Automata for Description Logics with Concrete Domains. CSL Stéphane Demri, Tianwen Gu
2026	J	`jnl`	Robustness of Constraint Automata for Description Logics with Concrete Domains. CoRR Stéphane Demri, Tianwen Gu
2025	J	`jnl`	Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. Log. Methods Comput. Sci. Stéphane Demri, Karin Quaas
2025	—	`conf`	Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS. RP Stéphane Demri, Laurent Doyen, Raul Fervari
2025	A*	`conf`	On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories. KR Stéphane Demri, Raul Fervari
2024	A	`conf`	Computational Complexity of Standpoint LTL. ECAI Stéphane Demri, Przemyslaw Andrzej Walega
2024	J	`jnl`	Computational Complexity of Standpoint LTL. CoRR Stéphane Demri, Przemyslaw Andrzej Walega
2023	J	`jnl`	Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. CoRR Stéphane Demri, Karin Quaas
2023	B	`conf`	Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. CONCUR Stéphane Demri, Karin Quaas
2023	B	`conf`	First Steps Towards Taming Description Logics with Strings. JELIA Stéphane Demri, Karin Quaas
2023	A*	`conf`	How to Manage a Budget with ATL+. KR Stéphane Demri, Raine Rönnholm
2023	A*	`conf`	Model-Checking for Ability-Based Logics with Constrained Plans. AAAI Stéphane Demri, Raul Fervari
2023	J	`jnl`	On Composing Finite Forests with Modal Logics. ACM Trans. Comput. Log. Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
2022	J	`jnl`	Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Log. Methods Comput. Sci. Bartosz Bednarczyk, Stéphane Demri
2021	J	`jnl`	A Complete Axiomatisation for Quantifier-Free Separation Logic. Log. Methods Comput. Sci. Stéphane Demri, Étienne Lozes, Alessio Mansutti
2021	J	`jnl`	Concrete domains in logics: a survey. ACM SIGLOG News Stéphane Demri, Karin Quaas
2021	J	`jnl`	Internal proof calculi for modal logics with separating conjunction. J. Log. Comput. Stéphane Demri, Raul Fervari, Alessio Mansutti
2021	J	`jnl`	Strategic reasoning with a bounded number of resources: The quest for tractability. Artif. Intell. Francesco Belardinelli, Stéphane Demri
2021	J	`jnl`	The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Trans. Comput. Log. Stéphane Demri, Étienne Lozes, Alessio Mansutti
2021	J	`jnl`	Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? CoRR Bartosz Bednarczyk, Stéphane Demri
2020	J	`jnl`	A Complete Axiomatisation for Quantifier-Free Separation Logic. CoRR Stéphane Demri, Étienne Lozes, Alessio Mansutti
2020	A*	`conf`	A Framework for Reasoning about Dynamic Axioms in Description Logics. IJCAI Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti
2020	B	`conf`	Internal Calculi for Separation Logics. CSL Stéphane Demri, Étienne Lozes, Alessio Mansutti
2020	J	`jnl`	Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). CoRR Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
2020	A*	`conf`	Modal Logics with Composition on Finite Forests: Expressivity and Complexity. LICS Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
2020	A*	`conf`	Parameterised Resource-Bounded ATL. AAAI Natasha Alechina, Stéphane Demri, Brian Logan
2020	A	`conf`	Reasoning with a Bounded Number of Resources in ATL+. ECAI Francesco Belardinelli, Stéphane Demri
2019	B	`conf`	Axiomatising Logics with Separating Conjunction and Modalities. JELIA Stéphane Demri, Raul Fervari, Alessio Mansutti
2019	J	`jnl`	Internal Calculi for Separation Logics. CoRR Stéphane Demri, Étienne Lozes, Alessio Mansutti
2019	A	`conf`	Resource-bounded ATL: the Quest for Tractable Fragments. AAMAS Francesco Belardinelli, Stéphane Demri
2019	J	`jnl`	The power of modal separation logics. J. Log. Comput. Stéphane Demri, Raul Fervari
2019	A*	`conf`	Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS Bartosz Bednarczyk, Stéphane Demri
2018	J	`jnl`	Equivalence between model-checking flat counter systems and Presburger arithmetic. Theor. Comput. Sci. Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2018	C	`conf`	On Temporal and Separation Logics (Invited Paper). TIME Stéphane Demri
2018	B	`conf`	On the Complexity of Modal Separation Logics. Advances in Modal Logic Stéphane Demri, Raul Fervari
2018	J	`jnl`	On the complexity of resource-bounded logics. Theor. Comput. Sci. Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan
2018	B	`conf`	The Effects of Adding Reachability Predicates in Propositional Separation Logic. FoSSaCS Stéphane Demri, Étienne Lozes, Alessio Mansutti
2018	J	`jnl`	The Effects of Adding Reachability Predicates in Propositional Separation Logic. CoRR Stéphane Demri, Étienne Lozes, Alessio Mansutti
2017	—	`conf`	On Symbolic Heaps Modulo Permission Theories. FSTTCS Stéphane Demri, Étienne Lozes, Denis Lugiez
2017	J	`jnl`	Preface - Special Issue of Selected Extended Papers of IJCAR 2014. J. Autom. Reason. Stéphane Demri, Deepak Kapur, Christoph Weidenbach
2017	J	`jnl`	Separation Logic with One Quantified Variable. Theory Comput. Syst. Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
2016	B	`ed.`	Advances in Modal Logic 11, proceedings of the 11th conference on "Advances in Modal Logic," held in Budapest, Hungary, August 30 - September 2, 2016 Advances in Modal Logic Lev D. Beklemishev, Stéphane Demri, András Maté
2016	J	`jnl`	Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction. ACM Trans. Comput. Log. Stéphane Demri, Morgan Deters
2016	—	`conf`	On the Complexity of Resource-Bounded Logics. RP Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan
2016	J	`jnl`	Preface. Fundam. Informaticae Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov
2016	J	`jnl`	Reasoning about Data Repetitions with Counter Systems. Log. Methods Comput. Sci. Stéphane Demri, Diego Figueira, M. Praveen
2016	—	`book`	Temporal Logics in Computer Science: Finite-State Systems Stéphane Demri, Valentin Goranko, Martin Lange
2016	J	`jnl`	Temporal logics on strings with prefix relation. J. Log. Comput. Stéphane Demri, Morgan Deters
2015	J	`jnl`	Separation logics and modalities: a survey. J. Appl. Non Class. Logics Stéphane Demri, Morgan Deters
2015	J	`jnl`	Taming past LTL and flat counter systems. Inf. Comput. Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2015	J	`jnl`	Two-Variable Separation Logic and Its Inner Circle. ACM Trans. Comput. Log. Stéphane Demri, Morgan Deters
2014	A	`ed.`	Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings IJCAR Stéphane Demri, Deepak Kapur, Christoph Weidenbach
2014	—	`conf`	Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. RP Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2014	—	`conf`	Expressive completeness of separation logic with two variables and no separating conjunction. CSL-LICS Stéphane Demri, Morgan Deters
2014	Misc	`conf`	Separation Logic with One Quantified Variable. CSR Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
2014	B	`conf`	The Effects of Modalities in Separation Logics (Extended Abstract). Advances in Modal Logic Stéphane Demri, Morgan Deters
2013	Misc	`conf`	Model-Checking Bounded Multi-Pushdown Systems. CSR Kshitij Bansal, Stéphane Demri
2013	J	`jnl`	On selective unboundedness of VASS. J. Comput. Syst. Sci. Stéphane Demri
2013	J	`jnl`	On the Complexity of Verifying Regular Properties on Flat Counter Systems CoRR Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2013	—	`conf`	On the Complexity of Verifying Regular Properties on Flat Counter Systems, . ICALP (2) Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2013	A*	`conf`	Reasoning about Data Repetitions with Counter Systems. LICS Stéphane Demri, Diego Figueira, M. Praveen
2013	J	`jnl`	The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2013	B	`conf`	Witness Runs for Counter Machines - (Abstract). TABLEAUX Clark W. Barrett, Stéphane Demri, Morgan Deters
2013	—	`conf`	Witness Runs for Counter Machines. FroCos Clark W. Barrett, Stéphane Demri, Morgan Deters
2012	J	`jnl`	A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems CoRR Kshitij Bansal, Stéphane Demri
2012	B	`conf`	Beyond Regularity for Presburger Modal Logic. Advances in Modal Logic Facundo Carreiro, Stéphane Demri
2012	J	`jnl`	On the almighty wand. Inf. Comput. Rémi Brochenin, Stéphane Demri, Étienne Lozes
2012	J	`jnl`	Petri Net Reachability Graphs: Decidability Status of First Order Properties Log. Methods Comput. Sci. Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
2012	—	`ch.`	Specification and Verification using Temporal Logics. Modern Applications of Automata Theory Stéphane Demri, Paul Gastin
2012	J	`jnl`	Taming Past LTL and Flat Counter Systems CoRR Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2012	A	`conf`	Taming Past LTL and Flat Counter Systems. IJCAR Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier
2012	J	`jnl`	Temporal Logics of Repeating Values. J. Log. Comput. Stéphane Demri, Deepak D'Souza, Régis Gascon
2011	C	`conf`	Automata-Based Computation of Temporal Equilibrium Models. LOPSTR Pedro Cabalar, Stéphane Demri
2011	—	`conf`	Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan
2011	—	`conf`	The Complexity of Reversal-Bounded Model-Checking. FroCoS Marcello M. Bersani, Stéphane Demri
2010	J	`jnl`	Complexity of modal logics with Presburger constraints. J. Appl. Log. Stéphane Demri, Denis Lugiez
2010	B	`conf`	Counter Systems for Data Logics. JELIA Stéphane Demri
2010	J	`jnl`	Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2010	J	`jnl`	Model-checking CTL* over flat Presburger counter systems. J. Appl. Non Class. Logics Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
2010	—	`conf`	On Selective Unboundedness of VASS INFINITY Stéphane Demri
2010	J	`jnl`	The complexity of linear-time temporal logic over the class of ordinals Log. Methods Comput. Sci. Stéphane Demri, Alexander Rabinovich
2010	B	`conf`	When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. FoSSaCS Stéphane Demri, Arnaud Sangnier
2009	J	`jnl`	LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. Stéphane Demri, Ranko Lazic
2009	—	`ed.`	Proceedings of the 5th Workshop on Methods for Modalities, M4M 2007, Cachan, France, November 29-30, 2007 M4M Carlos Areces, Stéphane Demri
2009	J	`jnl`	Reasoning about sequences of memory states. Ann. Pure Appl. Log. Rémi Brochenin, Stéphane Demri, Étienne Lozes
2009	—	`conf`	The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic
2009	J	`jnl`	The Effects of Bounding Syntactic Resources on Presburger LTL. J. Log. Comput. Stéphane Demri, Régis Gascon
2008	C	`ed.`	15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Montréal, Canada, 16-18 June 2008 TIME Stéphane Demri, Christian S. Jensen
2008	B	`conf`	Model Checking Freeze LTL over One-Counter Automata. FoSSaCS Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2008	J	`jnl`	Model checking memoryful linear-time logics over one-counter automata CoRR Stéphane Demri, Ranko Lazic, Arnaud Sangnier
2008	B	`conf`	On the Almighty Wand. CSL Rémi Brochenin, Stéphane Demri, Étienne Lozes
2008	J	`jnl`	Verification of qualitative Z constraints. Theor. Comput. Sci. Stéphane Demri, Régis Gascon
2007	Misc	`conf`	A Decidable Temporal Logic of Repeating Values. LFCS Stéphane Demri, Deepak D'Souza, Régis Gascon
2007	J	`jnl`	An automata-theoretic approach to constraint LTL. Inf. Comput. Stéphane Demri, Deepak D'Souza
2007	—	`book`	Logiques pour la spécification et vérification. Stéphane Demri
2007	J	`jnl`	On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. Stéphane Demri, Ranko Lazic, David Nowak
2007	—	`conf`	Preface. M4M Carlos Areces, Stéphane Demri
2007	Misc	`conf`	Reasoning About Sequences of Memory States. LFCS Rémi Brochenin, Stéphane Demri, Étienne Lozes
2007	J	`jnl`	Reasoning about Transfinite Sequences. Int. J. Found. Comput. Sci. Stéphane Demri, David Nowak
2007	J	`jnl`	Relative Nondeterministic Information Logic is EXPTIME-complete. Fundam. Informaticae Stéphane Demri, Ewa Orlowska
2007	B	`conf`	The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR Stéphane Demri, Alexander Rabinovich
2007	C	`conf`	The Effects of Bounding Syntactic Resources on Presburger LTL. TIME Stéphane Demri, Régis Gascon
2006	J	`jnl`	A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. Stéphane Demri, François Laroussinie, Philippe Schnoebelen
2006	J	`jnl`	LTL over integer periodicity constraints. Theor. Comput. Sci. Stéphane Demri
2006	J	`jnl`	LTL with the Freeze Quantifier and Register Automata CoRR Stéphane Demri, Ranko Lazic
2006	A*	`conf`	LTL with the Freeze Quantifier and Register Automata. LICS Stéphane Demri, Ranko Lazic
2006	J	`jnl`	Linear-time temporal logics with Presburger constraints: an overview. J. Appl. Non Class. Logics Stéphane Demri
2006	J	`jnl`	On the freeze quantifier in Constraint LTL: decidability and complexity CoRR Stéphane Demri, Ranko Lazic, David Nowak
2006	A	`conf`	Presburger Modal Logic Is PSPACE-Complete. IJCAR Stéphane Demri, Denis Lugiez
2006	B	`conf`	Towards a Model-Checker for Counter Systems. ATVA Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
2005	J	`jnl`	A Reduction from DLP to PDL. J. Log. Comput. Stéphane Demri
2005	J	`jnl`	Deciding Regular Grammar Logics with Converse Through First-Order Logic. J. Log. Lang. Inf. Stéphane Demri, Hans de Nivelle
2005	C	`conf`	On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME Stéphane Demri, Ranko Lazic, David Nowak
2005	B	`conf`	Reasoning About Transfinite Sequences. ATVA Stéphane Demri, David Nowak
2005	J	`jnl`	Reasoning about transfinite sequences CoRR Stéphane Demri, David Nowak
2005	B	`conf`	Verification of Qualitative Constraints. CONCUR Stéphane Demri, Régis Gascon
2004	B	`conf`	LTL over Integer Periodicity Constraints: (Extended Abstract). FoSSaCS Stéphane Demri
2003	J	`jnl`	A Modal Perspective on Path Constraints. J. Log. Comput. Natasha Alechina, Stéphane Demri, Maarten de Rijke
2003	J	`jnl`	A polynomial space construction of tree-like models for logics with local chains of modal connectives. Theor. Comput. Sci. Stéphane Demri
2003	J	`jnl`	Deciding regular grammar logics with converse through first-order logic CoRR Stéphane Demri, Hans de Nivelle
2002	A	`conf`	A Parametric Analysis of the State Explosion Problem in Model Checking. STACS Stéphane Demri, François Laroussinie, Philippe Schnoebelen
2002	—	`conf`	An Automata-Theoretic Approach to Constraint LTL. FSTTCS Stéphane Demri, Deepak D'Souza
2002	J	`jnl`	Automata-Theoretic Decision Procedures for Information Logics. Fundam. Informaticae Stéphane Demri, Ulrike Sattler
2002	J	`jnl`	Display Calculi for Nominal Tense Logics. J. Log. Comput. Stéphane Demri, Rajeev Goré
2002	—	`book`	Incomplete Information: Structure, Inference, Complexity Stéphane Demri, Ewa Orlowska
2002	J	`jnl`	The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. Stéphane Demri, Philippe Schnoebelen
2002	J	`jnl`	Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. J. Log. Comput. Stéphane Demri, Rajeev Goré
2001	—	`conf`	Path Constraints from a Modal Logic Point of View. KRDB Natasha Alechina, Stéphane Demri, Maarten de Rijke
2001	J	`jnl`	The Complexity of Regularity in Grammar Logics and Related Modal Logics. J. Log. Comput. Stéphane Demri
2000	B	`conf`	Complexity of Simple Dependent Bimodal Logics. TABLEAUX Stéphane Demri
2000	J	`jnl`	Computational Complexity of Multimodal Logics Based on Rough Sets. Fundam. Informaticae Stéphane Demri, Jaroslaw Stepaniuk
2000	J	`jnl`	Display Calculi for Logics with Relative Accessibility Relations. J. Log. Lang. Inf. Stéphane Demri, Rajeev Goré
2000	B	`conf`	Modal Logics with Weak Forms of Recursion: PSPACE Specimens. Advances in Modal Logic Stéphane Demri
2000	J	`jnl`	On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. Stud Logica Stéphane Demri, Dov M. Gabbay
2000	J	`jnl`	On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Stud Logica Stéphane Demri, Dov M. Gabbay
2000	J	`jnl`	The Nondeterministic Information Logic NIL is PSPACE-complete. Fundam. Informaticae Stéphane Demri
1999	J	`jnl`	A Logic with Relative Knowledge Operators. J. Log. Lang. Inf. Stéphane Demri
1999	B	`conf`	Cut-Free Display Calculi for Nominal Tense Logics. TABLEAUX Stéphane Demri, Rajeev Goré
1999	J	`jnl`	Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of [diams]-Formulae. Stud Logica Stéphane Demri, Ewa Orlowska
1999	B	`conf`	Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? TABLEAUX Stéphane Demri
1999	A	`conf`	Tractable Transformations from Modal Provability Logics into First-Order Logic. CADE Stéphane Demri, Rajeev Goré
1998	J	`jnl`	A Class of Decidable Information Logics. Theor. Comput. Sci. Stéphane Demri
1998	—	`conf`	An O (( FTP (LNCS Selection) Stéphane Demri, Rajeev Goré
1998	—	`conf`	Classes of modal frames definable by closure relational operations. RelMiCS Stéphane Demri, Ewa Orlowska
1998	—	`conf`	Coping with semilattices of relations in logics with relative accessibility relations. RelMiCS Stéphane Demri
1998	B	`conf`	Relative Similarity Logics are Decidable: Reduction to FO JELIA Stéphane Demri, Beata Konikowska
1998	A	`conf`	The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). STACS Stéphane Demri, Philippe Schnoebelen
1997	J	`jnl`	A Completeness Proof for a Logic with an Alternative Necessity Operator. Stud Logica Stéphane Demri
1997	—	`conf`	Prefixed Tableaux Systems for Modal Logics with Enriched Languages. IJCAI (1) Philippe Balbiani, Stéphane Demri
1997	—	`conf`	Reasoning with Relational Demonic Operators. RelMiCS Stéphane Demri, Ewa Orlowska
1996	B	`conf`	A Class of Information Logics with a Decidable Validity Problem. MFCS Stéphane Demri
1996	B	`conf`	A Simple Tableau System for the Logic of Elsewhere. TABLEAUX Stéphane Demri
1996	J	`jnl`	Logical Analysis of Demonic Nondeterministic Programs. Theor. Comput. Sci. Stéphane Demri, Ewa Orlowska
1995	J	`jnl`	3-SAT=SAT for a Class of Normal Modal Logics. Inf. Process. Lett. Stéphane Demri
1995	—	`conf`	A Hierarchy of Backward Translations: Applications to Modal Logics. WOCFAI Stéphane Demri
1995	A*	`conf`	On the Complexity of Extending Ground Resolution with Symmetry Rules. IJCAI Thierry Boy de la Tour, Stéphane Demri
1995	J	`jnl`	Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. J. Appl. Non Class. Logics Stéphane Demri
1995	B	`conf`	Using Connection Method in Modal Logics: Some Advantages. TABLEAUX Stéphane Demri
1994	—	`—`	Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuves. Stéphane Demri
1994	B	`conf`	Efficient Strategies for Automated Reasoning in Modal Logics. JELIA Stéphane Demri
1994	J	`jnl`	Towards Reasoning about Hoare Relations. Ann. Math. Artif. Intell. Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky
1993	J	`jnl`	A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. Stud Logica Ricardo Caferra, Stéphane Demri, Michel Herment
1993	A*	`conf`	Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. IJCAI Ricardo Caferra, Stéphane Demri
1992	A	`conf`	Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. CADE Ricardo Caferra, Stéphane Demri
1991	A*	`conf`	Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics. AAAI Ricardo Caferra, Stéphane Demri, Michel Herment