About: Stéphane P. Demri

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Stéphane P. Demri Goto Sponge NotDistinct Permalink

An Entity of Type : foaf:Person, within Data Space : data.idref.fr associated with source document(s)

Attributes	Values
type	Person
sameAs	Demri, Stéphane P. (1967-.... ; informaticien) Demri, Stéphane P. (1967-.... ; informaticien) Demri, Stéphane P. (1967-.... ; informaticien) Demri, Stéphane P. (1967-.... ; informaticien)
alternative label	Demri, Stéphane
Life Event	http://www.idref.fr/070195684/birth
preferred label	Demri, Stéphane P. (1967-.... ; informaticien)
name	Stéphane P. Demri
dbpedia-owl:citizenship	http://sws.geonames.org/3017382/
Language	http://lexvo.org/id/iso639-3/fra
isni:identifierValid	0000000114364962
Given name	Stéphane P.
familyName	Demri
note	Membre du laboratoire Spécification et Vérification (CNRS UMR 8643) à L'Ecole Normale Supérieure de Cachan (France) et du Laboratoire Leibniz à Grenoble (France). Mars 2003. Directeur de recherche, CNRS, Université Paris-Saclay (en 2022) Auteur d'une thèse de doctorat en informatique (Grenoble INPG, 1994)
gender	male
ORCID iD	0000-0002-3493-2610
Scopus ID	55886490100
is sameAs of	Demri, Stéphane P. (1967-.... ; informaticien) Demri, Stéphane P. (1967-.... ; informaticien) Demri, Stéphane P. (1967-.... ; informaticien)
is Thesis advisor of	Spécification et vérification de propriétés quantitatives sur des automates à contraintes http://www.sudoc.fr/162406649/id http://www.sudoc.fr/144816431/id http://www.sudoc.fr/176735232/id http://www.sudoc.fr/185958516/id http://www.sudoc.fr/13706246X/id Towards Synthesizing Open Systems, Tableaux For Multi-Agent Temporal Logics http://www.sudoc.fr/248067613/id http://www.sudoc.fr/252257294/id Algorithms for model-checking flat counter systems http://www.sudoc.fr/247122165/id
is Author of	http://www.sudoc.fr/070170657/id http://www.sudoc.fr/126101558/id Logical Analysis of Demonic NonDeterministic Programs Coping with Semilattices of Relations in Logics with Relative Accessibility Relations On the Complexity of Extending Ground Resolution with Symmetry Rules Logic morphisms as a framework for the backward transfer of lemmas and strategies in some modal and epistemic logics Petri Net Reachability Graphs: Decidability Status of First Order Properties Verification of Infinite-State Systems The Complexity of Regularity in Grammar Logics and Related Modal Logics Display Calculi for Logics with Relative Accessibility Relations A Hierarchy of Backward Translations: Applications to Modal Logics Logical analysis of indiscernibility The Nondeterministic Information Logic NIL is PSPACE-complete The complexity of propositional linear temporal logics in simple cases Constraint Automata on Infinite Data Trees: from CTL(ℤ)/ CTL*(ℤ) to Decision Procedures Separation Logic with One Quantified Variable A Class of Decidable Information Logics Complexity of Simple Dependent Bimodal Logics On Symbolic Heaps Modulo Permission Theories The validity problem for the logic DALLA is decidable Informational representability of models for information logics Finite model property for a logic for data analysis A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics Separation Logic with One Quantified Variable A Simple Modal Encoding of Propositional Finite Many-Valued Logics A Modal Perspective on Path Constraints Efficient strategies for Automated reasoning in modal logics Presburger Modal Logic Is PSPACE-Complete http://www.sudoc.fr/233066845/id Theoremhood-preserving Maps Characterizing Cut Elimination for Modal Provability Logics A Completeness Proof for a Logic with an Alternative Necessity Operator Using connection method in modal logics: Some advantages Complexity of Modal Logics with Presburger Constraints Automated Reasoning – Seventh International Joint Conference (IJCAR 2014) Computational Complexity of Multimodal Logics Based on Rough Sets Approches directe et par traduction en logiques modales, nouvelles stratégies et traduction inverse de preuves Towards reasoning about Hoare relations Towards Reasoning about Hoare Relations Sequent Calculi for Nominal Tense Logics: A Step Towards Mechanization? Uniform and Non Uniform Strategies for Tableaux Calculi for Modal Logics 3-SAT = SAT for a class of normal modal logics Logique et Formalisation du Raisonnement cours de DEA partie II -Logiques Non Classiques A simple tableau system for the logic of elsewhere Approches directe et par traduction en logiques modales: nouvelles stratégies et traduction inverse de preuves Taming Past LTL and Flat Counter Systems A Logic with Relative Knowledge Operators Prefixed Tableaux Systems for Modal Logics with Enriched Languages Every Finitely Reducible Logic has the Finite Model Property with Respect to the Class of Diamond-Formulae Display Calculi for Nominal Tense Logics Extensions of modal logic S5 preserving NP-completeness A class of information logics with a decidable validity problem A Reduction from DLP to PDL Methods for Modalities 2007 Complementarity Relations: Reduction of Decision Rules and Informational Representability Resolution for Weak Modal Logics Strategic Reasoning with a Bounded Number of Resources: the Quest for Tractability http://www.sudoc.fr/247048690/id The Effects of Bounding Syntactic Resources on Presburger LTL Petri Net Reachability Graphs: Decidability Status of FO Properties A framework for the transfer of proofs, lemmas and strategies from classical to non classical logics Indiscernibility and complementarity relations in information systems Relative Similarity Logics are Decidable: Reduction to FO2 with Equality An O((n.log n) 3 )-time transformation from Grz into decidable fragments of classical first-order logic Cooperation between direct method and translation method in non classical logics : some results in propositional S5 Cut-Free Display Calculi for Nominal Tense Logics Tractable Transformations from Modal Provability Logics into First-Order Logic Informational representability: Abstract models versus concrete models.

Faceted Search & Find service v1.13.91 as of Aug 16 2018

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software