33 citations · 65 across the 13 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 2 cited
The Packed Interval Covering Problem is NP-complete
Abdallah Saffidine, Sébastien Lê Cong, Sophie Pinchinat +1
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
cs.LO2019
Reachability Games in Dynamic Epistemic Logic
Bastien Maubert, Sophie Pinchinat, François Schwarzentruber
We define reachability games based on Dynamic Epistemic Logic (DEL), where the players' actions are finely described as DEL action models. We first consider the setting where an ex…