The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stéphane Demri: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stéphane Demri
    Coping with semilattices of relations in logics with relative accessibility relations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:43-47 [Conf]
  2. Stéphane Demri, Ewa Orlowska
    Reasoning with Relational Demonic Operators. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1997, pp:331-340 [Conf]
  3. Stéphane Demri, Ewa Orlowska
    Classes of modal frames definable by closure relational operations. [Citation Graph (0, 0)][DBLP]
    RelMiCS, 1998, pp:48-52 [Conf]
  4. Ricardo Caferra, Stéphane Demri, Michel Herment
    Logic Morphisms as a Framework for Backward Transfer of Lemmas and Strategies in Some Modal and Epistemic Logics. [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:421-426 [Conf]
  5. Stéphane Demri
    Modal Logics with Weak Forms of Recursion: PSPACE Specimens. [Citation Graph (0, 0)][DBLP]
    Advances in Modal Logic, 2000, pp:113-138 [Conf]
  6. Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen
    Towards a Model-Checker for Counter Systems. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:493-507 [Conf]
  7. Stéphane Demri, David Nowak
    Reasoning About Transfinite Sequences. [Citation Graph (0, 0)][DBLP]
    ATVA, 2005, pp:248-262 [Conf]
  8. Stéphane Demri, Rajeev Goré
    Tractable Transformations from Modal Provability Logics into First-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1999, pp:16-30 [Conf]
  9. Stéphane Demri, Denis Lugiez
    Presburger Modal Logic Is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:541-556 [Conf]
  10. Ricardo Caferra, Stéphane Demri
    Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:385-399 [Conf]
  11. Stéphane Demri, Régis Gascon
    Verification of Qualitative Constraints. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:518-532 [Conf]
  12. Stéphane Demri
    LTL over Integer Periodicity Constraints: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:121-135 [Conf]
  13. Stéphane Demri, Deepak D'Souza
    An Automata-Theoretic Approach to Constraint LTL. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2002, pp:121-132 [Conf]
  14. Stéphane Demri, Rajeev Goré
    An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:152-166 [Conf]
  15. Philippe Balbiani, Stéphane Demri
    Prefixed Tableaux Systems for Modal Logics with Enriched Languages. [Citation Graph (0, 0)][DBLP]
    IJCAI (1), 1997, pp:190-195 [Conf]
  16. Ricardo Caferra, Stéphane Demri
    Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1993, pp:74-79 [Conf]
  17. Thierry Boy de la Tour, Stéphane Demri
    On the Complexity of Extending Ground Resolution with Symmetry Rules. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:289-297 [Conf]
  18. Stéphane Demri
    Efficient Strategies for Automated Reasoning in Modal Logics. [Citation Graph (0, 0)][DBLP]
    JELIA, 1994, pp:182-197 [Conf]
  19. Stéphane Demri, Beata Konikowska
    Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. [Citation Graph (0, 0)][DBLP]
    JELIA, 1998, pp:279-293 [Conf]
  20. Natasha Alechina, Stéphane Demri, Maarten de Rijke
    Path Constraints from a Modal Logic Point of View. [Citation Graph (0, 0)][DBLP]
    KRDB, 2001, pp:- [Conf]
  21. Stéphane Demri, Ranko Lazic
    LTL with the Freeze Quantifier and Register Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2006, pp:17-26 [Conf]
  22. Stéphane Demri
    A Class of Information Logics with a Decidable Validity Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:291-302 [Conf]
  23. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A Parametric Analysis of the State Explosion Problem in Model Checking. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:620-631 [Conf]
  24. Stéphane Demri, Ph. Schnoebelen
    The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:61-72 [Conf]
  25. Stéphane Demri
    Complexity of Simple Dependent Bimodal Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 2000, pp:190-204 [Conf]
  26. Stéphane Demri
    Using Connection Method in Modal Logics: Some Advantages. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1995, pp:63-78 [Conf]
  27. Stéphane Demri
    A Simple Tableau System for the Logic of Elsewhere. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1996, pp:177-192 [Conf]
  28. Stéphane Demri
    Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:140-154 [Conf]
  29. Stéphane Demri, Rajeev Goré
    Cut-Free Display Calculi for Nominal Tense Logics. [Citation Graph (0, 0)][DBLP]
    TABLEAUX, 1999, pp:155-170 [Conf]
  30. Stéphane Demri, Ranko Lazic, David Nowak
    On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. [Citation Graph (0, 0)][DBLP]
    TIME, 2005, pp:113-121 [Conf]
  31. Stéphane Demri
    A Hierarchy of Backward Translations: Applications to Modal Logics. [Citation Graph (0, 0)][DBLP]
    WOCFAI, 1995, pp:121-132 [Conf]
  32. Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky
    Towards Reasoning about Hoare Relations. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1994, v:12, n:3-4, pp:265-289 [Journal]
  33. Stéphane Demri, Hans de Nivelle
    Deciding regular grammar logics with converse through first-order logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  34. Stéphane Demri
    The Nondeterministic Information Logic NIL is PSPACE-complete. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:42, n:3-4, pp:211-234 [Journal]
  35. Stéphane Demri, Jaroslaw Stepaniuk
    Computational Complexity of Multimodal Logics Based on Rough Sets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2000, v:44, n:4, pp:373-396 [Journal]
  36. Stéphane Demri, Ulrike Sattler
    Automata-Theoretic Decision Procedures for Information Logics. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:53, n:1, pp:1-22 [Journal]
  37. Stéphane Demri, Ewa Orlowska
    Relative Nondeterministic Information Logic is EXPTIME-complete. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:75, n:1-4, pp:163-178 [Journal]
  38. Stéphane Demri, Ph. Schnoebelen
    The Complexity of Propositional Linear Temporal Logics in Simple Cases. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:1, pp:84-103 [Journal]
  39. Stéphane Demri, Ranko Lazic, David Nowak
    On the freeze quantifier in Constraint LTL: Decidability and complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:1, pp:2-24 [Journal]
  40. Stéphane Demri, David Nowak
    Reasoning about Transfinite Sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2007, v:18, n:1, pp:87-112 [Journal]
  41. Stéphane Demri
    3-SAT=SAT for a Class of Normal Modal Logics. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:5, pp:281-287 [Journal]
  42. Stéphane Demri
    Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 1995, v:5, n:1, pp:- [Journal]
  43. Stéphane Demri, François Laroussinie, Ph. Schnoebelen
    A parametric analysis of the state-explosion problem in model checking. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:4, pp:547-575 [Journal]
  44. Stéphane Demri
    A Logic with Relative Knowledge Operators. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 1999, v:8, n:2, pp:167-185 [Journal]
  45. Stéphane Demri, Rajeev Goré
    Display Calculi for Logics with Relative Accessibility Relations. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2000, v:9, n:2, pp:213-236 [Journal]
  46. Stéphane Demri, Hans de Nivelle
    Deciding Regular Grammar Logics with Converse Through First-Order Logic. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2005, v:14, n:3, pp:289-329 [Journal]
  47. Natasha Alechina, Stéphane Demri, Maarten de Rijke
    A Modal Perspective on Path Constraints. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:6, pp:939-956 [Journal]
  48. Stéphane Demri
    The Complexity of Regularity in Grammar Logics and Related Modal Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2001, v:11, n:6, pp:933-960 [Journal]
  49. Stéphane Demri
    A Reduction from DLP to PDL. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:5, pp:767-785 [Journal]
  50. Stéphane Demri, Rajeev Goré
    Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:5, pp:861-884 [Journal]
  51. Stéphane Demri, Rajeev Goré
    Display Calculi for Nominal Tense Logics. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:6, pp:993-1016 [Journal]
  52. Ricardo Caferra, Stéphane Demri, Michel Herment
    A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1993, v:52, n:2, pp:197-232 [Journal]
  53. Stéphane Demri
    A Completeness Proof for a Logic with an Alternative Necessity Operator. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1997, v:58, n:1, pp:99-112 [Journal]
  54. Stéphane Demri, Dov M. Gabbay
    On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2000, v:66, n:3, pp:349-384 [Journal]
  55. Stéphane Demri, Dov M. Gabbay
    On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2000, v:65, n:3, pp:323-353 [Journal]
  56. Stéphane Demri, Ewa Orlowska
    Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of [diams]-Formulae. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:62, n:2, pp:177-200 [Journal]
  57. Stéphane Demri
    A polynomial space construction of tree-like models for logics with local chains of modal connectives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:235-258 [Journal]
  58. Stéphane Demri
    LTL over integer periodicity constraints. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:96-123 [Journal]
  59. Stéphane Demri
    A Class of Decidable Information Logics. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:195, n:1, pp:33-60 [Journal]
  60. Stéphane Demri, Ewa Orlowska
    Logical Analysis of Demonic Nondeterministic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:166, n:1&2, pp:173-202 [Journal]
  61. Rémi Brochenin, Stéphane Demri, Étienne Lozes
    Reasoning About Sequences of Memory States. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:100-114 [Conf]
  62. Stéphane Demri, Deepak D'Souza, Régis Gascon
    A Decidable Temporal Logic of Repeating Values. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:180-194 [Conf]
  63. Stéphane Demri, Alexander Rabinovich
    The Complexity of Temporal Logic with Until and Since over Ordinals. [Citation Graph (0, 0)][DBLP]
    LPAR, 2007, pp:531-545 [Conf]
  64. Stéphane Demri, Régis Gascon
    The Effects of Bounding Syntactic Resources on Presburger LTL. [Citation Graph (0, 0)][DBLP]
    TIME, 2007, pp:94-104 [Conf]
  65. Stéphane Demri, Ranko Lazic
    LTL with the Freeze Quantifier and Register Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  66. Stéphane Demri, Ranko Lazic, David Nowak
    On the freeze quantifier in Constraint LTL: decidability and complexity [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  67. Stéphane Demri, Deepak D'Souza
    An automata-theoretic approach to constraint LTL. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:3, pp:380-415 [Journal]

  68. On the Almighty Wand. [Citation Graph (, )][DBLP]


  69. Model Checking Freeze LTL over One-Counter Automata. [Citation Graph (, )][DBLP]


  70. When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. [Citation Graph (, )][DBLP]


  71. The Covering and Boundedness Problems for Branching Vector Addition Systems. [Citation Graph (, )][DBLP]


  72. Counter Systems for Data Logics. [Citation Graph (, )][DBLP]


  73. Reasoning about sequences of memory states. [Citation Graph (, )][DBLP]


  74. Reasoning about transfinite sequences [Citation Graph (, )][DBLP]


  75. Model checking memoryful linear-time logics over one-counter automata [Citation Graph (, )][DBLP]


  76. Preface. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002