activity
20042023
most citedStrategic Coalitions with Perfect Recall

16 citations · 85 across the 26 of their papers we have counts for

collaborators
Showing cs.AIShow all

18 papers · 1 filter

cs.AI2023★ 1 cited

De Re and De Dicto Knowledge in Egocentric Setting

Pavel Naumov, Anna Ovchinnikova

Prior proposes the term "egocentric" for logical systems that study properties of agents rather than properties of possible worlds. In such a setting, the paper introduces two diff…

cs.AI2022★ 2 cited

Truth Set Algebra: A New Way to Prove Undefinability

Sophia Knight, Pavel Naumov, Qi Shi +1

The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtai…

cs.AI2021

Budget-Constrained Coalition Strategies with Discounting

Lia Bozzone, Pavel Naumov

Discounting future costs and rewards is a common practice in accounting, game theory, and machine learning. In spite of this, existing logics for reasoning about strategies with co…

cs.AI2021

If You're Happy, Then You Know It: The Logic of Happiness... and Sadness

Sanaz Azimipour, Pavel Naumov

The article proposes a formal semantics of happiness and sadness modalities in imperfect information setting. It shows that these modalities are not definable through each other an…

cs.AI2020

Epistemic Logic of Know-Who

Sophia Epstein, Pavel Naumov

The paper suggests a definition of "know who" as a modality using Grove-Halpern semantics of names. It also introduces a logical system that describes the interplay between modalit…

cs.AI2020

Comprehension and Knowledge

Pavel Naumov, Kevin Ros

The ability of an agent to comprehend a sentence is tightly connected to the agent's prior experiences and background knowledge. The paper suggests to interpret comprehension as a…