Edit Profile Demri, Stéphane P. Compute Distance To: Compute Author ID: demri.stephane-p Published as: Demri, S.; Demri, Stephane; Demri, Stéphane; Demri, Stéphane P. Documents Indexed: 114 Publications since 1992, including 5 Books all top 5 Co-Authors 23 single-authored 9 Orłowska, Ewa S. 8 Deters, Morgan 8 Sangnier, Arnaud 6 Goré, Rajeev Prabhakar 6 Lazić, Ranko 6 Lozes, Etienne 5 Dhar, Amit Kumar 5 Gascon, Régis 4 Brochenin, Rémi 4 D’Souza, Deepak 3 Alechina, Natasha 3 Fervari, Raul 3 Finkel, Alain 3 Goranko, Valentin F. 3 Lugiez, Denis 3 Nowak, David E. 3 Schnoebelen, Philippe 2 Barrett, Clark W. 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 Mansutti, Alessio 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 M. 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 Schnoebelen, Ph 1 Stepaniuk, Jarosław all top 5 Serials 9 Journal of Logic and Computation 8 Theoretical Computer Science 5 Studia Logica 5 Information and Computation 5 Fundamenta Informaticae 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 3 Logical Methods in Computer Science 2 Bulletin of the Section of Logic 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 95 Mathematical logic and foundations (03-XX) 90 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 82 Publications have been cited 380 times in 233 Documents Cited by ▼ Year ▼ LTL with the freeze quantifier and register automata. Zbl 1351.68158Demri, Stéphane; Lazić, Ranko 37 2009 The complexity of propositional linear temporal logics in simple cases. Zbl 1009.68072Demri, Stéphane; Schnoebelen, Philippe 24 2002 Incomplete information: Structure, inference, complexity. Zbl 1016.68163Demri, Stéphane P.; Orłowska, Ewa S. 22 2002 An automata-theoretic approach to constraint LTL. Zbl 1113.03015Demri, Stéphane; D’Souza, Deepak 17 2007 On the almighty wand. Zbl 1262.03051Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 11 2012 On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014Demri, Stéphane; Lazić, Ranko; Nowak, David 11 2007 The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033Demri, Stéphane; Gascon, Régis 10 2009 Deciding regular grammar logics with converse through first-order logic. Zbl 1083.03023Demri, Stéphane; de Nivelle, Hans 10 2005 A modal perspective on path constraints. Zbl 1093.68032Alechina, Natasha; Demri, Stéphane; de Rijke, Maarten 10 2003 Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert 9 2010 Towards a model-checker for counter systems. Zbl 1161.68563Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G. 8 2006 The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 7 2013 On the almighty wand. Zbl 1157.03010Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 7 2008 LTL over integer periodicity constraints. Zbl 1097.68073Demri, Stéphane 7 2006 The complexity of regularity in grammar logics and related modal logics. Zbl 1002.03018Demri, Stéphane 7 2001 Temporal logics in computer science. Finite-state systems. Zbl 1380.68003Demri, Stéphane; Goranko, Valentin; Lange, Martin 6 2016 Separation logic with one quantified variable. Zbl 1408.68036Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 6 2014 On selective unboundedness of VASS. Zbl 1285.68094Demri, Stéphane 6 2013 When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394Demri, Stéphane; Sangnier, Arnaud 6 2010 Presburger modal logic is PSPACE-complete. Zbl 1222.03024Demri, Stéphane; Lugiez, Denis 6 2006 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1134.68405Demri, Stéphane; Gascon, Régis 6 2005 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053Demri, Stephane; Deters, Morgan 5 2016 Reasoning about data repetitions with counter systems. Zbl 1366.68202Demri, Stéphane; Figueira, Diego; Praveen, M. 5 2013 Reasoning about sequences of memory states. Zbl 1225.68068Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 5 2009 A reduction from DLP to PDL. Zbl 1092.03016Demri, Stéphane 5 2005 An automata-theoretic approach to constraint LTL. Zbl 1027.03027Demri, Stéphane; D’Souza, Deepak 5 2002 A completeness proof for a logic with an alternative necessity operator. Zbl 0864.03012Demri, Stéphane 5 1997 Two-variable separation logic and its inner circle. Zbl 1354.03036Demri, Stéphane; Deters, Morgan 4 2015 Taming past LTL and flat counter systems. Zbl 1378.68112Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 4 2015 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048Demri, Stéphane; Gascon, Régis 4 2008 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 Uniform and non uniform strategies for tableaux calculi for modal logics. Zbl 0826.03006Demri, Stéphane 4 1995 Separation logics and modalities: a survey. Zbl 1398.03151Demri, Stéphane; Deters, Morgan 3 2015 Equivalence between model-checking flat counter systems and Presburger arithmetic. Zbl 1393.68101Demri, Stéphane; Dhar, Amit; Sangnier, Arnaud 3 2014 On the complexity of verifying regular properties on flat counter systems. Zbl 1334.68130Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2013 Automata-based computation of temporal equilibrium models. Zbl 1377.68060Cabalar, Pedro; Demri, Stéphane 3 2012 Temporal logics of repeating values. Zbl 1279.68203Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 3 2012 Taming past LTL and flat counter systems. Zbl 1358.68186Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2012 Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 3 2010 Linear-time temporal logics with Presburger constraints: an overview. Zbl 1186.03036Demri, Stéphane 3 2006 LTL over integer periodicity constraints (extended abstract). Zbl 1126.68471Demri, Stéphane 3 2004 A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557Demri, S.; Laroussinie, F.; Schnoebelen, P. 3 2002 Display calculi for nomial tense logics. Zbl 1016.03018Demri, Stéphane; Goré, Rajeev 3 2002 Theoremhood-preserving maps characterizing cut elimination for modal provability logics. Zbl 1006.03036Demri, Stéphane; Goré, Rajeev 3 2002 The validity problem for the logic DALLA is decidable. Zbl 0847.03012Demri, Stéphane 3 1996 On the complexity of resource-bounded logics. Zbl 1403.68137Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian 2 2016 Temporal logics on strings with prefix relation. Zbl 1353.68176Demri, Stéphane; Deters, Morgan 2 2016 Reasoning about data repetitions with counter systems. Zbl 1448.68339Demri, Stéphane; Figueira, Diego; Praveen, M. 2 2016 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1394.03054Demri, Stéphane; Deters, Morgan 2 2014 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 The complexity of reversal-bounded model-checking. Zbl 1348.68121Bersani, Marcello M.; Demri, Stéphane 2 2011 Complexity of modal logics with Presburger constraints. Zbl 1220.03008Demri, Stéphane; Lugiez, Denis 2 2010 The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308Demri, Stéphane; Rabinovich, Alexander 2 2007 A decidable temporal logic of repeating values. Zbl 1132.03337Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 2 2007 Reasoning about sequences of memory states. Zbl 1132.68335Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 2 2007 A parametric analysis of the state-explosion problem in model checking. Zbl 1094.68056Demri, S.; Laroussinie, F.; Schnoebelen, Ph. 2 2006 Modal logics with weak forms of recursion: PSPACE specimens. Zbl 1031.03031Demri, Stéphane 2 2002 Complexity of simple dependent bimodal logics. Zbl 0963.03076Demri, Stéphane 2 2000 Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023Demri, Stéphane; Stepaniuk, Jarosław 2 2000 The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036Demri, Stéphane 2 2000 A logic with relative knowledge operators. Zbl 0928.68107Demri, Stéphane 2 1999 Logical analysis of demonic nondeterministic programs. Zbl 0872.03018Demri, Stéphane; Orłowska, Ewa 2 1996 Specification and verification using temporal logics. Zbl 1256.68101Demri, Stéphane; Gastin, Paul 1 2012 Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2012 The covering and boundedness problems for branching vector addition systems. Zbl 1248.68202Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 1 2009 Reasoning about transfinite sequences. Zbl 1109.68065Demri, Stéphane; Nowak, David 1 2007 Reasoning about transfinite sequences. (Extended abstract). Zbl 1170.68513Demri, Stéphane; Nowak, David 1 2005 A polynomial space construction of tree-like models for logics with local chains of modal connectives. Zbl 1028.68064Demri, Stéphane 1 2003 Automata-theoretic decision procedures for information logics. Zbl 1025.03021Demri, Stéphane; Sattler, Ulrike 1 2002 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 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 Display calculi for logics with relative accessibility relations. Zbl 0988.03030Demri, Stéphane; Goré, Rajeev 1 2000 Cut-free display calculi for nominal tense logics. Zbl 0931.03032Demri, Stéphane; Goré, Rajeev 1 1999 Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031Demri, Stéphane 1 1999 Informational representability of models for information logics. Zbl 0923.03039Demri, Stéphane; Orłowska, Ewa 1 1999 A class of decidable information logics. Zbl 0902.68062Demri, Stéphane 1 1998 A simple tableau system for the logic of elsewhere. Zbl 1415.03021Demri, Stéphane 1 1996 A class of information logics with a decidable validity problem. Zbl 0886.03014Demri, Stéphane 1 1996 Towards reasoning about Hoare relations. Zbl 0858.68057Demri, Stéphane; Orlowska, Ewa; Rewitzky, Ingrid 1 1994 Temporal logics in computer science. Finite-state systems. Zbl 1380.68003Demri, Stéphane; Goranko, Valentin; Lange, Martin 6 2016 Expressive completeness of separation logic with two variables and no separating conjunction. Zbl 1367.03053Demri, Stephane; Deters, Morgan 5 2016 On the complexity of resource-bounded logics. Zbl 1403.68137Alechina, Natasha; Bulling, Nils; Demri, Stephane; Logan, Brian 2 2016 Temporal logics on strings with prefix relation. Zbl 1353.68176Demri, Stéphane; Deters, Morgan 2 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 4 2015 Taming past LTL and flat counter systems. Zbl 1378.68112Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 4 2015 Separation logics and modalities: a survey. Zbl 1398.03151Demri, Stéphane; Deters, Morgan 3 2015 Separation logic with one quantified variable. Zbl 1408.68036Demri, Stéphane; Galmiche, Didier; Larchey-Wendling, Dominique; Méry, Daniel 6 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 2 2014 The covering and boundedness problems for branching vector addition systems. Zbl 1260.68264Demri, Stéphane; Jurdziński, Marcin; Lachish, Oded; Lazić, Ranko 7 2013 On selective unboundedness of VASS. Zbl 1285.68094Demri, Stéphane 6 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 11 2012 Automata-based computation of temporal equilibrium models. Zbl 1377.68060Cabalar, Pedro; Demri, Stéphane 3 2012 Temporal logics of repeating values. Zbl 1279.68203Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 3 2012 Taming past LTL and flat counter systems. Zbl 1358.68186Demri, Stéphane; Dhar, Amit Kumar; Sangnier, Arnaud 3 2012 Specification and verification using temporal logics. Zbl 1256.68101Demri, Stéphane; Gastin, Paul 1 2012 Petri net reachability graphs: decidability status of first order properties. Zbl 1248.68324Darondeau, Philippe; Demri, Stéphane; Meyer, Roland; Morvan, Christophe 1 2012 The complexity of reversal-bounded model-checking. Zbl 1348.68121Bersani, Marcello M.; Demri, Stéphane 2 2011 Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems. Zbl 1242.68157Demri, Stéphane; Finkel, Alain; Goranko, Valentin; van Drimmelen, Govert 9 2010 When model-checking freeze LTL over counter machines becomes decidable. Zbl 1284.68394Demri, Stéphane; Sangnier, Arnaud 6 2010 Model checking memoryful linear-time logics over one-counter automata. Zbl 1334.68131Demri, Stéphane; Lazić, Ranko; Sangnier, Arnaud 3 2010 Complexity of modal logics with Presburger constraints. Zbl 1220.03008Demri, Stéphane; Lugiez, Denis 2 2010 LTL with the freeze quantifier and register automata. Zbl 1351.68158Demri, Stéphane; Lazić, Ranko 37 2009 The effects of bounding syntactic resources on Presburger LTL. Zbl 1193.03033Demri, Stéphane; Gascon, Régis 10 2009 Reasoning about sequences of memory states. Zbl 1225.68068Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 5 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 7 2008 Verification of qualitative \(\mathbb Z\) constraints. Zbl 1157.68048Demri, Stéphane; Gascon, Régis 4 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 17 2007 On the freeze quantifier in Constraint LTL: Decidability and complexity. Zbl 1116.03014Demri, Stéphane; Lazić, Ranko; Nowak, David 11 2007 The complexity of temporal logic with until and since over ordinals. Zbl 1137.03308Demri, Stéphane; Rabinovich, Alexander 2 2007 A decidable temporal logic of repeating values. Zbl 1132.03337Demri, Stéphane; D’Souza, Deepak; Gascon, Régis 2 2007 Reasoning about sequences of memory states. Zbl 1132.68335Brochenin, Rémi; Demri, Stéphane; Lozes, Etienne 2 2007 Reasoning about transfinite sequences. Zbl 1109.68065Demri, Stéphane; Nowak, David 1 2007 Towards a model-checker for counter systems. Zbl 1161.68563Demri, S.; Finkel, A.; Goranko, V.; van Drimmelen, G. 8 2006 LTL over integer periodicity constraints. Zbl 1097.68073Demri, Stéphane 7 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 10 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 3 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 24 2002 Incomplete information: Structure, inference, complexity. Zbl 1016.68163Demri, Stéphane P.; Orłowska, Ewa S. 22 2002 An automata-theoretic approach to constraint LTL. Zbl 1027.03027Demri, Stéphane; D’Souza, Deepak 5 2002 A parametric analysis of the state explosion problem in model checking. Zbl 1054.68557Demri, S.; Laroussinie, F.; Schnoebelen, P. 3 2002 Display calculi for nomial tense logics. Zbl 1016.03018Demri, Stéphane; Goré, Rajeev 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 7 2001 Complexity of simple dependent bimodal logics. Zbl 0963.03076Demri, Stéphane 2 2000 Computational complexity of multimodal logics based on rough sets. Zbl 0971.03023Demri, Stéphane; Stepaniuk, Jarosław 2 2000 The nondeterministic information logic NIL is PSPACE-complete. Zbl 0953.03036Demri, Stéphane 2 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 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 Display calculi for logics with relative accessibility relations. Zbl 0988.03030Demri, Stéphane; Goré, Rajeev 1 2000 A logic with relative knowledge operators. Zbl 0928.68107Demri, Stéphane 2 1999 Cut-free display calculi for nominal tense logics. Zbl 0931.03032Demri, Stéphane; Goré, Rajeev 1 1999 Sequent calculi for nominal tense logics: A step towards mechanization? Zbl 0931.03031Demri, Stéphane 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 simple tableau system for the logic of elsewhere. Zbl 1415.03021Demri, Stéphane 1 1996 A class of information logics with a decidable validity problem. Zbl 0886.03014Demri, 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 371 Authors 25 Demri, Stéphane P. 7 Bersani, Marcello M. 7 Finkel, Alain 6 Bozzelli, Laura 6 Praveen, M. 6 Rossi, Matteo A. C. 6 Sangnier, Arnaud 6 Schmitz, Sylvain 5 Lazić, Ranko 5 Nguyen, Linh Anh 5 Pietro, Pierluigi San 5 Schnoebelen, Philippe 4 Balbiani, Philippe 4 Bollig, Benedikt 4 Hofman, Piotr 4 Khan, Md. Aquil 4 Laroussinie, François 4 Montanari, Angelo 4 Orłowska, Ewa S. 4 Szałas, Andrzej 3 Alechina, Natasha 3 Banerjee, Mohua 3 Brochenin, Rémi 3 Deters, Morgan 3 Figueira, Diego 3 Goranko, Valentin F. 3 Goré, Rajeev Prabhakar 3 Horrocks, Ian 3 Järvinen, Jouni 3 Kamide, Norihiro 3 Lange, Martin 3 Larchey-Wendling, Dominique 3 Leroux, Jérôme 3 Leucker, Martin 3 Lohrey, Markus 3 Lozes, Etienne 3 Lück, Martin 3 Lutz, Carsten 3 Meyer, Roland 3 Quaas, Karin 3 Ramanayake, Revantha 3 Saivasan, Prakash 3 Schnoebelen, Ph 3 Schröder, Lutz 3 Tan, Tony 3 Totzke, Patrick 3 Wu, Zhilin 2 Alur, Rajeev 2 Babari, Parvaneh 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 Czerwiński, Wojciech 2 de Rijke, Maarten 2 Decker, Normann 2 Dhar, Amit Kumar 2 Droste, Manfred 2 Dubois, Didier 2 Dunin-Kȩplicz, Barbara 2 Galmiche, Didier 2 Gascon, Régis 2 Göller, Stefan 2 Grigorieff, Serge 2 Gutierrez, Julian 2 Habermehl, Peter 2 Harrenstein, Paul 2 Herzig, Andreas 2 Hou, Zhe 2 Iosif, Radu 2 Kartzow, Alexander 2 Klaedtke, Felix 2 Krebs, Andreas 2 Kuusisto, Antti 2 Lodaya, Kamal 2 Logan, Brian 2 Markey, Nicolas 2 Meier, Arne 2 Motik, Boris 2 Ouaknine, Joel O. 2 Pattinson, Dirk 2 Pazzaglia, Marco 2 Perevoshchikov, Vitaly 2 Pilipczuk, Michał 2 Pinchinat, Sophie 2 Rabinovich, Alexander 2 Radeleczki, Sándor 2 Radmacher, Frank G. 2 Roveri, Marco 2 Sala, Pietro 2 Sattler, Ulrike 2 Schallhart, Christian 2 Schindler, Irena 2 Schwentick, Thomas ...and 271 more Authors all top 5 Cited in 38 Serials 35 Theoretical Computer Science 14 Information and Computation 12 Journal of Applied Non-Classical Logics 10 Logical Methods in Computer Science 8 Journal of Computer and System Sciences 8 ACM Transactions on Computational Logic 7 Artificial Intelligence 6 Acta Informatica 6 Journal of Automated Reasoning 6 Journal of Applied Logic 5 Information Sciences 5 International Journal of Approximate Reasoning 4 Studia Logica 4 International Journal of Foundations of Computer Science 3 Information Processing Letters 3 The Journal of Symbolic Logic 3 Annals of Pure and Applied Logic 3 The Journal of Logic and Algebraic Programming 3 The Review of Symbolic Logic 2 Journal of Philosophical Logic 2 Algorithmica 2 MSCS. Mathematical Structures in Computer Science 2 Formal Methods in System Design 2 Journal of Logic, Language and Information 2 Theory of Computing Systems 2 Journal of Logical and Algebraic Methods in Programming 1 Algebra Universalis 1 Fuzzy Sets and Systems 1 Notre Dame Journal of Formal Logic 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 ACM Transactions on Computation Theory all top 5 Cited in 10 Fields 196 Computer science (68-XX) 155 Mathematical logic and foundations (03-XX) 7 Order, lattices, ordered algebraic structures (06-XX) 6 Game theory, economics, finance, and other social and behavioral sciences (91-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