activity
20192025
most citedThe Packed Interval Covering Problem is NP-complete

2 citations · 4 across the 7 of their papers we have counts for

collaborators

8 papers

cs.GT2025

On Dynamic Programming Theory for Leader-Follower Stochastic Games

Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur +1

Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best respond…

cs.LO2025

Lecture Notes on Verifying Graph Neural Networks

François Schwarzentruber

In these lecture notes, we first recall the connection between graph neural networks, Weisfeiler-Lehman tests and logics such as first-order logic and graded modal logic. We then p…

cs.CC2025

Linear Planar 3-SAT and Its Applications in Planning

Victorien Desbois, Ocan Sankur, François Schwarzentruber

Several fragments of the satisfiability problem have been studied in the literature. Among these, Linear 3-SAT is a satisfaction problem in which each clause (viewed as a set of li…

cs.LO2024

A Computationally Grounded Framework for Cognitive Attitudes (extended version)

Tiago de Lima, Emiliano Lorini, Elise Perrotin +1

We introduce a novel language for reasoning about agents' cognitive attitudes of both epistemic and motivational type. We interpret it by means of a computationally grounded semant…

cs.LO20231 cited

On simple expectations and observations of intelligent agents: A complexity study

Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh +1

Public observation logic (POL) reasons about agent expectations and agent observations in various real world situations. The expectations of agents take shape based on certain prot…

cs.LO20221 cited

On verifying expectations and observations of intelligent agents

Sourav Chakraborty, Avijeet Ghosh, Sujata Ghosh +1

Public observation logic (POL) is a variant of dynamic epistemic logic to reason about agent expectations and agent observations. Agents have certain expectations, regarding the si…