default search action
Pavel Naumov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j44]Kaya Deuser
, Junli Jiang
A Dynamic Logic of Data-Informed Knowledge. J. Philos. Log. 53(2): 521-557 (2024) - [c47]Junli Jiang, Pavel Naumov:
The Logic of Doxastic Strategies. AAAI 2024: 19876-19883 - 2023
- [j43]Pavel Naumov, Jia Tao
Counterfactual and seeing-to-it responsibilities in strategic games. Ann. Pure Appl. Log. 174(10): 103353 (2023) - [c46]Pavel Naumov, Oliver Orejola:
Shhh! The Logic of Clandestine Operations. IJCAI 2023: 3304-3311 - [c45]Junli Jiang
Data-Informed Knowledge and Strategies (Extended Abstract). IJCAI 2023: 6910-6914 - [i31]Pavel Naumov, Oliver Orejola:
Shhh! The Logic of Clandestine Operations. CoRR abs/2305.07035 (2023) - [i30]Pavel Naumov, Anna Ovchinnikova:
De Re and De Dicto Knowledge in Egocentric Setting. CoRR abs/2308.00001 (2023) - [i29]Junli Jiang, Pavel Naumov:
The Logic of Doxastic Strategies. CoRR abs/2312.07107 (2023) - 2022
- [j42]Junli Jiang
Data-informed knowledge and strategies. Artif. Intell. 309: 103727 (2022) - [j41]Mohammad Divband Soorati, Enrico H. Gerding, Enrico Marchioni, Pavel Naumov
From intelligent agents to trustworthy human-centred multiagent systems. AI Commun. 35(4): 443-457 (2022) - [j40]Pavel Naumov
The Polymatrix Gap Conjecture. IGTR 24(3): 2250005:1-2250005:17 (2022) - [j39]Lia Bozzone, Pavel Naumov
Budget-constrained coalition strategies with discounting. J. Log. Comput. 32(4): 832-851 (2022) - [c44]Pavel Naumov, Wenxuan Zhang
Prevailing in the Dark: Information Walls in Strategic Games. AAAI 2022: 5842-5850 - [c43]Rui Cao, Pavel Naumov:
The Limits of Morality in Strategic Games. IJCAI 2022: 2561-2567 - [c42]Junli Jiang
The Egocentric Logic of Preferences. IJCAI 2022: 2676-2682 - [c41]Junli Jiang
In Data We Trust: The Logic of Trust-Based Beliefs. IJCAI 2022: 2683-2689 - [c40]Pavel Naumov, Yuan Yuan:
Intelligence in Strategic Games (Extended Abstract). IJCAI 2022: 5757-5761 - [i28]Sophia Knight, Pavel Naumov
What are Your Powers? - Truth Set Algebras. CoRR abs/2208.04422 (2022) - [i27]Mohammad Divband Soorati, Enrico H. Gerding, Enrico Marchioni, Pavel Naumov, Timothy J. Norman, Sarvapali D. Ramchurn, Bahar Rastegari, Adam J. Sobey, Sebastian Stein, Danesh Tarpore, Vahid Yazdanpanah, Jie Zhang
From Intelligent Agents to Trustworthy Human-Centred Multiagent Systems. CoRR abs/2210.02260 (2022) - 2021
- [j38]Sanaz Azimipour, Pavel Naumov
Axiomatic theory of betweenness. Arch. Math. Log. 60(1-2): 227-239 (2021) - [j37]Pavel Naumov
Intelligence in Strategic Games. J. Artif. Intell. Res. 71: 521-556 (2021) - [j36]Pavel Naumov
Strategic coalitions in stochastic games. J. Log. Comput. 31(7): 1845-1867 (2021) - [j35]Kaya Deuser
Strategic Knowledge Acquisition. ACM Trans. Comput. Log. 22(3): 17:1-17:18 (2021) - [c39]Sophia Epstein, Pavel Naumov:
Epistemic Logic of Know-Who. AAAI 2021: 11479-11486 - [c38]Pavel Naumov, Rui-Jie Yew:
Ethical Dilemmas in Strategic Games. AAAI 2021: 11613-11621 - [c37]Pavel Naumov, Kevin Ros:
Comprehension and Knowledge. AAAI 2021: 11622-11629 - [c36]Lia Bozzone, Pavel Naumov
Budget-Constrained Coalition Strategies with Discounting. IJCAI 2021: 1808-1814 - [c35]Pavel Naumov
Two Forms of Responsibility in Strategic Games. IJCAI 2021: 1989-1995 - [c34]Pavel Naumov
Attainable Knowledge and Omniscience. TARK 2021: 251-265 - [i26]Sanaz Azimipour, Pavel Naumov:
If You're Happy, Then You Know It: The Logic of Happiness... and Sadness. CoRR abs/2101.00485 (2021) - [i25]Lia Bozzone, Pavel Naumov
Budget-Constrained Coalition Strategies with Discounting. CoRR abs/2105.04692 (2021) - 2020
- [j34]Pavel Naumov
An epistemic logic of blameworthiness. Artif. Intell. 283: 103269 (2020) - [j33]Rui Cao
Knowing the price of success. Artif. Intell. 284: 103287 (2020) - [j32]Kaya Deuser
On composition of bounded-recall plans. Artif. Intell. 289: 103399 (2020) - [j31]Colby Morrison, Pavel Naumov
Group Conformity in Social Networks. J. Log. Lang. Inf. 29(1): 3-19 (2020) - [c33]Pavel Naumov, Jia Tao:
Blameworthiness in Security Games. AAAI 2020: 2934-2941 - [c32]Pavel Naumov, Jia Tao:
Duty to Warn in Strategic Games. AAMAS 2020: 904-912 - [c31]Pavel Naumov, Jia Tao:
Knowing-How under Uncertainty (Extended Abstract). IJCAI 2020: 5120-5124 - [i24]Pavel Naumov, Kevin Ros:
Comprehension and Knowledge. CoRR abs/2012.06561 (2020) - [i23]Sophia Epstein, Pavel Naumov:
Epistemic Logic of Know-Who. CoRR abs/2012.06651 (2020)
2010 – 2019
- 2019
- [j30]Pavel Naumov
Knowing-how under uncertainty. Artif. Intell. 276: 41-56 (2019) - [j29]Zoé Christoff
Diffusion in social networks with recalcitrant agents. J. Log. Comput. 29(1): 53-70 (2019) - [j28]Pavel Naumov
Everyone Knows that someone Knows: Quantifiers over Epistemic Agents. Rev. Symb. Log. 12(2): 255-270 (2019) - [c30]Pavel Naumov
Blameworthiness in Strategic Games. AAAI 2019: 3011-3018 - [c29]Elena Zhiryaeva
Formation of Export Clusters in Food Trade of the Russian Federation in the Conditions of Digital Transformation of the Economy. FRUCT 2019: 525-532 - [i22]Rui Cao, Pavel Naumov:
The Limits of Morality in Strategic Games. CoRR abs/1901.08467 (2019) - [i21]Pavel Naumov, Kevin Ros:
Strategic Coalitions in Stochastic Games. CoRR abs/1910.04489 (2019) - [i20]Pavel Naumov, Yuan Yuan:
Intelligence in Strategic Games. CoRR abs/1910.07298 (2019) - [i19]Pavel Naumov, Jia Tao:
Blameworthiness in Security Games. CoRR abs/1910.08647 (2019) - [i18]Pavel Naumov, Rui-Jie Yew:
Ethical Dilemmas of Strategic Coalitions. CoRR abs/1911.00786 (2019) - [i17]Pavel Naumov, Jia Tao:
Duty to Warn in Strategic Games. CoRR abs/1912.02759 (2019) - 2018
- [j27]Pavel Naumov
Together we know how to achieve: An epistemic logic of know-how. Artif. Intell. 262: 279-300 (2018) - [j26]Sanaz Azimipour, Pavel Naumov:
Lighthouse Principle for Diffusion in Social Networks. FLAP 5(1): 97-120 (2018) - [j25]Kaya Deuser, Pavel Naumov
Navigability with intermediate constraints. J. Log. Comput. 28(7): 1647-1670 (2018) - [c28]Pavel Naumov, Jia Tao:
Strategic Coalitions With Perfect Recall. AAAI 2018: 4702-4709 - [c27]Kaya Deuser, Pavel Naumov:
Armstrong's Axioms and Navigation Strategies. AAAI 2018: 6343-6350 - [c26]Pavel Naumov, Jia Tao:
Second-Order Know-How Strategies. AAMAS 2018: 390-398 - [c25]Kaya Deuser, Pavel Naumov:
Navigability with Bounded Recall. KR 2018: 635-636 - [c24]Pavel Naumov, Kevin Ros:
Strategic Coalitions in Systems with Catastrophic Failures. KR 2018: 659-660 - [i16]Pavel Naumov, Jia Tao:
Blameworthiness in Strategic Games. CoRR abs/1809.05485 (2018) - [i15]Pavel Naumov
Blameworthiness in Games with Imperfect Information. CoRR abs/1811.02446 (2018) - 2017
- [j24]Pavel Naumov
Price of privacy. J. Appl. Log. 20: 32-48 (2017) - [j23]Pavel Naumov
Marketing impact on diffusion in social networks. J. Appl. Log. 20: 49-74 (2017) - [j22]Pavel Naumov
A modal logic for reasoning about economic policies. J. Log. Comput. 27(1): 395-412 (2017) - [j21]Pavel Naumov
Knowledge in communication networks. J. Log. Comput. 27(4): 1189-1224 (2017) - [j20]Pavel Naumov
Information Flow under Budget Constraints. ACM Trans. Comput. Log. 18(4): 32:1-32:26 (2017) - [c23]Pavel Naumov, Jia Tao:
Coalition Power in Epistemic Transition Systems. AAMAS 2017: 723-731 - [c22]Rui Cao
Budget-Constrained Dynamics in Multiagent Systems. IJCAI 2017: 915-921 - [c21]Pavel Naumov
Together We Know How to Achieve: An Epistemic Logic of Know-How (Extended Abstract). TARK 2017: 441-453 - [i14]Pavel Naumov, Jia Tao:
Together We Know How to Achieve: An Epistemic Logic of Know-How. CoRR abs/1705.09349 (2017) - [i13]Kaya Deuser, Pavel Naumov:
Armstrong's Axioms and Navigation Strategies. CoRR abs/1707.04106 (2017) - [i12]Pavel Naumov, Jia Tao:
Strategic Coalitions with Perfect Recall. CoRR abs/1707.04298 (2017) - [i11]Kaya Deuser, Pavel Naumov:
Navigability with Imperfect Information. CoRR abs/1707.08255 (2017) - 2016
- [j19]Pavel Naumov
Conditional interchangeability of Nash equilibria. J. Log. Comput. 26(5): 1421-1438 (2016) - [j18]Pavel Naumov
Equilibria interchangeability in cellular games. J. Log. Comput. 26(5): 1637-1661 (2016) - [j17]Kristine Harjes, Pavel Naumov
Functional Dependence in Strategic Games. Notre Dame J. Formal Log. 57(3): 341-353 (2016) - [c20]Pavel Naumov
Information Flow Under Budget Constraints. JELIA 2016: 353-368 - [i10]Sanaz Azimipour, Pavel Naumov:
Lighthouse Principle for Diffusion in Social Networks. CoRR abs/1601.04098 (2016) - [i9]Pavel Naumov, Jia Tao:
Marketing Impact on Diffusion in Social Networks. CoRR abs/1601.05283 (2016) - 2015
- [j16]Pavel Naumov
Logic of confidence. Synth. 192(6): 1821-1838 (2015) - [c19]Pavel Naumov, Jia Tao:
Budget-Constrained Knowledge in Multiagent Systems. AAMAS 2015: 219-226 - [i8]Pavel Naumov, Jia Tao:
Knowledge in Communication Networks. CoRR abs/1501.03028 (2015) - [i7]Pavel Naumov
The Budget-Constrained Functional Dependency. CoRR abs/1507.05964 (2015) - 2014
- [j15]Jeffrey Kane, Pavel Naumov
Symmetry in information flow. Ann. Pure Appl. Log. 165(1): 253-265 (2014) - [j14]Pavel Naumov
Rationally Functional Dependence. J. Philos. Log. 43(2-3): 603-616 (2014) - [j13]Pavel Naumov
Strict equilibria interchangeability in multi-player zero-sum games. J. Log. Comput. 24(4): 851-861 (2014) - [j12]Jeffrey Kane, Pavel Naumov
The Ryōan-ji axiom for common knowledge on hypergraphs. Synth. 191(14): 3407-3426 (2014) - [c18]Zachary Heckle, Pavel Naumov
Common Knowledge Semantics of Armstrong's Axioms. WoLLIC 2014: 181-194 - [i6]Pavel Naumov, Margaret Protzman:
Equilibria Interchangeability in Cellular Games. CoRR abs/1402.1156 (2014) - 2013
- [j11]Pavel Naumov
On interchangeability of Nash equilibria in multi-player strategic games. Synth. 190(Supplement-1): 57-78 (2013) - [c17]Jeffrey Kane, Pavel Naumov
Symmetries and Epistemic Reasoning. CLIMA 2013: 190-205 - [c16]Kristine Harjes, Pavel Naumov
Cellular Games, Nash Equilibria, and Fibonacci Numbers. LORI 2013: 149-161 - [c15]Jeffrey Kane, Pavel Naumov:
Epistemic Logic for Communication Chains. TARK 2013 - [c14]Pavel Naumov, Brittany Nicholls:
R.E. Axiomatization of Conditional Independence. TARK 2013 - [c13]Kristine Harjes, Pavel Naumov
Functional Dependence in Strategic Games (extended abstract). SR 2013: 9-15 - [i5]Kristine Harjes, Pavel Naumov:
Functional Dependence in Strategic Games. CoRR abs/1302.0447 (2013) - [i4]Jeffrey Kane, Pavel Naumov:
Epistemic Logic for Communication Chains. CoRR abs/1310.6424 (2013) - [i3]Pavel Naumov, Brittany Nicholls:
R.E. Axiomatization of Conditional Independence. CoRR abs/1310.6430 (2013) - 2012
- [j10]Pavel Naumov
Independence in Information Spaces. Stud Logica 100(5): 953-973 (2012) - [j9]Sara Miner More, Pavel Naumov
Calculus of cooperation and game-based reasoning about protocol privacy. ACM Trans. Comput. Log. 13(3): 22:1-22:21 (2012) - [c12]Sarah Holbrook, Pavel Naumov
Fault Tolerance in Belief Formation Networks. JELIA 2012: 267-280 - 2011
- [j8]Sara Miner More, Pavel Naumov
Hypergraphs of multiparty secrets. Ann. Math. Artif. Intell. 62(1-2): 79-101 (2011) - [j7]Sara Miner More, Pavel Naumov
Logic of secrets in collaboration networks. Ann. Pure Appl. Log. 162(12): 959-969 (2011) - [c11]Sara Miner More, Pavel Naumov
The Functional Dependence Relation on Hypergraphs of Secrets. CLIMA 2011: 29-40 - [c10]Sara Miner More, Pavel Naumov
Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. CSL 2011: 443-457 - [c9]Pavel Naumov
Game Semantics for the Geiger-Paz-Pearl Axioms of Independence. LORI 2011: 220-232 - [c8]Sara Miner More, Pavel Naumov
A ternary knowledge relation on secrets. TARK 2011: 46-54 - [c7]Michael S. Donders, Sara Miner More, Pavel Naumov
Information Flow on Directed Acyclic Graphs. WoLLIC 2011: 95-109 - 2010
- [j6]Sara Miner More, Pavel Naumov
An Independence Relation for Sets of Secrets. Stud Logica 94(1): 73-85 (2010) - [c6]Sara Miner More, Pavel Naumov
Hypergraphs of Multiparty Secrets. CLIMA 2010: 15-32 - [c5]Robert Kelvey, Sara Miner More, Pavel Naumov, Benjamin Sapp:
Independence and Functional Dependence Relations on Secrets. KR 2010 - [i2]Sara Miner More, Pavel Naumov:
Functional Dependence of Secrets in a Collaboration Network. CoRR abs/1011.0399 (2010)
2000 – 2009
- 2009
- [c4]Sara Miner More, Pavel Naumov
On interdependence of secrets in collaboration networks. TARK 2009: 208-217 - [c3]Sara Miner More, Pavel Naumov
An Independence Relation for Sets of Secrets. WoLLIC 2009: 296-304 - 2008
- [j5]Pavel Naumov
On meta complexity of propositional formulas and propositional proofs. Arch. Math. Log. 47(1): 35-52 (2008) - 2006
- [j4]Pavel Naumov
Upper bounds on complexity of Frege proofs with limited use of certain schemata. Arch. Math. Log. 45(4): 431-446 (2006) - [j3]Pavel Naumov
On modal logic of deductive closure. Ann. Pure Appl. Log. 141(1-2): 218-224 (2006) - [j2]Pavel Naumov
Logic of subtyping. Theor. Comput. Sci. 357(1-3): 167-185 (2006) - 2005
- [j1]Pavel Naumov
On Modal Logics of Partial Recursive Functions. Stud Logica 81(3): 295-309 (2005) - 2004
- [i1]Pavel Naumov:
On Modal Logics of Partial Recursive Functions. CoRR cs.LO/0407031 (2004) - 2001
- [c2]Pavel Naumov
The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability). TPHOLs 2001: 329-345 - 2000
- [c1]Robert L. Constable, Paul B. Jackson, Pavel Naumov, Juan C. Uribe:
Constructively formalizing automata theory. Proof, Language, and Interaction 2000: 213-238
1990 – 1999
- 1998
- [b1]Pavel Naumov:
Formalizing Reference Types in NuPRL. Cornell University, USA, 1998
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 2024-10-07 22:23 CEST 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: