Stéphane Demri

87%

Libre accès

160

Documents

Identifiants chercheurs

stephane-demri
0000-0002-3493-2610
IdRef : 070195684

Présentation

Domaines de recherche

Logique en informatique [cs.LO]

Publications

	On Composing Finite Forests with Modal Logics Bartosz Bednarczyk , Stéphane Demri , Raul Fervari , Alessio Mansutti ACM Transactions on Computational Logic, 2023, 24 (2), pp.1-46. ⟨10.1145/3569954⟩ Article dans une revue hal-04056877v1
	Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Bartosz Bednarczyk , Stéphane Demri Logical Methods in Computer Science, 2022, 18 (3), pp.5:1--5:46. ⟨10.46298/lmcs-18(3:5)2022⟩ Article dans une revue hal-03749464v1
	Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability Francesco Belardinelli , Stéphane Demri Artificial Intelligence, 2021, 300, pp.103557. ⟨10.1016/j.artint.2021.103557⟩ Article dans une revue hal-03298703v1
	The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic Stéphane Demri , Etienne Lozes , Alessio Mansutti ACM Transactions on Computational Logic, 2021, 22 (2), pp.14:1--14:56. ⟨10.1145/3448269⟩ Article dans une revue hal-03215795v1
	Concrete domains in logics: a survey Stéphane Demri , Karin Quaas ACM SIGLOG News, 2021, 8 (3), pp.6-29. ⟨10.1145/3477986.3477988⟩ Article dans une revue hal-03313291v1
	Internal Proof Calculi for Modal Logics with Separating Conjunction Stéphane Demri , Raul Fervari , Alessio Mansutti Journal of Logic and Computation, 2021, 31 (3), pp.832-891. ⟨10.1093/logcom/exab016⟩ Article dans une revue hal-03185457v1
	A Complete Axiomatisation for Quantifier-Free Separation Logic Stéphane Demri , Etienne Lozes , Alessio Mansutti Logical Methods in Computer Science, 2021, 17 (3), pp.17:1--17:64. ⟨10.46298/lmcs-17(3:17)2021⟩ Article dans une revue hal-03005864v1
	The Power of Modal Separation Logics Stéphane Demri , Raul Fervari Journal of Logic and Computation, 2019, 29 (8), pp.1139--1184. ⟨10.1093/logcom/exz019⟩ Article dans une revue hal-03005862v1
	On the complexity of resource-bounded logics Natasha Alechina , Nils Bulling , Stephane Demri , Brian Logan Theoretical Computer Science, 2018, ⟨10.1016/j.tcs.2018.01.019⟩ Article dans une revue hal-02366661v1
	Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic Stéphane Demri , Amit K Kumar Dhar , Arnaud Sangnier Theoretical Computer Science, 2017, 735, pp.2-23. ⟨10.1016/j.tcs.2017.07.007⟩ Article dans une revue hal-03192244v1
	Separation Logic with One Quantified Variable Stephane Demri , Didier Galmiche , Dominique Larchey-Wendling , Daniel Mery Theory of Computing Systems, 2017, 61 (2), pp.371-461. ⟨10.1007/s00224-016-9713-1⟩ Article dans une revue hal-01258821v1
	Preface Parosh Aziz Abdulla , Stephane Demri , Alain Finkel , Jérôme Leroux , Igor Potapov Fundamenta Informaticae, 2016, 143 (3-4), pp.i-ii. ⟨10.3233/FI-2016-1311⟩ Article dans une revue hal-02391811v1
	Temporal Logics on Strings with Prefix Relation Stéphane Demri , Morgan Deters Journal of Logic and Computation, 2016, 26 (3), pp.989-1017. ⟨10.1093/logcom/exv028⟩ Article dans une revue hal-03186079v1
	Reasoning about Data Repetitions with Counter Systems Stéphane Demri , Diego Figueira , M. Praveen Logical Methods in Computer Science, 2016, 12 (3), ⟨10.2168/LMCS-12(3:1)2016⟩ Article dans une revue hal-01685180v1
	Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction Stéphane Demri , Morgan Deters ACM Transactions on Computational Logic, 2016, 17 (2), pp.12:1-12:44. ⟨10.1145/2835490⟩ Article dans une revue hal-03186336v1
	Two-Variable Separation Logic and Its Inner Circle Stéphane Demri , Morgan Deters ACM Transactions on Computational Logic, 2015, 16 (2:15), ⟨10.1145/2724711⟩ Article dans une revue hal-03192209v1
	Taming Past LTL and Flat Counter Systems Stéphane Demri , Amit K Kumar Dhar , Arnaud Sangnier Information and Computation, 2015, 242, pp.306-339. ⟨10.1016/j.ic.2015.03.007⟩ Article dans une revue hal-03192199v1
	Separation Logics and Modalities: A Survey Stéphane Demri , Morgan Deters Journal of Applied Non-Classical Logics, 2015, 25 (1), pp.50-99. ⟨10.1080/11663081.2015.1018801⟩ Article dans une revue hal-03186076v1
	On Selective Unboundedness of VASS Stéphane Demri Journal of Computer and System Sciences, 2013, 79 (5), pp.689-713. ⟨10.1016/j.jcss.2013.01.014⟩ Article dans une revue hal-03187435v1
	The covering and boundedness problems for branching vector addition systems Stéphane Demri , Marcin Jurdziński , Oded Lachish , Ranko Lazić Journal of Computer and System Sciences, inPress, 79 (1), pp.23-38. ⟨10.1016/j.jcss.2012.04.002⟩ Article dans une revue hal-03191875v1
	On the Almighty Wand Rémi Brochenin , Stephane Demri , Etienne Lozes Information and Computation, 2012, ⟨10.1016/j.ic.2011.12.003⟩ Article dans une revue hal-01905158v1
	Petri Net Reachability Graphs: Decidability Status of First Order Properties Philippe Darondeau , Stephane Demri , Roland Meyer , Christophe Morvan Logical Methods in Computer Science, 2012, 8 (4:9), pp.1-28. ⟨10.2168/LMCS-8(4:9)2012⟩ Article dans une revue hal-00743935v1
	Temporal Logics of Repeating Values Stéphane Demri , Deepak d'Souza , Régis Gascon Journal of Logic and Computation, 2011, 22 (5), pp.1059-1096. ⟨10.1093/logcom/exr013⟩ Article dans une revue hal-03191243v1
	The complexity of linear-time temporal logic over the class of ordinals Stéphane Demri , Alexander Rabinovich Logical Methods in Computer Science, 2010, 6 (4), ⟨10.2168/LMCS-6(4:9)2010⟩ Article dans une revue hal-03190247v1
	Model-Checking CTL* over Flat Presburger Counter Systems Stéphane Demri , Alain Finkel , Valentin Goranko , Govert van Drimmelen Journal of Applied Non-Classical Logics, 2010, 20 (4), pp.313-344. ⟨10.3166/jancl.20.313-344⟩ Article dans une revue hal-03191246v1
	Complexity of Modal Logics with Presburger Constraints Stéphane Demri , Denis Lugiez Journal of Applied Logic, 2010, 8 (3), pp.233-252. ⟨10.1016/j.jal.2010.03.001⟩ Article dans une revue hal-03188381v1
	Model checking memoryful linear-time logics over one-counter automata Stéphane Demri , Ranko Lazić , Arnaud Sangnier Theoretical Computer Science, 2010, 411 (22-24), pp.2298-2316. ⟨10.1016/j.tcs.2010.02.021⟩ Article dans une revue hal-03190262v1
	LTL with the Freeze Quantifier and Register Automata Stéphane Demri , Ranko Lazić ACM Transactions on Computational Logic, 2009, 10 (3), ⟨10.1145/1507244.1507246⟩ Article dans une revue hal-03189491v1
	The Effects of Bounding Syntactic Resources on Presburger LTL Stéphane Demri , Régis Gascon Journal of Logic and Computation, 2009, 19 (6), pp.1541-1575. ⟨10.1093/logcom/exp037⟩ Article dans une revue hal-03187851v1
	Reasoning about sequences of memory states Rémi Brochenin , Stephane Demri , Etienne Lozes Annals of Pure and Applied Logic, 2009, ⟨10.1016/j.apal.2009.07.004⟩ Article dans une revue hal-01905172v1
	Verification of qualitative Z constraints Stéphane Demri , Régis Gascon Theoretical Computer Science, 2008, 409 (1), pp.24-40. ⟨10.1016/j.tcs.2008.07.023⟩ Article dans une revue hal-03190241v1
	Relative Nondeterministic Information Logic is EXPTIME-complete Stéphane Demri , Ewa Orlowska Fundamenta Informaticae, 2007, 75 (1-4), pp.163-178 Article dans une revue hal-03189973v1
	An Automata-Theoretic Approach to Constraint LTL Stéphane Demri , Deepak d'Souza Information and Computation, 2007, 205 (3), pp.380-415. ⟨10.1016/j.ic.2006.09.006⟩ Article dans une revue hal-03189923v1
	On the freeze quantifier in Constraint LTL: decidability and complexity Stéphane Demri , Ranko Lazić , David Nowak Information and Computation, 2007, 205 (1), pp.2-24. ⟨10.1016/j.ic.2006.08.003⟩ Article dans une revue hal-03189579v1
	Reasoning about transfinite sequences Stéphane Demri , David Nowak International Journal of Foundations of Computer Science, 2007, 18 (1), pp.87--112. ⟨10.1142/S0129054107004589⟩ Article dans une revue hal-03189812v1
	LTL over Integer Periodicity Constraints Stéphane Demri Theoretical Computer Science, 2006, 360 (1--3), pp.96-123. ⟨10.1016/j.tcs.2006.02.019⟩ Article dans une revue hal-03189810v1
	On the freeze quantifier in Constraint LTL: decidability and complexity Stéphane Demri , Ranko Lazić , David Nowak Information and Computation, 2006, 205 (1), pp.2-24. ⟨10.1016/j.ic.2006.08.003⟩ Article dans une revue hal-03190175v1
	Linear-time Temporal Logics with Presburger Constraints: an Overview Stéphane Demri Journal of Applied Non-Classical Logics, 2006, 16 (3-4), pp.311-347. ⟨10.3166/jancl.16.311-347⟩ Article dans une revue hal-03189932v1
	A Parametric Analysis of the State-Explosion Problem in Model Checking Stéphane Demri , François Laroussinie , Ph Schnoebelen Journal of Computer and System Sciences, 2006, 72 (4), pp.547--575. ⟨10.1016/j.jcss.2005.11.003⟩ Article dans une revue hal-03189811v1
	Deciding regular grammar logics with converse through first-order logic Stéphane Demri , Hans de Nivelle Journal of Logic, Language and Information, 2005, 14 (3), pp.289-329. ⟨10.1007/s10849-005-5788-9⟩ Article dans une revue hal-03187843v1
	A reduction from DLP to PDL Stéphane Demri Journal of Logic and Computation, 2005, 15 (5), pp.767-785. ⟨10.1093/logcom/exi043⟩ Article dans une revue hal-03193413v1
	A Modal Perspective on Path Constraints Natasha Alechina , Stéphane Demri , Maarten de Rijke Journal of Logic and Computation, 2003, 13 (6), pp.939-956. ⟨10.1093/logcom/13.6.939⟩ Article dans une revue hal-03189647v1
	A polynomial space construction of tree-like models for logics with local chains of modal connectives Stéphane Demri Theoretical Computer Science, 2003, 300 (1-3), pp.235-258. ⟨10.1016/S0304-3975(02)00082-8⟩ Article dans une revue hal-03194857v1
	The Complexity of Propositional Linear Temporal Logics in Simple Cases Stéphane Demri , Philippe Schnoebelen Information and Computation, 2002, 174 (1), pp.84-103. ⟨10.1006/inco.2001.3094⟩ Article dans une revue hal-03189492v1
	Display Calculi for Nominal Tense Logics Stéphane Demri , Rajeev Goré Journal of Logic and Computation, 2002, 12 (6), pp.993-1016. ⟨10.1093/logcom/12.6.993⟩ Article dans une revue hal-03195079v1
	Theoremhood Preserving Maps Characterising Cut Elimination for Modal Provability Logics Stéphane Demri , Rajeev Goré Journal of Logic and Computation, 2002, 12 (5), pp.861-884. ⟨10.1093/logcom/12.5.861⟩ Article dans une revue hal-03195082v1
	Automata-Theoretic Decision Procedures for Information Logics Stéphane Demri , Ulrike Sattler Fundamenta Informaticae, 2002, 53 (1), pp.1-22. ⟨10.5555/1220762.1220763⟩ Article dans une revue hal-03194002v1
	The Complexity of Regularity in Grammar Logics and Related Modal Logics Stéphane Demri Journal of Logic and Computation, 2001, 11 (6), pp.933-960. ⟨10.1093/logcom/11.6.933⟩ Article dans une revue hal-03189648v1
	Computational Complexity of Multimodal Logics Based on Rough Sets Stéphane Demri , Jaroslaw Stepaniuk Fundamenta Informaticae, 2000, 44 (4), pp.373-396 Article dans une revue hal-03195322v1
	On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I Stéphane Demri , Dov M. Gabbay Studia Logica, 2000, 65 (3), pp.323-353. ⟨10.1023/A:1005235713913⟩ Article dans une revue hal-03192248v1
	Display Calculi for Logics with Relative Accessibility Relations Stéphane Demri , Rajeev Goré Journal of Logic, Language and Information, 2000, 9 (2), pp.213-236. ⟨10.1023/A:1008341521750⟩ Article dans une revue hal-03194849v1
	The Nondeterministic Information Logic NIL is PSPACE-complete Stéphane Demri Fundamenta Informaticae, 2000, 42 (3-4), pp.211-234 Article dans une revue hal-03192251v1
	On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II Stéphane Demri , Dov M. Gabbay Studia Logica, 2000, 65 (3), pp.349-384. ⟨10.1023/A:1005260600511⟩ Article dans une revue hal-03192250v1
	A Simple Modal Encoding of Propositional Finite Many-Valued Logics Stéphane Demri Journal of Multiple-Valued Logic and Soft Computing, 2000, 6, pp.443-461 Article dans une revue hal-03192253v1
	A Logic with Relative Knowledge Operators Stéphane Demri Journal of Logic, Language and Information, 1999, 8 (2), pp.167-185. ⟨10.1023/A:1008227432405⟩ Article dans une revue hal-03192516v1
	Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae Stéphane Demri , Ewa Orlowska Studia Logica, 1999, 62 (2), pp.177-200. ⟨10.1023/A:1026499402531⟩ Article dans une revue hal-03192512v1
	A Class of Decidable Information Logics Stéphane Demri Theoretical Computer Science, 1998, 195 (1), pp.33-60. ⟨10.1016/S0304-3975(97)00157-6⟩ Article dans une revue hal-03192782v1
	Extensions of modal logic S5 preserving NP-completeness Stéphane Demri Bulletin of the Section of Logic of the Polish Academy of Sciences, 1997, 26 (2), pp.73--84 Article dans une revue hal-03193470v1
	A Completeness Proof for a Logic with an Alternative Necessity Operator Stéphane Demri Studia Logica, 1997, 58 (1), pp.99-112. ⟨10.1023/A:1004944015811⟩ Article dans une revue hal-03193865v1
	The validity problem for the logic DALLA is decidable Stéphane Demri Bulletin of the Polish Academy of Sciences - Mathematics, 1996, 4 (1), pp.79--86 Article dans une revue hal-03193468v1
	Logical Analysis of Demonic NonDeterministic Programs Stéphane Demri , Ewa Orlowska Theoretical Computer Science, 1996, 166 (1-2), pp.173-202. ⟨10.1016/0304-3975(95)00190-5⟩ Article dans une revue hal-03193705v1
	3-SAT = SAT for a class of normal modal logics Stéphane Demri Information Processing Letters, 1995, 54 (5), pp.281-287. ⟨10.1016/0020-0190(95)00060-P⟩ Article dans une revue hal-03194860v1
	Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics Stéphane Demri Journal of Applied Non-Classical Logics, 1995, 5 (1), pp.77-96. ⟨10.1080/11663081.1995.10510844⟩ Article dans une revue hal-03192776v1
	Towards Reasoning about Hoare Relations Stéphane Demri , Ewa Orlowska , Ingrid Rewitzky Annals of Mathematics and Artificial Intelligence, 1994, 12 (3-4), pp.265-289. ⟨10.1007/BF01530788⟩ Article dans une revue hal-03193712v1
	A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics Ricardo Caferra , Stéphane Demri , Michel Herment Studia Logica, 1993, 52 (2), pp.197--232. ⟨10.1007/BF01058389⟩ Article dans une revue hal-03193873v1

	Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL(ℤ) to Decision Procedures Stéphane Demri , Karin Quaas 34th International Conference on Concurrency Theory (CONCUR 2023), Sep 2023, Antwerp, Belgium. ⟨10.4230/LIPIcs.CONCUR.2023.29⟩ Communication dans un congrès hal-04201369v1*
	First Steps Towards Taming Description Logics with Strings Stéphane Demri , Karin Quaas 18th Edition of the European Conference on Logics in Artificial Intelligence (JELIA'23), Sep 2023, Dresden (GERMANY), Germany. pp.322--337 Communication dans un congrès hal-04212642v1
	Model-Checking for Ability-Based Logics with Constrained Plans Stéphane Demri , Raul Fervari 37th AAAI Conference on Artificial Intelligence (AAAI-23), AAAI, Feb 2023, Washignton DC, United States Communication dans un congrès hal-03997096v1
	How to Manage a Budget with ATL+ Stéphane Demri , Raine Rönnholm 20th International Conference on Principles of Knowledge Representation and Reasoning (KR’23), Sep 2023, Rhodes, Greece. pp.188-197, ⟨10.24963/kr.2023/19⟩ Communication dans un congrès hal-04159432v1
	A Framework for Reasoning about Dynamic Axioms in Description Logics Bartosz Bednarczyk , Stéphane Demri , Alessio Mansutti Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, Jan 2021, Yokohama, Japan Communication dans un congrès hal-03005848v1
	Internal Calculi for Separation Logic Stéphane Demri , Etienne Lozes , Alessio Mansutti Computer Science Logic, Jan 2020, Barcelona, Spain. ⟨10.4230/LIPIcs.CSL.2020.19⟩ Communication dans un congrès hal-02883558v1
	Parameterised Resource-Bounded ATL Natasha Alechina , Stéphane Demri , Brian Logan The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, Feb 2020, New York, United States Communication dans un congrès hal-03005859v1
	Modal Logics with Composition on Finite Forests Bartosz Bednarczyk , Stéphane Demri , Raul Fervari , Alessio Mansutti 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbruecken, Germany. ⟨10.1145/3373718.3394787⟩ Communication dans un congrès hal-03005865v1
	Reasoning with a Bounded Number of Resources in ATL+ Francesco Belardinelli , Stéphane Demri 24th European Conference on Artificial Intelligence, Aug 2020, Santiago de Compostela, Spain. pp.624--631, ⟨10.3233/FAIA200147⟩ Communication dans un congrès hal-03005853v1
	Axiomatising logics with separating conjunctions and modalities Stephane Demri , Raul Fervari , Alessio Mansutti 16th European Conference on Logics in Artificial Intelligence (JELIA'19), May 2019, Rende, Italy. ⟨10.1007/978-3-030-19570-0_45⟩ Communication dans un congrès hal-02362648v1
	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 states Francesco Belardinelli , Stephane Demri Conférence Nationale en Intelligence Artificielle, Jul 2019, Toulouse, France Communication dans un congrès hal-02328812v1
	Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? Bartosz Bednarczyk , Stéphane Demri 34th Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19), Jun 2019, Vancouver, France. ⟨10.1109/LICS.2019.8785656⟩ Communication dans un congrès hal-02350328v1
	Resource-bounded ATL: the Quest for Tractable Fragments Francesco Belardinelli , Stephane Demri 18th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2019, May 2019, Montreal, Canada. pp.206--214 Communication dans un congrès hal-02362636v1
	On Temporal and Separation Logics Stephane Demri 25th 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⟩ Communication dans un congrès hal-02366656v1
	On the Complexity of Modal Separation Logics Stephane Demri , Raul Fervari Advances in Modal Logic, Bern, 2018, Aug 2018, Bern, Switzerland Communication dans un congrès hal-02366671v1
	The Effects of Adding Reachability Predicates in Propositional Separation Logic Stéphane Demri , Etienne Lozes , Alessio Mansutti 22nd International Conference on Foundations of Software Science and Computation Structures FOSSACS, 2018, Thessaloniki, Greece Communication dans un congrès hal-01920563v1
	On Symbolic Heaps Modulo Permission Theories S Demri , E Lozes , Denis Lugiez 37th IARCS Foundation on Software Technology and Theoretical Computer Science, Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.25⟩ Communication dans un congrès hal-01788798v1
	On the Complexity of Resource-Bounded Logics Natasha Alechina , Nils Bulling , Stéphane Demri , Brian Logan 10th 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⟩ Communication dans un congrès hal-03202652v1
	Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic Stéphane Demri , Amit K Kumar Dhar , Arnaud Sangnier Reachability 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⟩ Communication dans un congrès hal-03201531v1
	Expressive completeness of separation logic with two variables and no separating conjunction Stéphane Demri , Morgan Deters CSL-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⟩ Communication dans un congrès hal-03201035v1
	Separation Logic with One Quantified Variable Stephane Demri , Didier Galmiche , Dominique Larchey-Wendling , Daniel Mery 9th 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
	The Effects of Modalities in Separation Logics Stéphane Demri , Morgan Deters Proceedings of the 10th Conference on Advances in Modal Logics (AiML'14), Aug 2014, Groningen, Netherlands. pp.134-138 Communication dans un congrès hal-03201037v1
	Reasoning about Data Repetitions with Counter Systems Stéphane Demri , Diego Figueira , M. Praveen Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), Jun 2013, New Orleans, United States. ⟨10.1109/LICS.2013.8⟩ Communication dans un congrès hal-01795130v1
	Witness Runs for Counter Machines Clark Barrett , Stéphane Demri , Morgan Deters 9th 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⟩ Communication dans un congrès hal-03194728v1
	Model-Checking Bounded Multi-Pushdown Systems Kshitij Bansal , Stéphane Demri 8th International Computer Science Symposium in Russia, CSR 2013, Jun 2013, Ekaterinburg, Russia. pp.405-417, ⟨10.1007/978-3-642-38536-0_35⟩ Communication dans un congrès hal-03195088v1
	On the Complexity of Verifying Regular Properties on Flat Counter Systems, Stéphane Demri , Amit K Kumar Dhar , Arnaud Sangnier Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013,, Jul 2013, Riga, Latvia. pp.162-173, ⟨10.1007/978-3-642-39212-2_17⟩ Communication dans un congrès hal-03201533v1
	Taming Past LTL and Flat Counter Systems Stéphane Demri , Amit Kumar Dhar , Arnaud Sangnier 6th 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⟩ Communication dans un congrès hal-03202398v1
	Beyond Regularity for Presburger Modal Logics Facundo Carreiro , Stéphane Demri 9th Workshop on Advances in Modal Logics (AiML'12), Thomas Bolander; Torben Brauner; Silvio Ghilardi; Lawrence Moss, Aug 2012, Copenhagen, Denmark. pp.161-182 Communication dans un congrès hal-03194913v1
	The Complexity of Reversal-Bounded Model-Checking Marcello M Bersani , Stéphane Demri 8th 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⟩ Communication dans un congrès hal-03195045v1
	Automata-Based Computation of Temporal Equilibrium Models Pedro Cabalar , Stéphane Demri 21st 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⟩ Communication dans un congrès hal-03195219v1
	Petri Net Reachability Graphs: Decidability Status of FO Properties Philippe Darondeau , Stephane Demri , Roland Meyer , Christophe Morvan IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, IARCS, Dec 2011, Bombay, India Communication dans un congrès inria-00627657v1
	On Selective Unboundedness of VASS Stéphane Demri 12th International Workshops on Verification of Infinite State Systems (INFINITY'10), Oct 2010, Singapore, Singapore. pp.1-15, ⟨10.4204/EPTCS.39.1⟩ Communication dans un congrès hal-03195047v1
	When Model-Checking Freeze LTL over Counter Machines Becomes Decidable Stéphane Demri , Arnaud Sangnier FOSSACS 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⟩ Communication dans un congrès hal-03201974v1
	The covering and boundedness problems for branching vector addition systems Stéphane Demri , Marcin Jurdziński , Oded Lachish , Ranko Lazić IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, Dec 2009, Kanpur, India. pp.181-192 Communication dans un congrès hal-03201404v1
	On the Almighty Wand Rémi Brochenin , Stéphane Demri , Etienne Lozes Computer 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⟩ Communication dans un congrès hal-03201440v1
	Model Checking Freeze LTL over One-Counter Automata Stéphane Demri , Ranko Lazić , Arnaud Sangnier 11th 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⟩ Communication dans un congrès hal-03201399v1
	The Effects of Bounding Syntactic Resources on Presburger LTL Stéphane Demri , Régis Gascon 14th International Symposium on Temporal Representation and Reasoning (TIME'07), Jun 2007, Alicante, Spain. pp.94-104, ⟨10.1109/TIME.2007.63⟩ Communication dans un congrès hal-03201477v1
	A Decidable Temporal Logic of Repeating Values Stéphane Demri , Deepak D’souza , Régis Gascon International Symposium, LFCS 2007, Sergei Artemov; Anil Nerode, Jun 2007, New York, United States. pp.180-194, ⟨10.1007/978-3-540-72734-7_13⟩ Communication dans un congrès hal-03202404v1
	Reasoning About Sequences of Memory States Rémi Brochenin , Stéphane Demri , Etienne Lozes Proceedings 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⟩ Communication dans un congrès hal-03201337v1
	The complexity of temporal logic with until and since over ordinals Stéphane Demri , Alexander Rabinovich 14th 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⟩ Communication dans un congrès hal-03203563v1
	LTL with the Freeze Quantifier and Register Automata Stéphane Demri , Ranko Lazić 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 2006, Seattle, United States. pp.17-26, ⟨10.1109/LICS.2006.31⟩ Communication dans un congrès hal-03201335v1
	Towards a model-checker for counter systems Stéphane Demri , Alain Finkel , Valentin Goranko , Govert van Drimmelen ATVA 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⟩ Communication dans un congrès hal-03203578v1
	Presburger Modal Logic Is PSPACE-Complete Stéphane Demri , Denis Lugiez IJCAR 2006 - Automated Reasoning, Third International Joint Conference, Ulrich Furbach; Natarajan Shankar, Aug 2006, Seattle, United States. pp.541-556, ⟨10.1007/11814771_44⟩ Communication dans un congrès hal-03201487v1
	Verification of qualitative $\mathbb{Z}$ constraints Stéphane Demri , Régis Gascon CONCUR 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⟩ Communication dans un congrès hal-03203570v1
	On the Freeze Quantifier in Constraint LTL: Decidability and Complexity Stéphane Demri , Ranko Lazić , David Nowak 12th International Symposium on Temporal Representation and Reasoning (TIME'05), Jul 2005, Burlington, United States. pp.113-121, ⟨10.1109/TIME.2005.28⟩ Communication dans un congrès hal-03201127v1
	Reasoning about transfinite sequences (extended abstract) Stéphane Demri , David Nowak 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⟩ Communication dans un congrès hal-03203572v1
	LTL over Integer Periodicity Constraints (extended abstract) Stéphane Demri 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⟩ Communication dans un congrès hal-03200958v1
	Deciding Modal Logics through Relational Translations into GF2 Stéphane Demri , Hans de Nivelle Proceedings of the 3rd Workshop on Methods for Modalities (M4M-3), Carlos Areces; Patrick Blackburn, Sep 2003, Nancy, France. pp.93-108 Communication dans un congrès hal-03201443v1
	A Parametric Analysis of the State Explosion Problem in Model Checking Stéphane Demri , François Laroussinie , Philippe Schnoebelen 19th 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⟩ Communication dans un congrès hal-03202661v1
	An Automata-Theoretic Approach to Constraint LTL Stéphane Demri , Deepak D’souza International 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⟩ Communication dans un congrès hal-03202976v1
	Path Constraints from a Modal Logic Point of View (Extended abstract) Natasha Alechina , Stéphane Demri , Maarten de Rijke 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 Communication dans un congrès hal-03202950v1
	Complexity of Simple Dependent Bimodal Logics Stéphane Demri International Conference, TABLEAUX 2000, St Andrews, Scotland, Roy Dyckhoff, Jul 2000, St Andrews, United Kingdom. pp.190-204, ⟨10.1007/10722086_17⟩ Communication dans un congrès hal-03195235v1
	Tractable Transformations from Modal Provability Logics into First-Order Logic Stéphane Demri , Rajeev Goré 16th International Conference on Automated Deduction Trento, Italy, Harald Ganzinger, Jul 1999, Trento, Italy. pp.16-30, ⟨10.1007/3-540-48660-7_2⟩ Communication dans un congrès hal-03201407v1
	Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? Stéphane Demri 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⟩ Communication dans un congrès hal-03195331v1
	Cut-Free Display Calculi for Nominal Tense Logics Stéphane Demri , Rajeev Goré Automated 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⟩ Communication dans un congrès hal-03201530v1
	An O((n.log n) 3 )-time transformation from Grz into decidable fragments of classical first-order logic Stéphane Demri , Rajeev Goré International Workshop on First order Theorem Proving (FTP'98), Ricardo Caferra; Gernot Salzer, Nov 1998, Vienna, Austria. pp.153-167 Communication dans un congrès hal-03195009v1
	Relative Similarity Logics are Decidable: Reduction to FO2 with Equality Stéphane Demri , Beata Konikowska European 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⟩ Communication dans un congrès hal-03195324v1
	The complexity of propositional linear temporal logics in simple cases Stéphane Demri , Ph. Schnoebelen Annual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩ Communication dans un congrès hal-03199998v1
	Prefixed Tableaux Systems for Modal Logics with Enriched Languages Philippe Balbiani , Stéphane Demri 15th International Joint Conference on Artificial Intelligence (IJCAI'97), Aug 1997, Nagoya, Japan. pp.190-195 Communication dans un congrès hal-03195295v1
	Finite model property for a logic for data analysis Stéphane Demri International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU'96), Jul 1996, Granada, Spain. pp.871--876 Communication dans un congrès hal-03204987v1
	A simple tableau system for the logic of elsewhere Stéphane Demri 5th 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⟩ Communication dans un congrès hal-03195223v1
	A class of information logics with a decidable validity problem Stéphane Demri Mathematical 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⟩ Communication dans un congrès hal-03202624v1
	On the Complexity of Extending Ground Resolution with Symmetry Rules Thierry Boy de La Tour , Stéphane Demri Fourteenth International Joint Conference on Artificial Intelligence, (IJCAI'95), Aug 1995, Montreal, Canada. pp.289-295 Communication dans un congrès hal-03195326v1
	Using connection method in modal logics: Some advantages Stéphane Demri 4th 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⟩ Communication dans un congrès hal-03201134v1
	A Hierarchy of Backward Translations: Applications to Modal Logics Stéphane Demri Proceedings 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 Communication dans un congrès hal-03195010v1
	Efficient strategies for Automated reasoning in modal logics Stéphane Demri European Workshop JELIA'94 York, UK, Craig MacNish; David Pearce; Luís Moniz Pereira, Sep 1994, York, United Kingdom. pp.182-197, ⟨10.1007/BFb0021972⟩ Communication dans un congrès hal-03201129v1
	Resolution for Weak Modal Logics Stéphane Demri Proceedings of the 6th International Conference on Artificial Intelligence: Methodology, Systems, Applications (AIMSA'94), Philippe Jorrand; Vasil Sgurev, Jan 1994, Sofia, Bulgaria. pp.131-140 Communication dans un congrès hal-03200954v1
	Cooperation between direct method and translation method in non classical logics : some results in propositional S5 Ricardo Caferra , Stéphane Demri In 13th International Joint Conference on Artificial Intelligence (IJCAI-13), Jul 1993, Chambéry, France Communication dans un congrès hal-03201131v1
	Logic morphisms as a framework for the backward transfer of lemmas and strategies in some modal and epistemic logics Ricardo Caferra , Stéphane Demri , Michel Herment 9th National Conference of the American Association for Artificial Intelligence (AAAI-9), Jul 1991, Anaheim, United States. pp.421--426 Communication dans un congrès hal-03200948v1

	Temporal Logics in Computer Science Stéphane Demri , Valentin Goranko , Martin Lange Cambridge University Press, 2016, 9781139236119 Ouvrages hal-03189977v1
	Proceedings of the 11th Conference on Advances in Modal Logic (AiML'16) Lev Dmitrievich Beklemishev , Stéphane Demri , Andras Maté , 2016, 978-1-84890-201-5 Ouvrages hal-03191063v1
	Proceedings of the 15th International Symposium on Temporal Representation and Reasoning (TIME 2008), Montréal, Canada Stéphane Demri , Christian Jensen , 2008, 978-0-7695-3181-6 Ouvrages hal-03191892v1
	Incomplete Information: Structure, Inference, Complexity Stéphane Demri , Ewa Orlowska Springer, 2002, 978-3-662-04997-6 Ouvrages hal-03190271v1

	Reasoning about reversal-bounded counter machines Stephane Demri Ewa 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⟩ Chapitre d'ouvrage hal-02366668v1
	Specification and Verification using Temporal Logics Stéphane Demri , Paul Gastin D'Souza, Deepak and Shankar, Priti. Modern applications of automata theory, 2, World Scientific, pp.457-494, 2012, ⟨10.1142/7237⟩ Chapitre d'ouvrage hal-00776601v1
	Verification of Infinite-State Systems Stéphane Demri , Denis Poitrenaud Models and Analysis in Distributed Systems, Wiley, pp.221-269, 2011, 9781848213142 Chapitre d'ouvrage hal-01288079v1
	Modal Logics with Weak Forms of Recursion: PSPACE Specimens Stéphane Demri Advances in Modal Logic (AIML'00), WORLD SCIENTIFIC, pp.113-138, 2002, 979-981-238-179-8. ⟨10.1142/9789812776471_0007⟩ Chapitre d'ouvrage hal-03194865v1
	Coping with Semilattices of Relations in Logics with Relative Accessibility Relations Stéphane Demri Ewa 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⟩ Chapitre d'ouvrage hal-03194796v1
	Informational representability: Abstract models versus concrete models. Stéphane Demri , Ewa Orlowska 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⟩ Chapitre d'ouvrage hal-03201138v1
	Informational representability of models for information logics Stéphane Demri , Ewa Orlowska Ewa Orlowska. Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, Physica Verlag, pp.383-409, 1999, 978-3-7908-1864-2 Chapitre d'ouvrage hal-03195297v1
	Indiscernibility and complementarity relations in information systems Stéphane Demri , Ewa Orlowska , Dimiter Vakarelov Jelle Gerbrandy; Maarten Marx; Maarten de Rijke; Yde Venema. JFAK: Essays Dedicated to Johan van Benthem on the Occasion of his 50th Birthday, , 1999 Chapitre d'ouvrage hal-03192504v1
	Logical analysis of indiscernibility Stéphane Demri , Ewa Orlowska Ewa Orlowska. Incomplete Information: Rough Set Analysis, , pp.347-380, 1998, 78-3-7908-1888-8. ⟨10.1007/978-3-7908-1888-8_11⟩ Chapitre d'ouvrage hal-03193466v1
	Complementarity Relations: Reduction of Decision Rules and Informational Representability Stéphane Demri , Ewa Orlowska Lech Polkowski; Andrzej Skowron. Rough Sets in Knowledge Discovery 1 -- Methodology and Applications, , pp.99-106, 1998, 978-3-7908-1884-0 Chapitre d'ouvrage hal-03195328v1

	Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL(Z) To Decision Procedures Stéphane Demri , Karin Quaas 2023 Pré-publication, Document de travail hal-04144311v1*
	Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? Bartosz Bednarczyk , Stéphane Demri 2021 Pré-publication, Document de travail hal-03210588v1
	Deciding regular grammar logics with converse through first-order logic Stéphane Demri , Hans de Nivelle 2004 Pré-publication, Document de travail hal-03234837v1

	Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuves Stéphane Demri Informatique [cs]. Institut National Polytechnique de Grenoble, 1994. Français. ⟨NNT : ⟩ Thèse tel-03199669v1

	Logiques pour la spécification et vérification Stéphane Demri Logique en informatique [cs.LO]. Université Denis Diderot Paris 7, 2007 HDR tel-03189929v1

	Rudiments of Presburger Arithmetic Stéphane Demri Master. Paris, France. 2016, pp.44 Cours hal-03188114v1
	Logical Investigations on Separation Logics (ESSLLI 2015) Stéphane Demri , Morgan Deters Doctoral. Barcelona, Spain. 2015, pp.195 Cours hal-03187866v1
	Lecture notes on "Decidable problems on counter systems", ESSLLI'10 Stéphane Demri Doctoral. Copenhagen, Denmark. 2010, pp.129 Cours hal-03192775v1
	Complexité algorithmique de variantes de LTL pour la vérification Stéphane Demri Master. Complexité algorithmique de variantes de LTL pour la vérification, Cachan, France. 2004, pp.90 Cours hal-03592043v1
	Logique et Formalisation du Raisonnement cours de DEA partie II -Logiques Non Classiques Stéphane Demri Master. Logique et Formalisation du Raisonnement, Grenoble, France. 1998, pp.27 Cours hal-03201332v1

	Automated Reasoning – Seventh International Joint Conference (IJCAR 2014) Stéphane Demri , Deepak Kapur , Christoph Weidenbach 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⟩ Proceedings/Recueil des communications hal-01098072v1
	Methods for Modalities 2007 Carlos Areces , Stephane Demri Proceedings of Methods for Modalities 2007 (231), Electronic Notes in Computer Science, pp.1--362, 2009, Electronic Notes in Computer Science Proceedings/Recueil des communications inria-00323836v1

Stéphane Demri

Présentation

Domaines de recherche

Publications

On Composing Finite Forests with Modal Logics

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

Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability

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

Concrete domains in logics: a survey

Internal Proof Calculi for Modal Logics with Separating Conjunction

A Complete Axiomatisation for Quantifier-Free Separation Logic

The Power of Modal Separation Logics

On the complexity of resource-bounded logics

Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic

Separation Logic with One Quantified Variable

Preface

Temporal Logics on Strings with Prefix Relation

Reasoning about Data Repetitions with Counter Systems

Expressive Completeness of Separation Logic With Two Variables and No Separating Conjunction

Two-Variable Separation Logic and Its Inner Circle

Taming Past LTL and Flat Counter Systems

Separation Logics and Modalities: A Survey

On Selective Unboundedness of VASS

The covering and boundedness problems for branching vector addition systems

On the Almighty Wand

Petri Net Reachability Graphs: Decidability Status of First Order Properties

Temporal Logics of Repeating Values

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

Model-Checking CTL* over Flat Presburger Counter Systems

Complexity of Modal Logics with Presburger Constraints

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

LTL with the Freeze Quantifier and Register Automata

The Effects of Bounding Syntactic Resources on Presburger LTL

Reasoning about sequences of memory states

Verification of qualitative Z constraints

Relative Nondeterministic Information Logic is EXPTIME-complete

An Automata-Theoretic Approach to Constraint LTL

On the freeze quantifier in Constraint LTL: decidability and complexity

Reasoning about transfinite sequences

LTL over Integer Periodicity Constraints

On the freeze quantifier in Constraint LTL: decidability and complexity

Linear-time Temporal Logics with Presburger Constraints: an Overview

A Parametric Analysis of the State-Explosion Problem in Model Checking

Deciding regular grammar logics with converse through first-order logic

A reduction from DLP to PDL

A Modal Perspective on Path Constraints

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

The Complexity of Propositional Linear Temporal Logics in Simple Cases

Display Calculi for Nominal Tense Logics

Theoremhood Preserving Maps Characterising Cut Elimination for Modal Provability Logics

Automata-Theoretic Decision Procedures for Information Logics

The Complexity of Regularity in Grammar Logics and Related Modal Logics

Computational Complexity of Multimodal Logics Based on Rough Sets

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

Display Calculi for Logics with Relative Accessibility Relations

The Nondeterministic Information Logic NIL is PSPACE-complete

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

A Simple Modal Encoding of Propositional Finite Many-Valued Logics

A Logic with Relative Knowledge Operators

Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae

A Class of Decidable Information Logics

Extensions of modal logic S5 preserving NP-completeness

A Completeness Proof for a Logic with an Alternative Necessity Operator

The validity problem for the logic DALLA is decidable

Logical Analysis of Demonic NonDeterministic Programs

3-SAT = SAT for a class of normal modal logics

Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics

Towards Reasoning about Hoare Relations

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

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

First Steps Towards Taming Description Logics with Strings

Model-Checking for Ability-Based Logics with Constrained Plans

How to Manage a Budget with ATL+

A Framework for Reasoning about Dynamic Axioms in Description Logics

Internal Calculi for Separation Logic

Parameterised Resource-Bounded ATL

Modal Logics with Composition on Finite Forests

Reasoning with a Bounded Number of Resources in ATL+

Axiomatising logics with separating conjunctions and modalities

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 states