| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rémi Brochenin, Stéphane Demri, Étienne Lozes |
On the almighty wand.  |
Inf. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcello M. Bersani, Stéphane Demri |
The Complexity of Reversal-Bounded Model-Checking. |
FroCos |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Darondeau, Stéphane Demri, Roland Meyer, Christophe Morvan |
Petri Net Reachability Graphs: Decidability Status of FO Properties. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, Arnaud Sangnier |
Model checking memoryful linear-time logics over one-counter automata. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen |
Model-checking CTL* over flat Presburger counter systems. |
Journal of Applied Non-Classical Logics |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Denis Lugiez |
Complexity of modal logics with Presburger constraints. |
J. Applied Logic |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
On Selective Unboundedness of VASS |
INFINITY |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Alexander Rabinovich |
The complexity of linear-time temporal logic over the class of ordinals |
Logical Methods in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Counter Systems for Data Logics. |
JELIA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Arnaud Sangnier |
When Model-Checking Freeze LTL over Counter Machines Becomes Decidable. |
FOSSACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Carlos Areces, Stéphane Demri |
Preface. |
Electr. Notes Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Régis Gascon |
The Effects of Bounding Syntactic Resources on Presburger LTL. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémi Brochenin, Stéphane Demri, Étienne Lozes |
Reasoning about sequences of memory states. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic |
LTL with the freeze quantifier and register automata. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, expressiveness |
| 1 | Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic |
The Covering and Boundedness Problems for Branching Vector Addition Systems. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Régis Gascon |
Verification of qualitative Z constraints. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, Arnaud Sangnier |
Model checking memoryful linear-time logics over one-counter automata |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Christian S. Jensen (eds.) |
15th International Symposium on Temporal Representation and Reasoning, TIME 2008, Université du Québec à Montréal, Canada, 16-18 June 2008 |
TIME |
2008 |
DBLP BibTeX RDF |
|
| 1 | Rémi Brochenin, Stéphane Demri, Étienne Lozes |
On the Almighty Wand. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, Arnaud Sangnier |
Model Checking Freeze LTL over One-Counter Automata. |
FoSSaCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, David Nowak |
Reasoning about Transfinite Sequences. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, David Nowak |
On the freeze quantifier in Constraint LTL: Decidability and complexity. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Deepak D'Souza |
An automata-theoretic approach to constraint LTL. |
Inf. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Relative Nondeterministic Information Logic is EXPTIME-complete. |
Fundam. Inform. |
2007 |
DBLP BibTeX RDF |
|
| 1 | Rémi Brochenin, Stéphane Demri, Étienne Lozes |
Reasoning About Sequences of Memory States. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Deepak D'Souza, Régis Gascon |
A Decidable Temporal Logic of Repeating Values. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Régis Gascon |
The Effects of Bounding Syntactic Resources on Presburger LTL. |
TIME |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Alexander Rabinovich |
The Complexity of Temporal Logic with Until and Since over Ordinals. |
LPAR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
LTL over integer periodicity constraints. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Linear-time temporal logics with Presburger constraints: an overview. |
Journal of Applied Non-Classical Logics |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, David Nowak |
On the freeze quantifier in Constraint LTL: decidability and complexity |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic |
LTL with the Freeze Quantifier and Register Automata |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, François Laroussinie, Ph. Schnoebelen |
A parametric analysis of the state-explosion problem in model checking. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Denis Lugiez |
Presburger Modal Logic Is PSPACE-Complete. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Alain Finkel, Valentin Goranko, Govert van Drimmelen |
Towards a Model-Checker for Counter Systems. |
ATVA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic |
LTL with the Freeze Quantifier and Register Automata. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Reduction from DLP to PDL. |
J. Log. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Hans de Nivelle |
Deciding Regular Grammar Logics with Converse Through First-Order Logic. |
Journal of Logic, Language and Information |
2005 |
DBLP DOI BibTeX RDF |
relational translation, 2-variable fragment, guarded fragment, modal and temporal logics |
| 1 | Stéphane Demri, David Nowak |
Reasoning about transfinite sequences |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Régis Gascon |
Verification of Qualitative Constraints. |
CONCUR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ranko Lazic, David Nowak |
On the Freeze Quantifier in Constraint LTL: Decidability and Complexity. |
TIME |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, David Nowak |
Reasoning About Transfinite Sequences. |
ATVA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
LTL over Integer Periodicity Constraints: (Extended Abstract). |
FoSSaCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A polynomial space construction of tree-like models for logics with local chains of modal connectives. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Natasha Alechina, Stéphane Demri, Maarten de Rijke |
A Modal Perspective on Path Constraints. |
J. Log. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Hans de Nivelle |
Deciding regular grammar logics with converse through first-order logic |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ph. Schnoebelen |
The Complexity of Propositional Linear Temporal Logics in Simple Cases. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Rajeev Goré |
Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics. |
J. Log. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Rajeev Goré |
Display Calculi for Nominal Tense Logics. |
J. Log. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ulrike Sattler |
Automata-Theoretic Decision Procedures for Information Logics. |
Fundam. Inform. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Incomplete Information: Structure, Inference, Complexity |
|
2002 |
RDF |
|
| 1 | Stéphane Demri, François Laroussinie, Ph. Schnoebelen |
A Parametric Analysis of the State Explosion Problem in Model Checking. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Deepak D'Souza |
An Automata-Theoretic Approach to Constraint LTL. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
The Complexity of Regularity in Grammar Logics and Related Modal Logics. |
J. Log. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Natasha Alechina, Stéphane Demri, Maarten de Rijke |
Path Constraints from a Modal Logic Point of View. |
KRDB |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Dov M. Gabbay |
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part II. |
Studia Logica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Dov M. Gabbay |
On Modal Logics Characterized by Models with Relative Accessibility Relations: Part I. |
Studia Logica |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Rajeev Goré |
Display Calculi for Logics with Relative Accessibility Relations. |
Journal of Logic, Language and Information |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Jaroslaw Stepaniuk |
Computational Complexity of Multimodal Logics Based on Rough Sets. |
Fundam. Inform. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri |
The Nondeterministic Information Logic NIL is PSPACE-complete. |
Fundam. Inform. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Modal Logics with Weak Forms of Recursion: PSPACE Specimens. |
Advances in Modal Logic |
2000 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri |
Complexity of Simple Dependent Bimodal Logics. |
TABLEAUX |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of [diams]-Formulae. |
Studia Logica |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Logic with Relative Knowledge Operators. |
Journal of Logic, Language and Information |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Rajeev Goré |
Tractable Transformations from Modal Provability Logics into First-Order Logic. |
CADE |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Rajeev Goré |
Cut-Free Display Calculi for Nominal Tense Logics. |
TABLEAUX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? |
TABLEAUX |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Class of Decidable Information Logics. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ph. Schnoebelen |
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract). |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Classes of modal frames definable by closure relational operations. |
RelMiCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri |
Coping with semilattices of relations in logics with relative accessibility relations. |
RelMiCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Beata Konikowska |
Relative Similarity Logics are Decidable: Reduction to FO2 with Equality. |
JELIA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Completeness Proof for a Logic with an Alternative Necessity Operator. |
Studia Logica |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Philippe Balbiani, Stéphane Demri |
Prefixed Tableaux Systems for Modal Logics with Enriched Languages. |
IJCAI |
1997 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Reasoning with Relational Demonic Operators. |
RelMiCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska |
Logical Analysis of Demonic Nondeterministic Programs. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Class of Information Logics with a Decidable Validity Problem. |
MFCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
A Simple Tableau System for the Logic of Elsewhere. |
TABLEAUX |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
3-SAT=SAT for a Class of Normal Modal Logics. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics. |
Journal of Applied Non-Classical Logics |
1995 |
DBLP BibTeX RDF |
|
| 1 | Thierry Boy de la Tour, Stéphane Demri |
On the Complexity of Extending Ground Resolution with Symmetry Rules. |
IJCAI |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri |
A Hierarchy of Backward Translations: Applications to Modal Logics. |
WOCFAI |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri |
Using Connection Method in Modal Logics: Some Advantages. |
TABLEAUX |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stéphane Demri, Ewa Orlowska, Ingrid Rewitzky |
Towards Reasoning about Hoare Relations. |
Ann. Math. Artif. Intell. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Demri |
Efficient Strategies for Automated Reasoning in Modal Logics. |
JELIA |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo Caferra, Stéphane Demri, Michel Herment |
A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics. |
Studia Logica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ricardo Caferra, Stéphane Demri |
Cooperation between Direct Method and Translation Method in Non Classical Logics: Some Results in Propositional S5. |
IJCAI |
1993 |
DBLP BibTeX RDF |
|
| 1 | Ricardo Caferra, Stéphane Demri |
Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. |
CADE |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")