default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStéphane Demri
Person information
- affiliation: CNRS, Laboratoire Méthodes Formelles (LMF), France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c74]Stéphane Demri, Przemyslaw Andrzej Walega:
Computational Complexity of Standpoint LTL. ECAI 2024: 1206-1213- [i15]Stéphane Demri, Przemyslaw Andrzej Walega:
Computational Complexity of Standpoint LTL. CoRR abs/2408.08557 (2024) - 2023
- [j62]Bartosz Bednarczyk
, Stéphane Demri, Raul Fervari, Alessio Mansutti:
On Composing Finite Forests with Modal Logics. ACM Trans. Comput. Log. 24(2): 12:1-12:46 (2023) - [c73]Stéphane Demri, Raul Fervari:
Model-Checking for Ability-Based Logics with Constrained Plans. AAAI 2023: 6305-6312 - [c72]Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL^*}(ℤ) to Decision Procedures. CONCUR 2023: 29:1-29:18 - [c71]Stéphane Demri, Karin Quaas:
First Steps Towards Taming Description Logics with Strings. JELIA 2023: 322-337 - [c70]Stéphane Demri, Raine Rönnholm:
How to Manage a Budget with ATL+. KR 2023: 188-197 - [i14]Stéphane Demri, Karin Quaas:
Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures. CoRR abs/2302.05327 (2023) - 2022
- [j61]Bartosz Bednarczyk, Stéphane Demri:
Why Does Propositional Quantification Make Modal and Temporal Logics on Trees Robustly Hard? Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [j60]Francesco Belardinelli, Stéphane Demri:
Strategic reasoning with a bounded number of resources: The quest for tractability. Artif. Intell. 300: 103557 (2021) - [j59]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. Log. Methods Comput. Sci. 17(3) (2021) - [j58]Stéphane Demri, Raul Fervari, Alessio Mansutti:
Internal proof calculi for modal logics with separating conjunction. J. Log. Comput. 31(3): 832-891 (2021) - [j57]Stéphane Demri, Karin Quaas:
Concrete domains in logics: a survey. ACM SIGLOG News 8(3): 6-29 (2021) - [j56]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Quantifier-Free Separation Logic. ACM Trans. Comput. Log. 22(2): 14:1-14:56 (2021) - [i13]Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard? CoRR abs/2104.13122 (2021) - 2020
- [c69]Natasha Alechina, Stéphane Demri, Brian Logan:
Parameterised Resource-Bounded ATL. AAAI 2020: 7040-7046 - [c68]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CSL 2020: 19:1-19:18 - [c67]Francesco Belardinelli, Stéphane Demri:
Reasoning with a Bounded Number of Resources in ATL+. ECAI 2020: 624-631 - [c66]Bartosz Bednarczyk, Stéphane Demri, Alessio Mansutti:
A Framework for Reasoning about Dynamic Axioms in Description Logics. IJCAI 2020: 1681-1687 - [c65]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity. LICS 2020: 167-180 - [i12]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
A Complete Axiomatisation for Quantifier-Free Separation Logic. CoRR abs/2006.05156 (2020) - [i11]Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti:
Modal Logics with Composition on Finite Forests: Expressivity and Complexity (Extra Material). CoRR abs/2007.08598 (2020)
2010 – 2019
- 2019
- [j55]Stéphane Demri, Raul Fervari:
The power of modal separation logics. J. Log. Comput. 29(8): 1139-1184 (2019) - [c64]Francesco Belardinelli, Stéphane Demri:
Resource-bounded ATL: the Quest for Tractable Fragments. AAMAS 2019: 206-214 - [c63]Stéphane Demri, Raul Fervari, Alessio Mansutti:
Axiomatising Logics with Separating Conjunction and Modalities. JELIA 2019: 692-708 - [c62]Bartosz Bednarczyk, Stéphane Demri:
Why Propositional Quantification Makes Modal Logics on Trees Robustly Hard? LICS 2019: 1-13 - [i10]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
Internal Calculi for Separation Logics. CoRR abs/1910.05016 (2019) - 2018
- [j54]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Equivalence between model-checking flat counter systems and Presburger arithmetic. Theor. Comput. Sci. 735: 2-23 (2018) - [j53]Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan:
On the complexity of resource-bounded logics. Theor. Comput. Sci. 750: 69-100 (2018) - [c61]Stéphane Demri, Raul Fervari:
On the Complexity of Modal Separation Logics. Advances in Modal Logic 2018: 179-198 - [c60]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. FoSSaCS 2018: 476-493 - [c59]Stéphane Demri:
On Temporal and Separation Logics (Invited Paper). TIME 2018: 1:1-1:4 - [i9]Stéphane Demri, Étienne Lozes, Alessio Mansutti:
The Effects of Adding Reachability Predicates in Propositional Separation Logic. CoRR abs/1810.05410 (2018) - 2017
- [j52]Stéphane Demri, Deepak Kapur, Christoph Weidenbach:
Preface - Special Issue of Selected Extended Papers of IJCAR 2014. J. Autom. Reason. 58(1): 1-2 (2017) - [j51]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. Theory Comput. Syst. 61(2): 371-461 (2017) - [c58]Stéphane Demri, Étienne Lozes, Denis Lugiez:
On Symbolic Heaps Modulo Permission Theories. FSTTCS 2017: 25:1-25:14 - 2016
- [b4]Stéphane Demri, Valentin Goranko, Martin Lange:
Temporal Logics in Computer Science: Finite-State Systems. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press 2016, ISBN 9781107028364 - [j50]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. Log. Methods Comput. Sci. 12(3) (2016) - [j49]Parosh Aziz Abdulla, Stéphane Demri, Alain Finkel, Jérôme Leroux, Igor Potapov:
Preface. Fundam. Informaticae 143(3-4): i-ii (2016) - [j48]Stéphane Demri, Morgan Deters:
Temporal logics on strings with prefix relation. J. Log. Comput. 26(3): 989-1017 (2016) - [j47]Stéphane Demri, Morgan Deters:
Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction. ACM Trans. Comput. Log. 17(2): 12 (2016) - [c57]Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan:
On the Complexity of Resource-Bounded Logics. RP 2016: 36-50 - [e4]Lev D. Beklemishev, Stéphane Demri, András Maté:
Advances in Modal Logic 11, proceedings of the 11th conference on "Advances in Modal Logic," held in Budapest, Hungary, August 30 - September 2, 2016. College Publications 2016, ISBN 978-1-84890-201-5 [contents] - 2015
- [j46]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Taming past LTL and flat counter systems. Inf. Comput. 242: 306-339 (2015) - [j45]Stéphane Demri, Morgan Deters:
Separation logics and modalities: a survey. J. Appl. Non Class. Logics 25(1): 50-99 (2015) - [j44]Stéphane Demri, Morgan Deters:
Two-Variable Separation Logic and Its Inner Circle. ACM Trans. Comput. Log. 16(2): 15:1-15:36 (2015) - 2014
- [c56]Stéphane Demri, Morgan Deters:
The Effects of Modalities in Separation Logics (Extended Abstract). Advances in Modal Logic 2014: 134-138 - [c55]Stéphane Demri, Morgan Deters:
Expressive completeness of separation logic with two variables and no separating conjunction. CSL-LICS 2014: 37:1-37:10 - [c54]Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry:
Separation Logic with One Quantified Variable. CSR 2014: 125-138 - [c53]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic. RP 2014: 85-97 - [e3]Stéphane Demri, Deepak Kapur, Christoph Weidenbach:
Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 19-22, 2014. Proceedings. Lecture Notes in Computer Science 8562, Springer 2014, ISBN 978-3-319-08586-9 [contents] - 2013
- [j43]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The covering and boundedness problems for branching vector addition systems. J. Comput. Syst. Sci. 79(1): 23-38 (2013) - [j42]Stéphane Demri:
On selective unboundedness of VASS. J. Comput. Syst. Sci. 79(5): 689-713 (2013) - [c52]Kshitij Bansal, Stéphane Demri:
Model-Checking Bounded Multi-Pushdown Systems. CSR 2013: 405-417 - [c51]Clark W. Barrett, Stéphane Demri, Morgan Deters:
Witness Runs for Counter Machines. FroCos 2013: 120-150 - [c50]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
On the Complexity of Verifying Regular Properties on Flat Counter Systems, . ICALP (2) 2013: 162-173 - [c49]Stéphane Demri, Diego Figueira, M. Praveen:
Reasoning about Data Repetitions with Counter Systems. LICS 2013: 33-42 - [c48]Clark W. Barrett, Stéphane Demri, Morgan Deters:
Witness Runs for Counter Machines - (Abstract). TABLEAUX 2013: 1-4 - [i8]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
On the Complexity of Verifying Regular Properties on Flat Counter Systems. CoRR abs/1304.6301 (2013) - 2012
- [j41]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan:
Petri Net Reachability Graphs: Decidability Status of First Order Properties. Log. Methods Comput. Sci. 8(4) (2012) - [j40]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
On the almighty wand. Inf. Comput. 211: 106-137 (2012) - [j39]Stéphane Demri, Deepak D'Souza, Régis Gascon:
Temporal Logics of Repeating Values. J. Log. Comput. 22(5): 1059-1096 (2012) - [c47]Facundo Carreiro, Stéphane Demri:
Beyond Regularity for Presburger Modal Logic. Advances in Modal Logic 2012: 161-182 - [c46]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Taming Past LTL and Flat Counter Systems. IJCAR 2012: 179-193 - [p1]Stéphane Demri, Paul Gastin:
Specification and Verification using Temporal Logics. Modern Applications of Automata Theory 2012: 457-494 - [i7]Stéphane Demri, Amit Kumar Dhar, Arnaud Sangnier:
Taming Past LTL and Flat Counter Systems. CoRR abs/1205.6584 (2012) - [i6]Kshitij Bansal, Stéphane Demri:
A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems. CoRR abs/1212.1485 (2012) - 2011
- [c45]Marcello M. Bersani, Stéphane Demri:
The Complexity of Reversal-Bounded Model-Checking. FroCoS 2011: 71-86 - [c44]Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan:
Petri Net Reachability Graphs: Decidability Status of FO Properties. FSTTCS 2011: 140-151 - [c43]Pedro Cabalar, Stéphane Demri:
Automata-Based Computation of Temporal Equilibrium Models. LOPSTR 2011: 57-72 - 2010
- [j38]Stéphane Demri, Alexander Rabinovich:
The complexity of linear-time temporal logic over the class of ordinals. Log. Methods Comput. Sci. 6(4) (2010) - [j37]Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen:
Model-checking CTL* over flat Presburger counter systems. J. Appl. Non Class. Logics 20(4): 313-344 (2010) - [j36]Stéphane Demri, Denis Lugiez:
Complexity of modal logics with Presburger constraints. J. Appl. Log. 8(3): 233-252 (2010) - [j35]Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
Model checking memoryful linear-time logics over one-counter automata. Theor. Comput. Sci. 411(22-24): 2298-2316 (2010) - [c42]Stéphane Demri, Arnaud Sangnier:
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. FoSSaCS 2010: 176-190 - [c41]Stéphane Demri:
Counter Systems for Data Logics. JELIA 2010: 10 - [c40]Stéphane Demri:
On Selective Unboundedness of VASS. INFINITY 2010: 1-15
2000 – 2009
- 2009
- [j34]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
Reasoning about sequences of memory states. Ann. Pure Appl. Log. 161(3): 305-323 (2009) - [j33]Stéphane Demri, Régis Gascon:
The Effects of Bounding Syntactic Resources on Presburger LTL. J. Log. Comput. 19(6): 1541-1575 (2009) - [j32]Stéphane Demri, Ranko Lazic:
LTL with the freeze quantifier and register automata. ACM Trans. Comput. Log. 10(3): 16:1-16:30 (2009) - [c39]Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic:
The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192 - [e2]Carlos Areces, Stéphane Demri:
Proceedings of the 5th Workshop on Methods for Modalities, M4M 2007, Cachan, France, November 29-30, 2007. Electronic Notes in Theoretical Computer Science 231, Elsevier 2009 [contents] - 2008
- [j31]Stéphane Demri, Régis Gascon:
Verification of qualitative Z constraints. Theor. Comput. Sci. 409(1): 24-40 (2008) - [c38]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
On the Almighty Wand. CSL 2008: 323-338 - [c37]Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
Model Checking Freeze LTL over One-Counter Automata. FoSSaCS 2008: 490-504 - [e1]Stéphane Demri, Christian S. Jensen:
15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Montréal, Canada, 16-18 June 2008. IEEE Computer Society 2008, ISBN 978-0-7695-3181-6 [contents] - [i5]Stéphane Demri, Ranko Lazic, Arnaud Sangnier:
Model checking memoryful linear-time logics over one-counter automata. CoRR abs/0810.5517 (2008) - 2007
- [b3]Stéphane Demri:
Logiques pour la spécification et vérification. Paris Diderot University, France, 2007 - [j30]Stéphane Demri, Ewa Orlowska:
Relative Nondeterministic Information Logic is EXPTIME-complete. Fundam. Informaticae 75(1-4): 163-178 (2007) - [j29]Stéphane Demri, Ranko Lazic, David Nowak:
On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205(1): 2-24 (2007) - [j28]Stéphane Demri, Deepak D'Souza:
An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3): 380-415 (2007) - [j27]Stéphane Demri, David Nowak:
Reasoning about Transfinite Sequences. Int. J. Found. Comput. Sci. 18(1): 87-112 (2007) - [c36]Rémi Brochenin, Stéphane Demri, Étienne Lozes:
Reasoning About Sequences of Memory States. LFCS 2007: 100-114 - [c35]Stéphane Demri, Deepak D'Souza, Régis Gascon:
A Decidable Temporal Logic of Repeating Values. LFCS 2007: 180-194 - [c34]Stéphane Demri, Alexander Rabinovich:
The Complexity of Temporal Logic with Until and Since over Ordinals. LPAR 2007: 531-545 - [c33]Stéphane Demri, Régis Gascon:
The Effects of Bounding Syntactic Resources on Presburger LTL. TIME 2007: 94-104 - [c32]Carlos Areces, Stéphane Demri:
Preface. M4M 2007: 1-2 - 2006
- [j26]Stéphane Demri:
Linear-time temporal logics with Presburger constraints: an overview. J. Appl. Non Class. Logics 16(3-4): 311-348 (2006) - [j25]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A parametric analysis of the state-explosion problem in model checking. J. Comput. Syst. Sci. 72(4): 547-575 (2006) - [j24]Stéphane Demri:
LTL over integer periodicity constraints. Theor. Comput. Sci. 360(1-3): 96-123 (2006) - [c31]Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen:
Towards a Model-Checker for Counter Systems. ATVA 2006: 493-507 - [c30]Stéphane Demri, Denis Lugiez:
Presburger Modal Logic Is PSPACE-Complete. IJCAR 2006: 541-556 - [c29]Stéphane Demri, Ranko Lazic:
LTL with the Freeze Quantifier and Register Automata. LICS 2006: 17-26 - [i4]Stéphane Demri, Ranko Lazic, David Nowak:
On the freeze quantifier in Constraint LTL: decidability and complexity. CoRR abs/cs/0609008 (2006) - [i3]Stéphane Demri, Ranko Lazic:
LTL with the Freeze Quantifier and Register Automata. CoRR abs/cs/0610027 (2006) - 2005
- [j23]Stéphane Demri, Hans de Nivelle:
Deciding Regular Grammar Logics with Converse Through First-Order Logic. J. Log. Lang. Inf. 14(3): 289-329 (2005) - [j22]Stéphane Demri:
A Reduction from DLP to PDL. J. Log. Comput. 15(5): 767-785 (2005) - [c28]Stéphane Demri, David Nowak:
Reasoning About Transfinite Sequences. ATVA 2005: 248-262 - [c27]Stéphane Demri, Régis Gascon:
Verification of Qualitative Constraints. CONCUR 2005: 518-532 - [c26]Stéphane Demri, Ranko Lazic, David Nowak:
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. TIME 2005: 113-121 - [i2]Stéphane Demri, David Nowak:
Reasoning about transfinite sequences. CoRR abs/cs/0505073 (2005) - 2004
- [c25]Stéphane Demri:
LTL over Integer Periodicity Constraints: (Extended Abstract). FoSSaCS 2004: 121-135 - 2003
- [j21]Natasha Alechina, Stéphane Demri, Maarten de Rijke:
A Modal Perspective on Path Constraints. J. Log. Comput. 13(6): 939-956 (2003) - [j20]Stéphane Demri:
A polynomial space construction of tree-like models for logics with local chains of modal connectives. Theor. Comput. Sci. 300(1-3): 235-258 (2003) - [i1]Stéphane Demri, Hans de Nivelle:
Deciding regular grammar logics with converse through first-order logic. CoRR cs.LO/0306117 (2003) - 2002
- [b2]Stéphane Demri, Ewa Orlowska:
Incomplete Information: Structure, Inference, Complexity. Monographs in Theoretical Computer Science. An EATCS Series, Springer 2002, ISBN 3-540-41904-7, pp. I-XVIII, 1-408 - [j19]Stéphane Demri, Ulrike Sattler:
Automata-Theoretic Decision Procedures for Information Logics. Fundam. Informaticae 53(1): 1-22 (2002) - [j18]Stéphane Demri, Philippe Schnoebelen:
The Complexity of Propositional Linear Temporal Logics in Simple Cases. Inf. Comput. 174(1): 84-103 (2002) - [j17]Stéphane Demri, Rajeev Goré:
Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. J. Log. Comput. 12(5): 861-884 (2002) - [j16]Stéphane Demri, Rajeev Goré:
Display Calculi for Nominal Tense Logics. J. Log. Comput. 12(6): 993-1016 (2002) - [c24]Stéphane Demri, Deepak D'Souza:
An Automata-Theoretic Approach to Constraint LTL. FSTTCS 2002: 121-132 - [c23]Stéphane Demri, François Laroussinie, Philippe Schnoebelen:
A Parametric Analysis of the State Explosion Problem in Model Checking. STACS 2002: 620-631 - 2001
- [j15]Stéphane Demri:
The Complexity of Regularity in Grammar Logics and Related Modal Logics. J. Log. Comput. 11(6): 933-960 (2001) - [c22]Natasha Alechina, Stéphane Demri, Maarten de Rijke:
Path Constraints from a Modal Logic Point of View. KRDB 2001 - 2000
- [j14]Stéphane Demri:
The Nondeterministic Information Logic NIL is PSPACE-complete. Fundam. Informaticae 42(3-4): 211-234 (2000) - [j13]Stéphane Demri, Jaroslaw Stepaniuk:
Computational Complexity of Multimodal Logics Based on Rough Sets. Fundam. Informaticae 44(4): 373-396 (2000) - [j12]Stéphane Demri, Rajeev Goré:
Display Calculi for Logics with Relative Accessibility Relations. J. Log. Lang. Inf. 9(2): 213-236 (2000) - [j11]Stéphane Demri, Dov M. Gabbay:
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. Stud Logica 65(3): 323-353 (2000) - [j10]Stéphane Demri, Dov M. Gabbay:
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. Stud Logica 66(3): 349-384 (2000) - [c21]Stéphane Demri:
Modal Logics with Weak Forms of Recursion: PSPACE Specimens. Advances in Modal Logic 2000: 113-138 - [c20]Stéphane Demri:
Complexity of Simple Dependent Bimodal Logics. TABLEAUX 2000: 190-204
1990 – 1999
- 1999
- [j9]Stéphane Demri:
A Logic with Relative Knowledge Operators. J. Log. Lang. Inf. 8(2): 167-185 (1999) - [j8]Stéphane Demri, Ewa Orlowska:
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of [diams]-Formulae. Stud Logica 62(2): 177-200 (1999) - [c19]Stéphane Demri, Rajeev Goré:
Tractable Transformations from Modal Provability Logics into First-Order Logic. CADE 1999: 16-30 - [c18]Stéphane Demri:
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? TABLEAUX 1999: 140-154 - [c17]Stéphane Demri, Rajeev Goré:
Cut-Free Display Calculi for Nominal Tense Logics. TABLEAUX 1999: 155-170 - 1998
- [j7]Stéphane Demri:
A Class of Decidable Information Logics. Theor. Comput. Sci. 195(1): 33-60 (1998) - [c16]Stéphane Demri:
Coping with semilattices of relations in logics with relative accessibility relations. RelMiCS 1998: 43-47 - [c15]Stéphane Demri, Ewa Orlowska:
Classes of modal frames definable by closure relational operations. RelMiCS 1998: 48-52 - [c14]Stéphane Demri, Rajeev Goré:
An O ((n·log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic. FTP (LNCS Selection) 1998: 152-166 - [c13]Stéphane Demri, Beata Konikowska:
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. JELIA 1998: 279-293 - [c12]Stéphane Demri, Philippe Schnoebelen:
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). STACS 1998: 61-72 - 1997
- [j6]Stéphane Demri:
A Completeness Proof for a Logic with an Alternative Necessity Operator. Stud Logica 58(1): 99-112 (1997) - [c11]Stéphane Demri, Ewa Orlowska:
Reasoning with Relational Demonic Operators. RelMiCS 1997: 331-340 - [c10]Philippe Balbiani, Stéphane Demri:
Prefixed Tableaux Systems for Modal Logics with Enriched Languages. IJCAI (1) 1997: 190-195 - 1996
- [j5]Stéphane Demri, Ewa Orlowska:
Logical Analysis of Demonic Nondeterministic Programs. Theor. Comput. Sci. 166(1&2): 173-202 (1996) - [c9]Stéphane Demri:
A Class of Information Logics with a Decidable Validity Problem. MFCS 1996: 291-302 - [c8]Stéphane Demri:
A Simple Tableau System for the Logic of Elsewhere. TABLEAUX 1996: 177-192 - 1995
- [j4]Stéphane Demri:
3-SAT=SAT for a Class of Normal Modal Logics. Inf. Process. Lett. 54(5): 281-287 (1995) - [j3]Stéphane Demri:
Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. J. Appl. Non Class. Logics 5(1): 77-96 (1995) - [c7]Thierry Boy de la Tour, Stéphane Demri:
On the Complexity of Extending Ground Resolution with Symmetry Rules. IJCAI 1995: 289-297 - [c6]Stéphane Demri:
Using Connection Method in Modal Logics: Some Advantages. TABLEAUX 1995: 63-78 - [c5]Stéphane Demri:
A Hierarchy of Backward Translations: Applications to Modal Logics. WOCFAI 1995: 121-132 - 1994
- [b1]Stéphane Demri:
Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuves. Grenoble Institute of Technology, France, 1994 - [j2]Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky:
Towards Reasoning about Hoare Relations. Ann. Math. Artif. Intell. 12(3-4): 265-289 (1994) - [c4]Stéphane Demri:
Efficient Strategies for Automated Reasoning in Modal Logics. JELIA 1994: 182-197 - 1993
- [j1]Ricardo Caferra, Stéphane Demri, Michel Herment:
A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. Stud Logica 52(2): 197-232 (1993) - [c3]Ricardo Caferra, Stéphane Demri:
Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. IJCAI 1993: 74-79 - 1992
- [c2]Ricardo Caferra, Stéphane Demri:
Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. CADE 1992: 385-399 - 1991
- [c1]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. AAAI 1991: 421-426
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
