Edit Profile (opens in new tab) Demri, Stéphane P. Compute Distance To: Compute Author ID: demri.stephane-p Published as: Demri, Stéphane; Demri, S.; Demri, Stephane; Demri, Stéphane P. more...less Documents Indexed: 116 Publications since 1992, including 2 Books 5 Contributions as Editor Co-Authors: 59 Co-Authors with 97 Joint Publications 1,430 Co-Co-Authors all top 5 Co-Authors 24 single-authored 9 Orłowska, Ewa S. 8 Deters, Morgan 8 Sangnier, Arnaud 7 Lozes, Etienne 6 Goré, Rajeev Prabhakar 6 Lazić, Ranko 5 Dhar, Amit Kumar 5 Fervari, Raul 5 Gascon, Régis 5 Mansutti, Alessio 4 Brochenin, Rémi 4 D’Souza, Deepak 3 Alechina, Natasha 3 Finkel, Alain 3 Goranko, Valentin F. 3 Lugiez, Denis 3 Nowak, David E. 3 Schnoebelen, Philippe 2 Barrett, Clark W. 2 Bednarczyk, Bartosz 2 Belardinelli, Francesco 2 Bulling, Nils 2 Caferra, Ricardo 2 Darondeau, Philippe 2 Figueira, Diego 2 Gabbay, Dov M. 2 Galmiche, Didier 2 Jurdziński, Marcin 2 Kapur, Deepak 2 Lachish, Oded 2 Larchey-Wendling, Dominique 2 Laroussinie, François 2 Logan, Brian 2 Méry, Daniel 2 Meyer, Roland 2 Morvan, Christophe 2 Praveen, M. 2 Rabinovich, Alexander 2 van Drimmelen, Govert 2 Weidenbach, Christoph 1 Abdulla, Parosh Aziz 1 Areces, Carlos 1 Bansal, Kshitij 1 Beklemishev, Lev D. 1 Bersani, Marcello Maria 1 Cabalar, Pedro 1 Carreiro, Facundo 1 de Nivelle, Hans 1 de Rijke, Maarten 1 Gastin, Paul 1 Herment, Michel 1 Konikowska, Beata 1 Lange, Martin 1 Leroux, Jérôme 1 Máté, András 1 Potapov, Igor 1 Rewitzky, Ingrid 1 Sattler, Ulrike 1 Stepaniuk, Jarosław all top 5 Serials 10 Journal of Logic and Computation 8 Theoretical Computer Science 5 Studia Logica 5 Information and Computation 5 Fundamenta Informaticae 5 Logical Methods in Computer Science 4 Journal of Applied Non-Classical Logics 3 Journal of Computer and System Sciences 3 Journal of Logic, Language and Information 3 ACM Transactions on Computational Logic 2 Bulletin of the Section of Logic 1 Artificial Intelligence 1 Information Processing Letters 1 Annals of Pure and Applied Logic 1 Journal of Automated Reasoning 1 International Journal of Foundations of Computer Science 1 Bulletin of the Polish Academy of Sciences, Mathematics 1 Annals of Mathematics and Artificial Intelligence 1 Multiple-Valued Logic 1 Theory of Computing Systems 1 Journal of Applied Logic 1 Cambridge Tracts in Theoretical Computer Science 1 Lecture Notes in Computer Science 1 Electronic Notes in Theoretical Computer Science 1 Monographs in Theoretical Computer Science. An EATCS Series Fields 102 Mathematical logic and foundations (03-XX) 96 Computer science (68-XX) 5 General and overarching topics; collections (00-XX) 1 Order, lattices, ordered algebraic structures (06-XX) 1 Information and communication theory, circuits (94-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH Open 93 Publications have been cited 501 times in 301 Documents Cited by ▼ Year ▼ LTL with the freeze quantifier and register automata. Zbl 1351.68158Demri, Stéphane; Lazić, Ranko 55 2009 The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072Demri, Stéphane; Schnoebelen, Philippe 27 2002 Incomplete information: Structure, inference, complexity. Zbl 1016.68163Demri, Stéphane P.; Orłowska, Ewa S. 26 2002 Temporal logics in computer science. Finite-state systems. Zbl 1380.68003Demri, Stéphane; Goranko, Valentin; Lange, Martin 21 2016 On the almighty wand. Zbl 1262.03051Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 20 2012 An automata-theoretic approach to constraint LTL. Zbl 1113.03015Demri, Stéphane; D’Souza, Deepak 20 2007 Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert 13 2010 Deciding regular grammar logics with converse through first-order logic. Zbl 1083.03023Demri, Stéphane; de Nivelle, Hans 13 2005 On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014Demri, Stéphane; Lazić, Ranko; Nowak, David 12 2007 A modal perspective on path constraints. Zbl 1093.68032Alechina, Natasha; Demri, Stéphane; de Rijke, Maarten 10 2003 The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 10 2013 On the almighty wand. Zbl 1157.03010Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 9 2008 The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033Demri, Stéphane; Gascon, Régis 9 2009 On selective unboundedness of VASS. Zbl 1285.68094Demri, Stéphane 8 2013 LTL over integer periodicity constraints. Zbl 1097.68073Demri, Stéphane 8 2006 Towards a model-checker for counter systems. Zbl 1161.68563Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G. 8 2006 The complexity of regularity in grammar logics and related modal logics. Zbl 1002.03018Demri, Stéphane 8 2001 Two-variable separation logic and its inner circle. Zbl 1354.03036Demri, Stéphane; Deters, Morgan 7 2015 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053Demri, Stephane; Deters, Morgan 7 2016 Separation logic with one quantified variable. Zbl 1408.68036Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 7 2014 Reasoning about sequences of memory states. Zbl 1225.68068Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 7 2009 The effects of adding reachability predicates in propositional separation logic. Zbl 06904552Demri, Stéphane; Lozes, Étienne; Mansutti, Alessio 7 2018 Separation logics and modalities: a survey. Zbl 1398.03151Demri, Stéphane; Deters, Morgan 7 2015 An automata-theoretic approach to constraint LTL. Zbl 1027.03027Demri, Stéphane; D’Souza, Deepak 6 2002 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1134.68405Demri, Stéphane; Gascon, Régis 6 2005 Presburger modal logic is PSPACE-complete. Zbl 1222.03024Demri, Stéphane; Lugiez, Denis 6 2006 When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394Demri, Stéphane; Sangnier, Arnaud 6 2010 Reasoning about data repetitions with counter systems. Zbl 1366.68202Demri, Stéphane; Figueira, Diego; Praveen, M. 5 2013 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048Demri, Stéphane; Gascon, Régis 5 2008 A completeness proof for a logic with an alternative necessity operator. Zbl 0864.03012Demri, Stéphane 5 1997 Separation logic with one quantified variable. Zbl 1435.68117Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 5 2017 A reduction from DLP to PDL. Zbl 1092.03016Demri, Stéphane 5 2005 On the complexity of modal separation logics. Zbl 1418.03077Demri, Stéphane; Fervari, Raul 5 2018 Uniform and non uniform strategies for tableaux calculi for modal logics. Zbl 0826.03006Demri, Stéphane 4 1995 Taming past LTL and flat counter systems. Zbl 1378.68112Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 4 2015 Display calculi for nomial tense logics. Zbl 1016.03018Demri, Stéphane; Goré, Rajeev 4 2002 Model checking freeze LTL over one-counter automata. Zbl 1139.68038Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 4 2008 The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012Demri, S.; Schnoebelen, Ph. 4 1998 A logic with relative knowledge operators. Zbl 0928.68107Demri, Stéphane 4 1999 LTL over integer periodicity constraints (extended abstract). Zbl 1126.68471Demri, Stéphane 4 2004 The validity problem for the logic DALLA is decidable. Zbl 0847.03012Demri, Stéphane 3 1996 On the complexity of verifying regular properties on flat counter systems. Zbl 1334.68130Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2013 Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68101Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud 3 2014 A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557Demri, S.; Laroussinie, F.; Schnoebelen, P. 3 2002 Complexity of simple dependent bimodal logics. Zbl 0963.03076Demri, Stéphane 3 2000 Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Zbl 1006.03036Demri, Stéphane; Goré, Rajeev 3 2002 Temporal logics on strings with prefix relation. Zbl 1353.68176Demri, Stéphane; Deters, Morgan 3 2016 Taming past LTL and flat counter systems. Zbl 1358.68186Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2012 Complexity of modal logics with Presburger constraints. Zbl 1220.03008Demri, Stéphane; Lugiez, Denis 3 2010 Temporal logics of repeating values. Zbl 1279.68203Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 3 2012 Automata-based computation of temporal equilibrium models. Zbl 1377.68060Cabalar, Pedro; Demri, Stéphane 3 2012 Linear-time temporal logics with Presburger constraints: an overview. Zbl 1186.03036Demri, Stéphane 3 2006 Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 3 2010 The power of modal separation logics. Zbl 1444.03113Demri, Stéphane; Fervari, Raul 3 2019 Axiomatising logics with separating conjunction and modalities. Zbl 07169139Demri, Stéphane; Fervari, Raul; Mansutti, Alessio 3 2019 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1394.03054Demri, Stéphane; Deters, Morgan 3 2014 On the complexity of resource-bounded logics. Zbl 1403.68137Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian 3 2016 Logical analysis of demonic nondeterministic programs. Zbl 0872.03018Demri, Stéphane; Orłowska, Ewa 2 1996 Witness runs for counter machines. Zbl 1397.68122Barrett, Clark; Demri, Stéphane; Deters, Morgan 2 2013 Reasoning about data repetitions with counter systems. Zbl 1448.68339Demri, Stéphane; Figueira, Diego; Praveen, M. 2 2016 Modal logics with composition on finite forests: expressivity and complexity. Zbl 1498.03049Bednarczyk, Bartosz; Demri, Stéphane; Fervari, Raul; Mansutti, Alessio 2 2020 The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036Demri, Stéphane 2 2000 Modal logics with weak forms of recursion: PSPACE specimens. Zbl 1031.03031Demri, Stéphane 2 2002 Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023Demri, Stéphane; Stepaniuk, Jarosław 2 2000 The complexity of reversal-bounded model-checking. Zbl 1348.68121Bersani, Marcello M.; Demri, Stéphane 2 2011 A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056Demri, S.; Laroussinie, F.; Schnoebelen, Ph. 2 2006 Model-checking bounded multi-pushdown systems. Zbl 1381.68145Bansal, Kshitij; Demri, Stéphane 2 2013 On the complexity of resource-bounded logics. Zbl 1403.68136Alechina, N.; Bulling, N.; Demri, S.; Logan, B. 2 2018 Reasoning about sequences of memory states. Zbl 1132.68335Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 2 2007 A decidable temporal logic of repeating values. Zbl 1132.03337Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 2 2007 Towards reasoning about Hoare relations. Zbl 0858.68057Demri, Stéphane; Orlowska, Ewa; Rewitzky, Ingrid 1 1994 Reasoning with a bounded number of resources in ATL+. Zbl 1464.68344Belardinelli, Francesco; Demri, Stéphane 1 2020 Display calculi for logics with relative accessibility relations. Zbl 0988.03030Demri, Stéphane; Goré, Rajeev 1 2000 An \({\mathcal O}((n\log n)^3)\)-time transformation from Grz into decidable fragments of classical first-order logic. Zbl 0956.03026Demri, Stéphane; Goré, Rajeev 1 2000 Automata-theoretic decision procedures for information logics. Zbl 1025.03021Demri, Stéphane; Sattler, Ulrike 1 2002 A polynomial space construction of tree-like models for logics with local chains of modal connectives. Zbl 1028.68064Demri, Stéphane 1 2003 Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031Demri, Stéphane 1 1999 Cut-free display calculi for nominal tense logics. Zbl 0931.03032Demri, Stéphane; Goré, Rajeev 1 1999 A simple modal encoding of propositional finite many-valued logics. Zbl 0992.03031Demri, Stéphane 1 2000 Petri net reachability graphs: decidability status of FO properties. Zbl 1246.68162Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2011 The complexity of linear-time temporal logic over the class of ordinals. Zbl 1213.03027Demri, Stéphane; Rabinovich, Alexander 1 2010 The covering and boundedness problems for branching vector addition systems. Zbl 1248.68202Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 1 2009 Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2012 Specification and verification using temporal logics. Zbl 1256.68101Demri, Stéphane; Gastin, Paul 1 2012 Reasoning about transfinite sequences. Zbl 1109.68065Demri, Stéphane; Nowak, David 1 2007 The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308Demri, Stéphane; Rabinovich, Alexander 1 2007 Reasoning about transfinite sequences. (Extended abstract). Zbl 1170.68513Demri, Stéphane; Nowak, David 1 2005 A class of information logics with a decidable validity problem. Zbl 0886.03014Demri, Stéphane 1 1996 A class of decidable information logics. Zbl 0902.68062Demri, Stéphane 1 1998 On modal logics characterized by models with relative accessibility relations. II. Zbl 0981.03031Demri, Stéphane; Gabbay, Dov 1 2000 Informational representability of models for information logics. Zbl 0923.03039Demri, Stéphane; Orłowska, Ewa 1 1999 A simple tableau system for the logic of elsewhere. Zbl 1415.03021Demri, Stéphane 1 1996 Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68100Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 1 2018 Modal logics with composition on finite forests: expressivity and complexity. Zbl 1498.03049Bednarczyk, Bartosz; Demri, Stéphane; Fervari, Raul; Mansutti, Alessio 2 2020 Reasoning with a bounded number of resources in ATL+. Zbl 1464.68344Belardinelli, Francesco; Demri, Stéphane 1 2020 The power of modal separation logics. Zbl 1444.03113Demri, Stéphane; Fervari, Raul 3 2019 Axiomatising logics with separating conjunction and modalities. Zbl 07169139Demri, Stéphane; Fervari, Raul; Mansutti, Alessio 3 2019 The effects of adding reachability predicates in propositional separation logic. Zbl 06904552Demri, Stéphane; Lozes, Étienne; Mansutti, Alessio 7 2018 On the complexity of modal separation logics. Zbl 1418.03077Demri, Stéphane; Fervari, Raul 5 2018 On the complexity of resource-bounded logics. Zbl 1403.68136Alechina, N.; Bulling, N.; Demri, S.; Logan, B. 2 2018 Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68100Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 1 2018 Separation logic with one quantified variable. Zbl 1435.68117Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 5 2017 Temporal logics in computer science. Finite-state systems. Zbl 1380.68003Demri, Stéphane; Goranko, Valentin; Lange, Martin 21 2016 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053Demri, Stephane; Deters, Morgan 7 2016 Temporal logics on strings with prefix relation. Zbl 1353.68176Demri, Stéphane; Deters, Morgan 3 2016 On the complexity of resource-bounded logics. Zbl 1403.68137Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian 3 2016 Reasoning about data repetitions with counter systems. Zbl 1448.68339Demri, Stéphane; Figueira, Diego; Praveen, M. 2 2016 Two-variable separation logic and its inner circle. Zbl 1354.03036Demri, Stéphane; Deters, Morgan 7 2015 Separation logics and modalities: a survey. Zbl 1398.03151Demri, Stéphane; Deters, Morgan 7 2015 Taming past LTL and flat counter systems. Zbl 1378.68112Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 4 2015 Separation logic with one quantified variable. Zbl 1408.68036Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 7 2014 Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68101Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud 3 2014 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1394.03054Demri, Stéphane; Deters, Morgan 3 2014 The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 10 2013 On selective unboundedness of VASS. Zbl 1285.68094Demri, Stéphane 8 2013 Reasoning about data repetitions with counter systems. Zbl 1366.68202Demri, Stéphane; Figueira, Diego; Praveen, M. 5 2013 On the complexity of verifying regular properties on flat counter systems. Zbl 1334.68130Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2013 Witness runs for counter machines. Zbl 1397.68122Barrett, Clark; Demri, Stéphane; Deters, Morgan 2 2013 Model-checking bounded multi-pushdown systems. Zbl 1381.68145Bansal, Kshitij; Demri, Stéphane 2 2013 On the almighty wand. Zbl 1262.03051Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 20 2012 Taming past LTL and flat counter systems. Zbl 1358.68186Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2012 Temporal logics of repeating values. Zbl 1279.68203Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 3 2012 Automata-based computation of temporal equilibrium models. Zbl 1377.68060Cabalar, Pedro; Demri, Stéphane 3 2012 Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2012 Specification and verification using temporal logics. Zbl 1256.68101Demri, Stéphane; Gastin, Paul 1 2012 The complexity of reversal-bounded model-checking. Zbl 1348.68121Bersani, Marcello M.; Demri, Stéphane 2 2011 Petri net reachability graphs: decidability status of FO properties. Zbl 1246.68162Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2011 Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert 13 2010 When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394Demri, Stéphane; Sangnier, Arnaud 6 2010 Complexity of modal logics with Presburger constraints. Zbl 1220.03008Demri, Stéphane; Lugiez, Denis 3 2010 Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 3 2010 The complexity of linear-time temporal logic over the class of ordinals. Zbl 1213.03027Demri, Stéphane; Rabinovich, Alexander 1 2010 LTL with the freeze quantifier and register automata. Zbl 1351.68158Demri, Stéphane; Lazić, Ranko 55 2009 The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033Demri, Stéphane; Gascon, Régis 9 2009 Reasoning about sequences of memory states. Zbl 1225.68068Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 7 2009 The covering and boundedness problems for branching vector addition systems. Zbl 1248.68202Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 1 2009 On the almighty wand. Zbl 1157.03010Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 9 2008 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048Demri, Stéphane; Gascon, Régis 5 2008 Model checking freeze LTL over one-counter automata. Zbl 1139.68038Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 4 2008 An automata-theoretic approach to constraint LTL. Zbl 1113.03015Demri, Stéphane; D’Souza, Deepak 20 2007 On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014Demri, Stéphane; Lazić, Ranko; Nowak, David 12 2007 Reasoning about sequences of memory states. Zbl 1132.68335Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 2 2007 A decidable temporal logic of repeating values. Zbl 1132.03337Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 2 2007 Reasoning about transfinite sequences. Zbl 1109.68065Demri, Stéphane; Nowak, David 1 2007 The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308Demri, Stéphane; Rabinovich, Alexander 1 2007 LTL over integer periodicity constraints. Zbl 1097.68073Demri, Stéphane 8 2006 Towards a model-checker for counter systems. Zbl 1161.68563Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G. 8 2006 Presburger modal logic is PSPACE-complete. Zbl 1222.03024Demri, Stéphane; Lugiez, Denis 6 2006 Linear-time temporal logics with Presburger constraints: an overview. Zbl 1186.03036Demri, Stéphane 3 2006 A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056Demri, S.; Laroussinie, F.; Schnoebelen, Ph. 2 2006 Deciding regular grammar logics with converse through first-order logic. Zbl 1083.03023Demri, Stéphane; de Nivelle, Hans 13 2005 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1134.68405Demri, Stéphane; Gascon, Régis 6 2005 A reduction from DLP to PDL. Zbl 1092.03016Demri, Stéphane 5 2005 Reasoning about transfinite sequences. (Extended abstract). Zbl 1170.68513Demri, Stéphane; Nowak, David 1 2005 LTL over integer periodicity constraints (extended abstract). Zbl 1126.68471Demri, Stéphane 4 2004 A modal perspective on path constraints. Zbl 1093.68032Alechina, Natasha; Demri, Stéphane; de Rijke, Maarten 10 2003 A polynomial space construction of tree-like models for logics with local chains of modal connectives. Zbl 1028.68064Demri, Stéphane 1 2003 The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072Demri, Stéphane; Schnoebelen, Philippe 27 2002 Incomplete information: Structure, inference, complexity. Zbl 1016.68163Demri, Stéphane P.; Orłowska, Ewa S. 26 2002 An automata-theoretic approach to constraint LTL. Zbl 1027.03027Demri, Stéphane; D’Souza, Deepak 6 2002 Display calculi for nomial tense logics. Zbl 1016.03018Demri, Stéphane; Goré, Rajeev 4 2002 A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557Demri, S.; Laroussinie, F.; Schnoebelen, P. 3 2002 Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Zbl 1006.03036Demri, Stéphane; Goré, Rajeev 3 2002 Modal logics with weak forms of recursion: PSPACE specimens. Zbl 1031.03031Demri, Stéphane 2 2002 Automata-theoretic decision procedures for information logics. Zbl 1025.03021Demri, Stéphane; Sattler, Ulrike 1 2002 The complexity of regularity in grammar logics and related modal logics. Zbl 1002.03018Demri, Stéphane 8 2001 Complexity of simple dependent bimodal logics. Zbl 0963.03076Demri, Stéphane 3 2000 The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036Demri, Stéphane 2 2000 Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023Demri, Stéphane; Stepaniuk, Jarosław 2 2000 Display calculi for logics with relative accessibility relations. Zbl 0988.03030Demri, Stéphane; Goré, Rajeev 1 2000 An \({\mathcal O}((n\log n)^3)\)-time transformation from Grz into decidable fragments of classical first-order logic. Zbl 0956.03026Demri, Stéphane; Goré, Rajeev 1 2000 A simple modal encoding of propositional finite many-valued logics. Zbl 0992.03031Demri, Stéphane 1 2000 On modal logics characterized by models with relative accessibility relations. II. Zbl 0981.03031Demri, Stéphane; Gabbay, Dov 1 2000 A logic with relative knowledge operators. Zbl 0928.68107Demri, Stéphane 4 1999 Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031Demri, Stéphane 1 1999 Cut-free display calculi for nominal tense logics. Zbl 0931.03032Demri, Stéphane; Goré, Rajeev 1 1999 Informational representability of models for information logics. Zbl 0923.03039Demri, Stéphane; Orłowska, Ewa 1 1999 The complexity of propositional linear temporal logics in simple cases. (Extended abstract). Zbl 0919.03012Demri, S.; Schnoebelen, Ph. 4 1998 A class of decidable information logics. Zbl 0902.68062Demri, Stéphane 1 1998 A completeness proof for a logic with an alternative necessity operator. Zbl 0864.03012Demri, Stéphane 5 1997 The validity problem for the logic DALLA is decidable. Zbl 0847.03012Demri, Stéphane 3 1996 Logical analysis of demonic nondeterministic programs. Zbl 0872.03018Demri, Stéphane; Orłowska, Ewa 2 1996 A class of information logics with a decidable validity problem. Zbl 0886.03014Demri, Stéphane 1 1996 A simple tableau system for the logic of elsewhere. Zbl 1415.03021Demri, Stéphane 1 1996 Uniform and non uniform strategies for tableaux calculi for modal logics. Zbl 0826.03006Demri, Stéphane 4 1995 Towards reasoning about Hoare relations. Zbl 0858.68057Demri, Stéphane; Orlowska, Ewa; Rewitzky, Ingrid 1 1994 all cited Publications top 5 cited Publications all top 5 Cited by 468 Authors 29 Demri, Stéphane P. 10 Finkel, Alain 9 Schmitz, Sylvain 7 Bersani, Marcello Maria 7 Bozzelli, Laura 7 Khan, Md. Aquil 7 Lazić, Ranko 7 Montanari, Angelo 6 Bollig, Benedikt 6 Praveen, M. 6 Rossi, Matteo A. C. 6 Sangnier, Arnaud 5 Hofman, Piotr 5 Larchey-Wendling, Dominique 5 Leroux, Jérôme 5 Quaas, Karin 5 Szałas, Andrzej 4 Alechina, Natasha 4 Balbiani, Philippe 4 Czerwiński, Wojciech 4 Figueira, Diego 4 Järvinen, Jouni 4 Lange, Martin 4 Laroussinie, François 4 Lasota, Sławomir 4 Lozes, Etienne 4 Mansutti, Alessio 4 Nguyen, Linh Anh 4 Orłowska, Ewa S. 4 Pietro, Pierluigi San 4 Schnoebelen, Philippe 3 Banerjee, Mohua 3 Bednarczyk, Bartosz 3 Brochenin, Rémi 3 Deters, Morgan 3 Exibard, Léo 3 Filiot, Emmanuel 3 Goranko, Valentin F. 3 Goré, Rajeev Prabhakar 3 Gutierrez, Julian 3 Horrocks, Ian 3 Kamide, Norihiro 3 Leucker, Martin 3 Logan, Brian 3 Lohrey, Markus 3 Lück, Martin 3 Lutz, Carsten 3 Meyer, Roland 3 Michaliszyn, Jakub 3 Patel, Vineeta Singh 3 Radeleczki, Sándor 3 Ramanayake, Revantha 3 Reynier, Pierre-Alain 3 Saivasan, Prakash 3 Sala, Pietro 3 Schröder, Lutz 3 Tan, Tony 3 Totzke, Patrick 3 Wooldridge, Michael J. 3 Wu, Zhilin 2 Alur, Rajeev 2 Artale, Alessandro 2 Baader, Franz 2 Babari, Parvaneh 2 Bárcenas, Everardo 2 Benítez-Guerrero, Edgard 2 Boker, Udi 2 Boudou, Joseph 2 Bulling, Nils 2 Carapelle, Claudia 2 Chambart, Pierre 2 Chen, Taolue 2 Chini, Peter 2 Chistikov, Dmitry V. 2 Choffrut, Christian 2 Ciabattoni, Agata 2 de Rijke, Maarten 2 Decker, Normann 2 Dhar, Amit Kumar 2 Droste, Manfred 2 Dubois, Didier 2 Dunin-Kȩplicz, Barbara 2 Fervari, Raul 2 Galmiche, Didier 2 Gascon, Régis 2 Göller, Stefan 2 Grigorieff, Serge 2 Gutsfeld, Jens Oliver 2 Habermehl, Peter 2 Harrenstein, Paul 2 Herzig, Andreas 2 Hou, Zhe 2 Iosif, Radu 2 Kartzow, Alexander 2 Kirst, Dominik 2 Klaedtke, Felix 2 Klin, Bartek 2 Kontchakov, Roman 2 Krebs, Andreas 2 Kuusisto, Antti ...and 368 more Authors all top 5 Cited in 41 Serials 38 Theoretical Computer Science 20 Logical Methods in Computer Science 17 Information and Computation 13 Journal of Applied Non-Classical Logics 9 Artificial Intelligence 9 Journal of Computer and System Sciences 9 Journal of Automated Reasoning 8 International Journal of Approximate Reasoning 8 ACM Transactions on Computational Logic 7 Acta Informatica 7 Information Sciences 6 Journal of Applied Logic 4 Studia Logica 4 Annals of Pure and Applied Logic 4 International Journal of Foundations of Computer Science 3 Information Processing Letters 3 The Journal of Symbolic Logic 3 MSCS. Mathematical Structures in Computer Science 3 Theory of Computing Systems 3 The Journal of Logic and Algebraic Programming 3 The Review of Symbolic Logic 3 Journal of Logical and Algebraic Methods in Programming 2 Journal of Philosophical Logic 2 Algorithmica 2 Formal Methods in System Design 2 Journal of Logic, Language and Information 2 Fundamenta Informaticae 1 Algebra Universalis 1 Fuzzy Sets and Systems 1 Notre Dame Journal of Formal Logic 1 Programming and Computer Software 1 Synthese 1 Order 1 Journal of Symbolic Computation 1 Formal Aspects of Computing 1 Journal of Mathematical Sciences (New York) 1 Annals of Mathematics and Artificial Intelligence 1 Lobachevskii Journal of Mathematics 1 Logic and Logical Philosophy 1 Journal of Multiple-Valued Logic and Soft Computing 1 ACM Transactions on Computation Theory all top 5 Cited in 10 Fields 257 Computer science (68-XX) 190 Mathematical logic and foundations (03-XX) 10 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 8 Order, lattices, ordered algebraic structures (06-XX) 3 Combinatorics (05-XX) 1 General and overarching topics; collections (00-XX) 1 History and biography (01-XX) 1 General algebraic systems (08-XX) 1 Group theory and generalizations (20-XX) 1 Operations research, mathematical programming (90-XX) Citations by Year