Stéphane Demri

According to our database, Stéphane Demri authored at least 128 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Computational Complexity of Standpoint LTL.

Stéphane Demri, Przemyslaw Andrzej Walega

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

On Composing Finite Forests with Modal Logics.

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

ACM Trans. Comput. Log., April, 2023

How to Manage a Budget with ATL+.

Stéphane Demri, Raine Rönnholm

Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

First Steps Towards Taming Description Logics with Strings.

Stéphane Demri, Karin Quaas

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures.

Stéphane Demri, Karin Quaas

Proceedings of the 34th International Conference on Concurrency Theory, 2023

Model-Checking for Ability-Based Logics with Constrained Plans.

Stéphane Demri, Raul Fervari

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

Log. Methods Comput. Sci., 2022

2021

The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic.

Stéphane Demri, Étienne Lozes, Alessio Mansutti

ACM Trans. Comput. Log., 2021

Concrete domains in logics: a survey.

Stéphane Demri, Karin Quaas

ACM SIGLOG News, 2021

Internal proof calculi for modal logics with separating conjunction.

Stéphane Demri, Raul Fervari, Alessio Mansutti

J. Log. Comput., 2021

A Complete Axiomatisation for Quantifier-Free Separation Logic.

Stéphane Demri, Étienne Lozes, Alessio Mansutti

Log. Methods Comput. Sci., 2021

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

CoRR, 2021

Strategic reasoning with a bounded number of resources: The quest for tractability.

Francesco Belardinelli, Stéphane Demri

Artif. Intell., 2021

2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material).

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

CoRR, 2020

Modal Logics with Composition on Finite Forests: Expressivity and Complexity.

Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

A Framework for Reasoning about Dynamic Axioms in Description Logics.

Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Reasoning with a Bounded Number of Resources in ATL+.

Francesco Belardinelli, Stéphane Demri

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Internal Calculi for Separation Logics.

Stéphane Demri, Étienne Lozes, Alessio Mansutti

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Parameterised Resource-Bounded ATL.

Natasha Alechina, Stéphane Demri, Brian Logan

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

The power of modal separation logics.

Stéphane Demri, Raul Fervari

J. Log. Comput., 2019

Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?

Bartosz Bednarczyk, Stéphane Demri

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Axiomatising Logics with Separating Conjunction and Modalities.

Stéphane Demri, Raul Fervari, Alessio Mansutti

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Resource-bounded ATL: the Quest for Tractable Fragments.

Francesco Belardinelli, Stéphane Demri

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Equivalence between model-checking flat counter systems and Presburger arithmetic.

Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier

Theor. Comput. Sci., 2018

On the complexity of resource-bounded logics.

Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan

Theor. Comput. Sci., 2018

On Temporal and Separation Logics (Invited Paper).

Stéphane Demri

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

The Effects of Adding Reachability Predicates in Propositional Separation Logic.

Stéphane Demri, Étienne Lozes, Alessio Mansutti

Proceedings of the Foundations of Software Science and Computation Structures, 2018

On the Complexity of Modal Separation Logics.

Stéphane Demri, Raul Fervari

Proceedings of the Advances in Modal Logic 12, 2018

2017

Separation Logic with One Quantified Variable.

Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry

Theory Comput. Syst., 2017

Preface - Special Issue of Selected Extended Papers of IJCAR 2014.

Stéphane Demri, Deepak Kapur, Christoph Weidenbach

J. Autom. Reason., 2017

On Symbolic Heaps Modulo Permission Theories.

Stéphane Demri, Étienne Lozes, Denis Lugiez

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction.

Stéphane Demri, Morgan Deters

ACM Trans. Comput. Log., 2016

Temporal logics on strings with prefix relation.

Stéphane Demri, Morgan Deters

J. Log. Comput., 2016

Preface.

Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov

Fundam. Informaticae, 2016

Reasoning about Data Repetitions with Counter Systems.

Stéphane Demri, Diego Figueira, M. Praveen

Log. Methods Comput. Sci., 2016

Temporal Logics in Computer Science: Finite-State Systems

Stéphane Demri, Valentin Goranko, Martin Lange

Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, ISBN: 9781107028364, 2016

2015

Two-Variable Separation Logic and Its Inner Circle.

Stéphane Demri, Morgan Deters

ACM Trans. Comput. Log., 2015

Separation logics and modalities: a survey.

Stéphane Demri, Morgan Deters

J. Appl. Non Class. Logics, 2015

Taming past LTL and flat counter systems.

Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier

Inf. Comput., 2015

2014

The Effects of Modalities in Separation Logics (Extended Abstract).

Stéphane Demri, Morgan Deters

Proceedings of the Advances in Modal Logic 10, 2014

2013

The covering and boundedness problems for branching vector addition systems.

Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic

J. Comput. Syst. Sci., 2013

On selective unboundedness of VASS.

Stéphane Demri

J. Comput. Syst. Sci., 2013

Witness Runs for Counter Machines - (Abstract).

Clark W. Barrett, Stéphane Demri, Morgan Deters

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2013

On the Complexity of Verifying Regular Properties on Flat Counter Systems, .

Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Witness Runs for Counter Machines.

Clark W. Barrett, Stéphane Demri, Morgan Deters

Proceedings of the Frontiers of Combining Systems, 2013

Model-Checking Bounded Multi-Pushdown Systems.

Kshitij Bansal, Stéphane Demri

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Temporal Logics of Repeating Values.

Stéphane Demri, Deepak D'Souza, Régis Gascon

J. Log. Comput., 2012

On the almighty wand.

Rémi Brochenin, Stéphane Demri, Étienne Lozes

Inf. Comput., 2012

A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems

Kshitij Bansal, Stéphane Demri

CoRR, 2012

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan

Log. Methods Comput. Sci., 2012

Beyond Regularity for Presburger Modal Logic.

Facundo Carreiro, Stéphane Demri

Proceedings of the Advances in Modal Logic 9, 2012

Specification and Verification using Temporal Logics.

Stéphane Demri, Paul Gastin

Proceedings of the Modern Applications of Automata Theory., 2012

2011

Automata-Based Computation of Temporal Equilibrium Models.

Pedro Cabalar, Stéphane Demri

Proceedings of the Logic-Based Program Synthesis and Transformation, 2011

Petri Net Reachability Graphs: Decidability Status of FO Properties.

Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

The Complexity of Reversal-Bounded Model-Checking.

Marcello M. Bersani, Stéphane Demri

Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010

Model checking memoryful linear-time logics over one-counter automata.

Stéphane Demri, Ranko Lazic, Arnaud Sangnier

Theor. Comput. Sci., 2010

Complexity of modal logics with Presburger constraints.

Stéphane Demri, Denis Lugiez

J. Appl. Log., 2010

Model-checking CTL* over flat Presburger counter systems.

Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen

J. Appl. Non Class. Logics, 2010

The complexity of linear-time temporal logic over the class of ordinals

Stéphane Demri, Alexander Rabinovich

Log. Methods Comput. Sci., 2010

Counter Systems for Data Logics.

Stéphane Demri

Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

When Model-Checking Freeze LTL over Counter Machines Becomes Decidable.

Stéphane Demri, Arnaud Sangnier

Proceedings of the Foundations of Software Science and Computational Structures, 2010

2009

LTL with the freeze quantifier and register automata.

Stéphane Demri, Ranko Lazic

ACM Trans. Comput. Log., 2009

The Effects of Bounding Syntactic Resources on Presburger LTL.

Stéphane Demri, Régis Gascon

J. Log. Comput., 2009

Reasoning about sequences of memory states.

Rémi Brochenin, Stéphane Demri, Étienne Lozes

Ann. Pure Appl. Log., 2009

2008

Verification of qualitative Z constraints.

