Stéphane Demri
Présentation
Member of the thematic teams "Formal methods for AI" / "Model-checking and synthesis" Misc.: Recent Talks / Page@LSV Courses "Logical Aspects of AI" (24/25); "Initiation to research -- Scientific watch: knowledge logics and theory reasoning in AI" (24/25); "Logic" (24/25). Forthcoming book: Concise Introduction to Alternating-Time Temporal Logics, Springer, 2026. Abstract/paper submission deadlines FoSSaCS'26, 16 Oct., 2025; IJCAI-ECAI'26, 19 Jan., 2026; ICALP'26, 03/06 Feb., 2026; LogicNN'26, 27 April, 2026; NCL'26, 26/31 May, 2026.
Directeur de recherche CNRS / Professeur attaché ENS Paris-Saclay
Laboratoire Méthodes Formelles (LMF)
Domaines de recherche
Publications
Publications
|
|
Robustness of Constraint Automata for Description Logics with Concrete Domains34th EACSL Annual Conference on Computer Science Logic (CSL 2026), Feb 2026, Paris, France. ⟨10.4230/LIPIcs.CSL.2026.42⟩ |
|
|
On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories22nd International Conference on Principles of Knowledge Representation and Reasoning, Nov 2025, Melbourne, Australia. pp.260--270 |
|
|
Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS19th International Conference on Reachability Problems, Oct 2025, Madrid, Spain |
|
|
Computational Complexity of Standpoint LTL27th European Conference on Artificial Intelligence, Oct 2024, Santiago de Compostela, Spain. pp.1206--1213, ⟨10.3233/FAIA240616⟩ |
|
|
How to Manage a Budget with ATL+20th International Conference on Principles of Knowledge Representation and Reasoning (KR’23), Sep 2023, Rhodes, Greece. pp.188-197, ⟨10.24963/kr.2023/19⟩ |
|
|
Model-Checking for Ability-Based Logics with Constrained Plans37th AAAI Conference on Artificial Intelligence (AAAI-23), AAAI, Feb 2023, Washignton DC, United States |
|
|
First Steps Towards Taming Description Logics with Strings18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA'23), Sep 2023, Dresden (GERMANY), Germany. pp.322--337 |
|
|
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL*(ℤ) to Decision Procedures34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.29⟩ |
|
|
A Framework for Reasoning about Dynamic Axioms in Description LogicsTwenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, Jan 2021, Yokohama, Japan |
|
|
Modal Logics with Composition on Finite Forests35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbruecken, Germany. ⟨10.1145/3373718.3394787⟩ |
|
|
Parameterised Resource-Bounded ATLThe Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, Feb 2020, New York, United States |
|
|
Reasoning with a Bounded Number of Resources in ATL+24th European Conference on Artificial Intelligence, Aug 2020, Santiago de Compostela, Spain. pp.624--631, ⟨10.3233/FAIA200147⟩ |
|
|
Internal Calculi for Separation LogicComputer Science Logic, Jan 2020, Barcelona, Spain. ⟨10.4230/LIPIcs.CSL.2020.19⟩ |
|
|
Resource-bounded ATL: the Quest for Tractable Fragments18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019, May 2019, Montreal, Canada. pp.206--214 |
|
|
Resource-bounded ATL : the Quest for Tractable Fragments En quête de fragments mécanisables pour ATL avec ressources Keywords Logics for agents and multi-agent systems, verification techniques for multi-agent systems, model-checking, vec- tor addition systems with statesConférence Nationale en Intelligence Artificielle, Jul 2019, Toulouse, France |
|
|
Axiomatising logics with separating conjunctions and modalities16th European Conference on Logics in Artificial Intelligence (JELIA'19), May 2019, Rende, Italy. ⟨10.1007/978-3-030-19570-0_45⟩ |
|
|
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard?34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), Jun 2019, Vancouver, France. ⟨10.1109/LICS.2019.8785656⟩ |
|
|
The Effects of Adding Reachability Predicates in Propositional Separation Logic22nd International Conference on Foundations of Software Science and Computation Structures FOSSACS, 2018, Thessaloniki, Greece |
|
|
On the Complexity of Modal Separation LogicsAdvances in Modal Logic, Bern, 2018, Aug 2018, Bern, Switzerland |
|
|
On Temporal and Separation Logics25th International Symposium on Temporal Representation and Reasoning, TIME 2018, Warsaw, Poland., Oct 2018, Varsovie, Poland. pp.1:1--1:4, ⟨10.4230/LIPIcs.TIME.2018.1⟩ |
|
|
On Symbolic Heaps Modulo Permission Theories37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩ |
|
|
On the Complexity of Resource-Bounded Logics10th International Workshop Reachability Problems, Kim Guldstrand Larsen; Igor Potapov; Jiří Srba, Sep 2016, Aalborg, Denmark. pp.36-50, ⟨10.1007/978-3-319-45994-3_3⟩ |
|
|
The Effects of Modalities in Separation LogicsProceedings of the 10th Conference on Advances in Modal Logics (AiML'14), Aug 2014, Groningen, Netherlands. pp.134-138 |
|
|
Separation Logic with One Quantified Variable9th International Computer Science Symposium (CSR 2014), Jun 2014, Moscou, Russia. ⟨10.1007/978-3-319-06686-8_10⟩ |
|
|
Expressive completeness of separation logic with two variables and no separating conjunctionCSL-LICS '14: JOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC, Jul 2014, Vienna, Austria. pp.37:1-37:10, ⟨10.1145/2603088.2603142⟩ |
|
|
Equivalence Between Model-Checking Flat Counter Systems and Presburger ArithmeticReachability Problems - 8th International Workshop, RP 2014, Oxford, Joël Ouaknine; Igor Potapov; James Worrell, Sep 2014, Oxford, United Kingdom. pp.85-97, ⟨10.1007/978-3-319-11439-2_7⟩ |
|
|
On the Complexity of Verifying Regular Properties on Flat Counter Systems,Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013,, Jul 2013, Riga, Latvia. pp.162-173, ⟨10.1007/978-3-642-39212-2_17⟩ |
|
|
Reasoning about Data Repetitions with Counter SystemsAnnual IEEE/ACM Symposium on Logic in Computer Science (LICS), Jun 2013, New Orleans, United States. ⟨10.1109/LICS.2013.8⟩ |
|
|
Witness Runs for Counter Machines9th International Symposium on Frontiers of Combining Systems (FroCoS'13), Pascal Fontaine; Christophe Ringeissen; Renate Schmidt, Sep 2013, Nancy, France. pp.120-150, ⟨10.1007/978-3-642-40885-4_9⟩ |
|
|
Model-Checking Bounded Multi-Pushdown Systems8th International Computer Science Symposium in Russia, CSR 2013, Jun 2013, Ekaterinburg, Russia. pp.405-417, ⟨10.1007/978-3-642-38536-0_35⟩ |
|
|
Automata-Based Computation of Temporal Equilibrium Models21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), German Vidal, Jun 2011, Odense, Denmark. pp.57-72, ⟨10.1007/978-3-642-32211-2_5⟩ |
|
|
Beyond Regularity for Presburger Modal Logics9th Workshop on Advances in Modal Logics (AiML'12), Thomas Bolander; Torben Brauner; Silvio Ghilardi; Lawrence Moss, Aug 2012, Copenhagen, Denmark. pp.161-182 |
|
|
Taming Past LTL and Flat Counter Systems6th International Joint Conference, IJCAR 2012, Bernhard Gramlich; Dale Miller; Uli Sattler, Jun 2012, Manchester, United Kingdom. pp.179-193, ⟨10.1007/978-3-642-31365-3_16⟩ |
|
|
Petri Net Reachability Graphs: Decidability Status of FO PropertiesIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India |
|
|
The Complexity of Reversal-Bounded Model-Checking8th International Symposium on Frontiers of Combining Systems (FroCoS'11), Viorica Sofronie-Stokkermans; Cesare Tinelli, Oct 2011, Saarbruecken, Germany. pp.71-86, ⟨10.1007/978-3-642-24364-6_6⟩ |
|
|
When Model-Checking Freeze LTL over Counter Machines Becomes DecidableFOSSACS 2010 - Foundations of Software Science and Computational Structures, 13th International Conference, Luke Ong, Mar 2010, Paphos, Cyprus. pp.176-190, ⟨10.1007/978-3-642-12032-9_13⟩ |
|
|
On Selective Unboundedness of VASS12th International Workshops on Verification of Infinite State Systems (INFINITY'10), Oct 2010, Singapore, Singapore. pp.1-15, ⟨10.4204/EPTCS.39.1⟩ |
|
|
The covering and boundedness problems for branching vector addition systemsIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, Dec 2009, Kanpur, India. pp.181-192 |
|
|
Model Checking Freeze LTL over One-Counter Automata11th International Conference on Foundations of Software Science and Computation Structures (FoSSaC'08), Apr 2008, Budapest, Hungary. pp.490-504, ⟨10.1007/978-3-540-78499-9_34⟩ |
|
|
On the Almighty WandComputer Science Logic, 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Sep 2008, Bertinoro, Italy. pp.323-338, ⟨10.1007/978-3-540-87531-4_24⟩ |
|
|
The complexity of temporal logic with until and since over ordinals14th International Conference Logic for Programming, Artificial Intelligence, and Reasoning ( LPAR 2007 ), Nachum Dershowitz; Andrei Voronkov, Oct 2007, Erevan, Armenia. pp.531-545, ⟨10.1007/978-3-540-75560-9_38⟩ |
|
|
The Effects of Bounding Syntactic Resources on Presburger LTL14th International Symposium on Temporal Representation and Reasoning (TIME'07), Jun 2007, Alicante, Spain. pp.94-104, ⟨10.1109/TIME.2007.63⟩ |
|
|
Reasoning About Sequences of Memory StatesProceedings of the Symposium on Logical Foundations of Computer Science (LFCS07), Sergei Artemov; Anil Nerode, Jul 2007, New York, United States. pp.100-114, ⟨10.1007/978-3-540-72734-7_8⟩ |
|
|
A Decidable Temporal Logic of Repeating ValuesInternational Symposium, LFCS 2007, Sergei Artemov; Anil Nerode, Jun 2007, New York, United States. pp.180-194, ⟨10.1007/978-3-540-72734-7_13⟩ |
|
|
Presburger Modal Logic Is PSPACE-CompleteIJCAR 2006 - Automated Reasoning, Third International Joint Conference, Ulrich Furbach; Natarajan Shankar, Aug 2006, Seattle, United States. pp.541-556, ⟨10.1007/11814771_44⟩ |
|
|
LTL with the Freeze Quantifier and Register Automata21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006, Seattle, United States. pp.17-26, ⟨10.1109/LICS.2006.31⟩ |
|
|
Towards a model-checker for counter systemsATVA 2006 - 4th International Symposium on Automated Technology for Verification and Analysis, Susanne Graf; Wenhui Zhang, Oct 2006, Beijing, China. pp.493-507, ⟨10.1007/11901914_36⟩ |
|
|
Reasoning about transfinite sequences (extended abstract)ATVA 2005 - 3rd International Symposium on Automated Technology for Verification and Analysis, Doron A. Peled; Yih-Kuen Tsay, Oct 2005, Taipei, Taiwan. pp.248-262, ⟨10.1007/11562948_20⟩ |
|
|
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity12th International Symposium on Temporal Representation and Reasoning (TIME'05), Jul 2005, Burlington, United States. pp.113-121, ⟨10.1109/TIME.2005.28⟩ |
|
|
Verification of qualitative $\mathbb{Z}$ constraintsCONCUR 2005 - 16th International Conference on Concurrency Theory, Martín Abadi; Luca de Alfaro, Aug 2005, San Francisco, United States. pp.518-532, ⟨10.1007/11539452_39⟩ |
|
|
LTL over Integer Periodicity Constraints (extended abstract)7th International Conference, FOSSACS 2004 (International Conference on Foundations of Software Science and Computation Structures), Igor Walukiewicz, Mar 2004, Barcelona, Spain. pp.121-135, ⟨10.1007/978-3-540-24727-2_10⟩ |
|
|
Deciding Modal Logics through Relational Translations into GF2Proceedings of the 3rd Workshop on Methods for Modalities (M4M-3), Carlos Areces; Patrick Blackburn, Sep 2003, Nancy, France. pp.93-108 |
|
|
An Automata-Theoretic Approach to Constraint LTLInternational Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'02), Dec 2002, Kanpur, India. pp.121-132, ⟨10.1007/3-540-36206-1_12⟩ |
|
|
A Parametric Analysis of the State Explosion Problem in Model Checking19th Annual Symposium on Theoretical Aspects of Computer Science Antibes - Juan les Pins, Helmut Alt; Afonso Ferreira, Mar 2002, Antibes - Juan les Pins, France. pp.620-631, ⟨10.1007/3-540-45841-7_51⟩ |
|
|
Path Constraints from a Modal Logic Point of View (Extended abstract)Proceedings of the 8th International Workshop on Knowledge Representation meets Databases {KRDB 2001), Maurizio Lenzerini; Daniele Nardi; Werner Nutt; Dan Suciu, Sep 2001, Roma, Italy |
|
|
Complexity of Simple Dependent Bimodal LogicsInternational Conference, TABLEAUX 2000, St Andrews, Scotland, Roy Dyckhoff, Jul 2000, St Andrews, United Kingdom. pp.190-204, ⟨10.1007/10722086_17⟩ |
|
|
An O((n.log n) 3 )-time transformation from Grz into decidable fragments of classical first-order logicInternational Workshop on First order Theorem Proving (FTP'98), Ricardo Caferra; Gernot Salzer, Nov 1998, Vienna, Austria. pp.153-167 |
|
|
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization?International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX'99), Jun 1999, Saratoga Springs, United States. pp.140-155, ⟨10.1007/3-540-48754-9_15⟩ |
|
|
Cut-Free Display Calculi for Nominal Tense LogicsAutomated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX '99, Saratoga Springs, NY, Neil Murray, Jun 1999, Saratoga Springs, United States. pp.155-170, ⟨10.1007/3-540-48754-9_16⟩ |
|
|
Tractable Transformations from Modal Provability Logics into First-Order Logic16th International Conference on Automated Deduction Trento, Italy, Harald Ganzinger, Jul 1999, Trento, Italy. pp.16-30, ⟨10.1007/3-540-48660-7_2⟩ |
|
|
Relative Similarity Logics are Decidable: Reduction to FO2 with EqualityEuropean Workshop on Logics in Artificial Intelligence (JELIA'98), Jurgen Dix; Luis Farinas del Cerro; Ulrich Furbach, Oct 1998, Dagstuhl, Germany. pp.279-293, ⟨10.1007/3-540-49545-2_19⟩ |
|
|
The complexity of propositional linear temporal logics in simple casesAnnual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩ |
|
|
Prefixed Tableaux Systems for Modal Logics with Enriched Languages15th International Joint Conference on Artificial Intelligence (IJCAI'97), Aug 1997, Nagoya, Japan. pp.190-195 |
|
|
A simple tableau system for the logic of elsewhere5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX '96), May 1996, Palerme, Italy. pp.177-192, ⟨10.1007/3-540-61208-4_12⟩ |
A class of information logics with a decidable validity problemMathematical Foundations of Computer Science 1996 21st International Symposium, Wojciech Penczek; Andrzej Szałas, Sep 1996, Krakow, Poland. pp.291-302, ⟨10.1007/3-540-61550-4_156⟩ |
|
Finite model property for a logic for data analysisInternational Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'96), Jul 1996, Granada, Spain. pp.871--876 |
|
A Hierarchy of Backward Translations: Applications to Modal LogicsProceedings of the Second World Conference on the Fundamentals of Artificial Intelligence, WOCFAI 1995,, Michel De Glas; Zdzislaw Pawlak, Jul 1995, Paris, France. pp.121-132 |
|
|
|
On the Complexity of Extending Ground Resolution with Symmetry RulesFourteenth International Joint Conference on Artificial Intelligence, (IJCAI'95), Aug 1995, Montreal, Canada. pp.289-295 |
Using connection method in modal logics: Some advantages4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX'95), Peter Baumgartner; Reiner Hähnle; Joachim Possega, May 1995, St. Goar, Germany. pp.63-78, ⟨10.1007/3-540-59338-1_28⟩ |
|
|
|
Resolution for Weak Modal LogicsProceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'94), Philippe Jorrand; Vasil Sgurev, Jan 1994, Sofia, Bulgaria. pp.131-140 |
Efficient strategies for Automated reasoning in modal logicsEuropean Workshop JELIA'94 York, UK, Craig MacNish; David Pearce; Luís Moniz Pereira, Sep 1994, York, United Kingdom. pp.182-197, ⟨10.1007/BFb0021972⟩ |
|
Cooperation between direct method and translation method in non classical logics : some results in propositional S5In 13th International Joint Conference on Artificial Intelligence (IJCAI-13), Jul 1993, Chambéry, France |
|
Logic morphisms as a framework for the backward transfer of lemmas and strategies in some modal and epistemic logics9th National Conference of the American Association for Artificial Intelligence (AAAI-9), Jul 1991, Anaheim, United States. pp.421--426 |
Proceedings of the 11th Conference on Advances in Modal Logic (AiML'16), 2016, 978-1-84890-201-5 |
|
Temporal Logics in Computer ScienceCambridge University Press, 2016, 9781139236119 |
|
Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), Montréal, Canada, 2008, 978-0-7695-3181-6 |
|
Incomplete Information: Structure, Inference, ComplexitySpringer, 2002, 978-3-662-04997-6 |
|
|
Reasoning about reversal-bounded counter machinesEwa Orlowska on Relational Methods in Logic and Computer Science, volume 17 of Outstanding Contributions to Logic, Springer, 2018., pp.441--479, 2018, ⟨10.1007/978-3-319-97879-6_17⟩ |
|
|
Specification and Verification using Temporal LogicsD'Souza, Deepak and Shankar, Priti. Modern applications of automata theory, 2, World Scientific, pp.457-494, 2012, ⟨10.1142/7237⟩ |
|
|
Verification of Infinite-State SystemsModels and Analysis in Distributed Systems, Wiley, pp.221-269, 2011, 9781848213142 |
|
|
Modal Logics with Weak Forms of Recursion: PSPACE SpecimensAdvances in Modal Logic (AIML'00), WORLD SCIENTIFIC, pp.113-138, 2002, 979-981-238-179-8. ⟨10.1142/9789812776471_0007⟩ |
|
|
Coping with Semilattices of Relations in Logics with Relative Accessibility RelationsEwa Orlowska; Andrzej Szalas. Relational Methods for Computer Science Applications. Selected Papers from 4th International Seminar on Relational Methods in Logic, Algebra and Computer Science ({RelMiCS}'98), , pp.163-181, 2001, 978-3-7908-1828-4. ⟨10.1007/978-3-7908-1828-4_10⟩ |
|
|
Indiscernibility and complementarity relations in information systemsJelle Gerbrandy; Maarten Marx; Maarten de Rijke; Yde Venema. JFAK: Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, , 1999 |
|
|
Informational representability: Abstract models versus concrete models.Didier Dubois; Henri Prade; Erich Peter Klement. Fuzzy sets, Logics and Reasoning about Knowledge, 15, Springer, pp.301--314, 1999, Applied Logic Series, 978-94-017-1652-9. ⟨10.1007/978-94-017-1652-9_20⟩ |
|
|
Informational representability of models for information logicsEwa Orlowska. Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Physica Verlag, pp.383-409, 1999, 978-3-7908-1864-2 |
|
|
Complementarity Relations: Reduction of Decision Rules and Informational RepresentabilityLech Polkowski; Andrzej Skowron. Rough Sets in Knowledge Discovery 1 -- Methodology and Applications, , pp.99-106, 1998, 978-3-7908-1884-0 |
Logical analysis of indiscernibilityEwa Orlowska. Incomplete Information: Rough Set Analysis, , pp.347-380, 1998, 78-3-7908-1888-8. ⟨10.1007/978-3-7908-1888-8_11⟩ |
|
|
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures2023 |
|
|
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?2021 |
|
|
Deciding regular grammar logics with converse through first-order logic2004 |
Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuvesInformatique [cs]. Institut National Polytechnique de Grenoble, 1994. Français. ⟨NNT : ⟩ |
|
|
Logiques pour la spécification et vérificationLogique en informatique [cs.LO]. Université Denis Diderot Paris 7, 2007 |
|
|
Rudiments of Presburger ArithmeticMaster. Paris, France. 2016, pp.44 |
|
|
Logical Investigations on Separation Logics (ESSLLI 2015)Doctoral. Barcelona, Spain. 2015, pp.195 |
|
|
Lecture notes on "Decidable problems on counter systems", ESSLLI'10Doctoral. Copenhagen, Denmark. 2010, pp.129 |
|
|
Complexité algorithmique de variantes de LTL pour la vérificationMaster. Complexité algorithmique de variantes de LTL pour la vérification, Cachan, France. 2004, pp.90 |
|
|
Logique et Formalisation du Raisonnement cours de DEA partie II -Logiques Non ClassiquesMaster. Logique et Formalisation du Raisonnement, Grenoble, France. 1998, pp.27 |
Automated Reasoning – Seventh International Joint Conference (IJCAR 2014)Stéphane Demri; Deepak Kapur; Christoph Weidenbach. 7th International Joint Conference - IJCAR 2014, Jun 2014, Vienna, Austria. 8562, Springer, 2014, LNCS - Lecture Notes in Computer Science, 978-3-319-08586-9. ⟨10.1007/978-3-319-08587-6⟩ |
|
Methods for Modalities 2007Proceedings of Methods for Modalities 2007 (231), Electronic Notes in Computer Science, pp.1--362, 2009, Electronic Notes in Computer Science |