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