( en | de | ru )

 

Disambiguation of "Demri, Stéphane"

Author of the publication

copydeleteadd this publication to your clipboard
On the Complexity of Resource-Bounded Logics.

, , , and . RP, volume 9899 of Lecture Notes in Computer Science, page 36-50. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stéphane Müller

Stéphane Haussler

Stéphane Klein

Stéphane Aubry

Stéphane Audière

 

Other publications of authors with the same name

Reasoning About Transfinite Sequences., and . ATVA, volume 3707 of Lecture Notes in Computer Science, page 248-262. Springer, (2005)Axiomatising Logics with Separating Conjunction and Modalities., , and . JELIA, volume 11468 of Lecture Notes in Computer Science, page 692-708. Springer, (2019)Relative Similarity Logics are Decidable: Reduction to FO2 with Equality., and . JELIA, volume 1489 of Lecture Notes in Computer Science, page 279-293. Springer, (1998)Counter Systems for Data Logics.. JELIA, volume 6341 of Lecture Notes in Computer Science, page 10. Springer, (2010)Model-Checking Bounded Multi-Pushdown Systems., and . CSR, volume 7913 of Lecture Notes in Computer Science, page 405-417. Springer, (2013)Using Connection Method in Modal Logics: Some Advantages.. TABLEAUX, volume 918 of Lecture Notes in Computer Science, page 63-78. Springer, (1995)Prefixed Tableaux Systems for Modal Logics with Enriched Languages., and . IJCAI (1), page 190-195. Morgan Kaufmann, (1997)A Complete Axiomatisation for Quantifier-Free Separation Logic., , and . CoRR, (2020)A Completeness Proof for a Logic with an Alternative Necessity Operator.. Stud Logica, 58 (1): 99-112 (1997)Computational Complexity of Multimodal Logics Based on Rough Sets., and . Fundam. Informaticae, 44 (4): 373-396 (2000)