default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTristan Charrier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j3]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Complexity of planning for connected agents. Auton. Agents Multi Agent Syst. 34(2): 44 (2020)- [j2]Thomas Bolander
, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
DEL-based epistemic planning: Decidability and complexity. Artif. Intell. 287: 103304 (2020)
2010 – 2019
- 2019
- [j1]Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
Symbolic model checking of public announcement protocols. J. Log. Comput. 29(8): 1211-1249 (2019) - [c11]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents. AAMAS 2019: 1874-1876 - [c10]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents. IJCAI 2019: 144-150 - [c9]Tristan Charrier, Sébastien Gamblin, Alexandre Niveau, François Schwarzentruber:
Hintikka's World: Scalable Higher-order Knowledge. IJCAI 2019: 6494-6496 - [i2]Tristan Charrier, Arthur Queffelec, Ocan Sankur, François Schwarzentruber:
Reachability and Coverage Planning for Connected Agents: Extended Version. CoRR abs/1903.04300 (2019) - 2018
- [b1]Tristan Charrier:
Theoretical complexity of reasoning in dynamicepistemic logic and study of a symbolic approach. (Complexité théorique du raisonnement en logique épistémique dynamique et étude d'une approche symbolique). University of Rennes 1, France, 2018 - [c8]Tristan Charrier, François Schwarzentruber:
Complexity of Dynamic Epistemic Logic with Common Knowledge. Advances in Modal Logic 2018: 103-122 - [c7]François Bodin, Tristan Charrier, Arthur Queffelec, François Schwarzentruber:
Generating Plans for Cooperative Connected UAVs. IJCAI 2018: 5811-5813 - [i1]Tristan Charrier, François Schwarzentruber, Eva Soulier:
Dynamic Connected Cooperative Coverage Problem. CoRR abs/1810.06213 (2018) - 2017
- [c6]Tristan Charrier, François Schwarzentruber:
A Succinct Language for Dynamic Epistemic Logic. AAMAS 2017: 123-131 - [c5]Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
Model Checking Against Arbitrary Public Announcement Logic: A First-Order-Logic Prover Approach for the Existential Fragment. DALI@TABLEAUX 2017: 133-152 - 2016
- [c4]Tristan Charrier, Bastien Maubert, François Schwarzentruber:
On the Impact of Modal Depth in Epistemic Planning. IJCAI 2016: 1030-1036 - [c3]Tristan Charrier, Andreas Herzig, Emiliano Lorini, Faustine Maffre, François Schwarzentruber:
Building Epistemic Logic from Observations and Public Announcements. KR 2016: 268-277 - 2015
- [c2]Tristan Charrier, François Schwarzentruber:
Arbitrary Public Announcement Logic with Mental Programs. AAMAS 2015: 1471-1479 - 2014
- [c1]Tristan Charrier, Florent Ouchet, François Schwarzentruber:
Big brother logic: reasoning about agents equipped with surveillance cameras in the plane (demonstration). AAMAS 2014: 1633-1634
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 2025-01-20 22:54 CET 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:
