default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarie Fortin
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. DLT 2024: 51-67- [i11]Amazigh Amrane, Hugo Bazille, Uli Fahrenberg, Marie Fortin:
Logic and Languages of Higher-Dimensional Automata. CoRR abs/2403.19526 (2024) - 2023
- [c12]Marie Fortin, Boris Konev
, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev:
Reverse Engineering of Temporal Queries Mediated by LTL Ontologies. IJCAI 2023: 3230-3238 - [i10]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Highly Undecidable, HyperCTL* is Even Harder. CoRR abs/2303.16699 (2023) - [i9]Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev:
Reverse Engineering of Temporal Queries Mediated by LTL Ontologies. CoRR abs/2305.01248 (2023) - 2022
- [c11]Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev:
Reverse Engineering of Temporal Queries with and without LTL Ontologies: First Steps (Extended Abstract). Description Logics 2022 - [c10]Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev:
Unique Characterisability and Learnability of Temporal Instance Queries. KR 2022 - [c9]Marie Fortin, Boris Konev, Frank Wolter:
Interpolants and Explicit Definitions in Extensions of the Description Logic EL. KR 2022 - [i8]Marie Fortin, Boris Konev, Frank Wolter:
Interpolants and Explicit Definitions in Extensions of the Description Logic EL. CoRR abs/2202.07186 (2022) - [i7]Marie Fortin, Boris Konev, Vladislav Ryzhikov, Yury Savateev, Frank Wolter, Michael Zakharyaschev:
Unique Characterisability and Learnability of Temporal Instance Queries. CoRR abs/2205.01651 (2022) - 2021
- [j1]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic. J. Comput. Syst. Sci. 115: 22-53 (2021) - [c8]Marie Fortin, Boris Konev, Frank Wolter:
Interpolants and Explicit Definitions in Horn Description Logics (Extended Abstract). Description Logics 2021 - [c7]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. MFCS 2021: 47:1-47:19 - [i6]Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann:
HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete. CoRR abs/2105.04176 (2021) - 2020
- [b1]Marie Fortin:
Expressivité de la logique du premier ordre, de la logique dynamique propositionnelle sans étoile et des automates communicants. (Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata). University of Paris-Saclay, France, 2020
2010 – 2019
- 2019
- [c6]Marie Fortin:
FO = FO3 for Linear Orders with Monotone Binary Relations. ICALP 2019: 116:1-116:13 - [i5]Marie Fortin:
FO = FO3 for linear orders with monotone binary relations. CoRR abs/1904.00189 (2019) - 2018
- [c5]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CONCUR 2018: 7:1-7:17 - [c4]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. STACS 2018: 17:1-17:14 - [i4]Benedikt Bollig, Marie Fortin, Paul Gastin:
Gossiping in Message-Passing Systems. CoRR abs/1802.08641 (2018) - [i3]Benedikt Bollig, Marie Fortin, Paul Gastin:
It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with "Happened Before". CoRR abs/1804.10076 (2018) - 2017
- [c3]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
Model-Checking Linear-Time Properties of Parametrized Asynchronous Shared-Memory Pushdown Systems. CAV (2) 2017: 155-175 - [i2]Benedikt Bollig, Marie Fortin, Paul Gastin:
Communicating Finite-State Machines and Two-Variable Logic. CoRR abs/1709.09991 (2017) - 2016
- [c2]Marie Fortin, Paul Gastin:
Verification of Parameterized Communicating Automata via Split-Width. FoSSaCS 2016: 197-213 - [i1]Marie Fortin, Anca Muscholl, Igor Walukiewicz:
On parametrized verification of asynchronous, shared-memory pushdown systems. CoRR abs/1606.08707 (2016) - 2014
- [c1]Marie Fortin, Marcello M. Bonsangue, Jan Rutten:
Coalgebraic Semantics of Heavy-Weighted Automata. WADT 2014: 48-68
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 2024-10-07 21:20 CEST 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:
