Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Schwarzentruber, François
339  Ergebnisse:
Personensuche X
?
1

Base-Based Model Checking for Multi-agent only Believing:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,
Lima, Tiago de ; Lorini, Emiliano ; Schwarzentruber, François - p. 437-445 , 2023
Link: https://doi.org/10.1007/..
 
?
2

Qualitative Uncertainty Reasoning in AgentSpeak:

, In: Multi-Agent Systems; Lecture Notes in Computer Science,
Vezina, Michael ; Esfandiari, Babak ; Morley, Sandra. - p. 32-48 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Complexity of planning for connected agents in a partially ..:

Queffelec, Arthur ; Sankur, Ocan ; Schwarzentruber, François
Theoretical Computer Science.  941 (2023)  - p. 202-220 , 2023
Link: https://doi.org/10.1016/..
 
?
4

A Computationally Grounded Logic of Graded Belief:

, In: Logics in Artificial Intelligence; Lecture Notes in Computer Science,
Lorini, Emiliano ; Schwarzentruber, François - p. 245-261 , 2021
Link: https://doi.org/10.1007/..
 
?
5

Copy and remove as dynamic operators:

Areces, Carlos ; van Ditmarsch, Hans ; Fervari, Raul..
Journal of Applied Non-Classical Logics.  31 (2021)  3-4 - p. 181-220 , 2021
Link: https://doi.org/10.1080/..
 
?
6

Knowledge-based programs as succinct policies for partially..:

Zanuttini, Bruno ; Lang, Jérôme ; Saffidine, Abdallah.
Artificial Intelligence.  288 (2020)  - p. 103365 , 2020
Link: https://doi.org/10.1016/..
 
?
7

Library-Based Attack Tree Synthesis:

, In: Graphical Models for Security; Lecture Notes in Computer Science,
Pinchinat, Sophie ; Schwarzentruber, François ; Lê Cong, Sébastien - p. 24-44 , 2020
Link: https://doi.org/10.1007/..
 
?
8

DEL-based epistemic planning: Decidability and complexity:

Bolander, Thomas ; Charrier, Tristan ; Pinchinat, Sophie.
Artificial Intelligence.  287 (2020)  - p. 103304 , 2020
Link: https://doi.org/10.1016/..
 
?
9

Complexity of planning for connected agents:

Charrier, Tristan ; Queffelec, Arthur ; Sankur, Ocan.
Autonomous Agents and Multi-Agent Systems.  34 (2020)  2 - p. , 2020
Link: https://doi.org/10.1007/..
 
?
10

Symbolic model checking of public announcement protocols:

Charrier, Tristan ; Pinchinat, Sophie ; Schwarzentruber, FranÇois
Journal of Logic and Computation.  29 (2019)  8 - p. 1211-1249 , 2019
Link: https://doi.org/10.1093/..
 
?
11

Reachability and Coverage Planning for Connected Agents:

, In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems,
Charrier, Tristan ; Queffelec, Arthur ; Sankur, Ocan. - p. 1874-1876 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

Deciding the Non-emptiness of Attack Trees:

, In: Graphical Models for Security; Lecture Notes in Computer Science,
Audinot, Maxime ; Pinchinat, Sophie ; Schwarzentruber, François. - p. 13-30 , 2019
Link: https://doi.org/10.1007/..
 
?
13

Dynamic Gossip:

van Ditmarsch, Hans ; van Eijck, Jan ; Pardo, Pere..
Bulletin of the Iranian Mathematical Society.  45 (2018)  3 - p. 701-728 , 2018
Link: https://doi.org/10.1007/..
 
?
14

A Succinct Language for Dynamic Epistemic Logic:

, In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems,
Charrier, Tristan ; Schwarzentruber, François - p. 123-131 , 2017
Link: https://dl.acm.org/doi/1..
 
?
15

Reasoning about knowledge and messages in asynchronous mult..:

KNIGHT, SOPHIA ; MAUBERT, BASTIEN ; SCHWARZENTRUBER, FRANÇOIS
Mathematical Structures in Computer Science.  29 (2017)  1 - p. 127-168 , 2017
Link: https://doi.org/10.1017/..
 
1-15