Stéphane Demri, Régis Gascon

Theor. Comput. Sci., 2008

Model Checking Freeze LTL over One-Counter Automata.

Stéphane Demri, Ranko Lazic, Arnaud Sangnier

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Reasoning about Transfinite Sequences.

Stéphane Demri, David Nowak

Int. J. Found. Comput. Sci., 2007

On the freeze quantifier in Constraint LTL: Decidability and complexity.

Stéphane Demri, Ranko Lazic, David Nowak

Inf. Comput., 2007

An automata-theoretic approach to constraint LTL.

Stéphane Demri, Deepak D'Souza

Inf. Comput., 2007

Relative Nondeterministic Information Logic is EXPTIME-complete.

Stéphane Demri, Ewa Orlowska

Fundam. Informaticae, 2007

Preface.

Carlos Areces, Stéphane Demri

Proceedings of the 5th Workshop on Methods for Modalities, 2007

The Complexity of Temporal Logic with Until and Since over Ordinals.

Stéphane Demri, Alexander Rabinovich

Proceedings of the Logic for Programming, 2007

A Decidable Temporal Logic of Repeating Values.

Stéphane Demri, Deepak D'Souza, Régis Gascon

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2007

Logiques pour la spécification et vérification.

Stéphane Demri

, 2007

2006

LTL over integer periodicity constraints.

Stéphane Demri

Theor. Comput. Sci., 2006

A parametric analysis of the state-explosion problem in model checking.

Stéphane Demri, François Laroussinie, Philippe Schnoebelen

J. Comput. Syst. Sci., 2006

Linear-time temporal logics with Presburger constraints: an overview.

Stéphane Demri

J. Appl. Non Class. Logics, 2006

Presburger Modal Logic Is PSPACE-Complete.

Stéphane Demri, Denis Lugiez

Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

Towards a Model-Checker for Counter Systems.

Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen

Proceedings of the Automated Technology for Verification and Analysis, 2006

2005

A Reduction from DLP to PDL.

Stéphane Demri

J. Log. Comput., 2005

Deciding Regular Grammar Logics with Converse Through First-Order Logic.

Stéphane Demri, Hans de Nivelle

J. Log. Lang. Inf., 2005

Verification of Qualitative Constraints.

Stéphane Demri, Régis Gascon

Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004

LTL over Integer Periodicity Constraints: (Extended Abstract).

Stéphane Demri

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

A polynomial space construction of tree-like models for logics with local chains of modal connectives.

Stéphane Demri

Theor. Comput. Sci., 2003

A Modal Perspective on Path Constraints.

Natasha Alechina, Stéphane Demri, Maarten de Rijke

J. Log. Comput., 2003

2002

Display Calculi for Nominal Tense Logics.

Stéphane Demri, Rajeev Goré

J. Log. Comput., 2002

Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics.

Stéphane Demri, Rajeev Goré

J. Log. Comput., 2002

The Complexity of Propositional Linear Temporal Logics in Simple Cases.

Stéphane Demri, Philippe Schnoebelen

Inf. Comput., 2002

Automata-Theoretic Decision Procedures for Information Logics.

Stéphane Demri, Ulrike Sattler

Fundam. Informaticae, 2002

Incomplete Information: Structure, Inference, Complexity

Stéphane Demri, Ewa Orlowska

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04997-6, 2002

2001

The Complexity of Regularity in Grammar Logics and Related Modal Logics.

Stéphane Demri

J. Log. Comput., 2001

Path Constraints from a Modal Logic Point of View.

Natasha Alechina, Stéphane Demri, Maarten de Rijke

Proceedings of the 8th International Workshop on Knowledge Representation meets Databases (KRDB 2001), 2001

2000

On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I.

Stéphane Demri, Dov M. Gabbay

Stud Logica, 2000

On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II.

Stéphane Demri, Dov M. Gabbay

Stud Logica, 2000

Display Calculi for Logics with Relative Accessibility Relations.

Stéphane Demri, Rajeev Goré

J. Log. Lang. Inf., 2000

Computational Complexity of Multimodal Logics Based on Rough Sets.

Stéphane Demri, Jaroslaw Stepaniuk

Fundam. Informaticae, 2000

The Nondeterministic Information Logic NIL is PSPACE-complete.

Stéphane Demri

Fundam. Informaticae, 2000

Complexity of Simple Dependent Bimodal Logics.

Stéphane Demri

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

Modal Logics with Weak Forms of Recursion: PSPACE Specimens.

Stéphane Demri

Proceedings of the Advances in Modal Logic 3, 2000

1999

Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of [diams]-Formulae.

Stéphane Demri, Ewa Orlowska

Stud Logica, 1999

A Logic with Relative Knowledge Operators.

Stéphane Demri

J. Log. Lang. Inf., 1999

Cut-Free Display Calculi for Nominal Tense Logics.

Stéphane Demri, Rajeev Goré

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?

Stéphane Demri

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 1999

Tractable Transformations from Modal Provability Logics into First-Order Logic.

Stéphane Demri, Rajeev Goré

Proceedings of the Automated Deduction, 1999

1998

A Class of Decidable Information Logics.

Stéphane Demri

Theor. Comput. Sci., 1998

The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract).

Stéphane Demri, Philippe Schnoebelen

Proceedings of the STACS 98, 1998

Relative Similarity Logics are Decidable: Reduction to FO² with Equality.

Stéphane Demri, Beata Konikowska

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

An O ((<i>n</i>·log <i>n</i>)³)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic.

Stéphane Demri, Rajeev Goré

Proceedings of the Automated Deduction in Classical and Non-Classical Logics, 1998

Classes of modal frames definable by closure relational operations.

Stéphane Demri, Ewa Orlowska

Proceedings of the Participants Copies for Relational Methods in Logic, 1998

Coping with semilattices of relations in logics with relative accessibility relations.

Stéphane Demri

Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997

A Completeness Proof for a Logic with an Alternative Necessity Operator.

Stéphane Demri

Stud Logica, 1997

Prefixed Tableaux Systems for Modal Logics with Enriched Languages.

Philippe Balbiani, Stéphane Demri

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Reasoning with Relational Demonic Operators.

Stéphane Demri, Ewa Orlowska

Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

1996

Logical Analysis of Demonic Nondeterministic Programs.

Stéphane Demri, Ewa Orlowska

Theor. Comput. Sci., 1996

A Simple Tableau System for the Logic of Elsewhere.

Stéphane Demri

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

A Class of Information Logics with a Decidable Validity Problem.

Stéphane Demri

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1995

Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics.

Stéphane Demri

J. Appl. Non Class. Logics, 1995

3-SAT=SAT for a Class of Normal Modal Logics.

Stéphane Demri

Inf. Process. Lett., 1995

A Hierarchy of Backward Translations: Applications to Modal Logics.

Stéphane Demri

Proceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, 1995

Using Connection Method in Modal Logics: Some Advantages.

Stéphane Demri

Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1995

On the Complexity of Extending Ground Resolution with Symmetry Rules.

Thierry Boy de la Tour, Stéphane Demri

Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994

Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuves.

Stéphane Demri

PhD thesis, 1994

Towards Reasoning about Hoare Relations.

Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky

Ann. Math. Artif. Intell., 1994

Efficient Strategies for Automated Reasoning in Modal Logics.

Stéphane Demri

Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

1993

A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics.

Ricardo Caferra, Stéphane Demri, Michel Herment

Stud Logica, 1993

Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5.

Ricardo Caferra, Stéphane Demri

Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992

Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic.

Ricardo Caferra, Stéphane Demri

Proceedings of the Automated Deduction, 1992

1991

Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics.

Ricardo Caferra, Stéphane Demri, Michel Herment

Proceedings of the 9th National Conference on Artificial Intelligence, 1991