default search action
Jia Tao 0001
Person information
- affiliation: Lafayette College, Department of Computer Science, Easton, PA, USA
- affiliation: College of New Jersey, Computer Science Department, Ewing, NJ, USA
- affiliation: Bryn Mawr College, PA, USA
- affiliation (PhD): Iowa State University, Ames, IA, USA
Other persons with the same name
- Jia Tao — disambiguation page
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j14]Pavel Naumov, Jia Tao
:
Counterfactual and seeing-to-it responsibilities in strategic games. Ann. Pure Appl. Log. 174(10): 103353 (2023) - [c16]Samik Basu, Vasant G. Honavar
Representing and Reasoning with Multi-Stakeholder Qualitative Preference Queries. ECAI 2023: 206-213 - [i10]Samik Basu, Vasant G. Honavar, Ganesh Ram Santhanam, Jia Tao:
Representing and Reasoning with Multi-Stakeholder Qualitative Preference Queries. CoRR abs/2307.16307 (2023) - 2021
- [c15]Pavel Naumov
Two Forms of Responsibility in Strategic Games. IJCAI 2021: 1989-1995 - [c14]Pavel Naumov
Attainable Knowledge and Omniscience. TARK 2021: 251-265 - 2020
- [j13]Pavel Naumov
An epistemic logic of blameworthiness. Artif. Intell. 283: 103269 (2020) - [c13]Pavel Naumov, Jia Tao:
Blameworthiness in Security Games. AAAI 2020: 2934-2941 - [c12]Pavel Naumov, Jia Tao:
Duty to Warn in Strategic Games. AAMAS 2020: 904-912 - [c11]Pavel Naumov, Jia Tao:
Knowing-How under Uncertainty (Extended Abstract). IJCAI 2020: 5120-5124
2010 – 2019
- 2019
- [j12]Pavel Naumov
Knowing-how under uncertainty. Artif. Intell. 276: 41-56 (2019) - [j11]Jia Tao:
A PSpace Algorithm for Acyclic Epistemic DL ALCS5m. J. Autom. Reason. 63(3): 539-555 (2019) - [j10]Pavel Naumov
Everyone Knows that someone Knows: Quantifiers over Epistemic Agents. Rev. Symb. Log. 12(2): 255-270 (2019) - [c10]Pavel Naumov
Blameworthiness in Strategic Games. AAAI 2019: 3011-3018 - [i9]Pavel Naumov, Jia Tao:
Blameworthiness in Security Games. CoRR abs/1910.08647 (2019) - [i8]Pavel Naumov, Jia Tao:
Duty to Warn in Strategic Games. CoRR abs/1912.02759 (2019) - 2018
- [j9]Pavel Naumov
Together we know how to achieve: An epistemic logic of know-how. Artif. Intell. 262: 279-300 (2018) - [c9]Pavel Naumov, Jia Tao:
Strategic Coalitions With Perfect Recall. AAAI 2018: 4702-4709 - [c8]Pavel Naumov, Jia Tao:
Second-Order Know-How Strategies. AAMAS 2018: 390-398 - [i7]Pavel Naumov, Jia Tao:
Blameworthiness in Strategic Games. CoRR abs/1809.05485 (2018) - [i6]Pavel Naumov
Blameworthiness in Games with Imperfect Information. CoRR abs/1811.02446 (2018) - 2017
- [j8]Pavel Naumov
Price of privacy. J. Appl. Log. 20: 32-48 (2017) - [j7]Pavel Naumov
Marketing impact on diffusion in social networks. J. Appl. Log. 20: 49-74 (2017) - [j6]Pavel Naumov
A modal logic for reasoning about economic policies. J. Log. Comput. 27(1): 395-412 (2017) - [j5]Pavel Naumov
Knowledge in communication networks. J. Log. Comput. 27(4): 1189-1224 (2017) - [j4]Pavel Naumov
Information Flow under Budget Constraints. ACM Trans. Comput. Log. 18(4): 32:1-32:26 (2017) - [c7]Pavel Naumov, Jia Tao:
Coalition Power in Epistemic Transition Systems. AAMAS 2017: 723-731 - [c6]Pavel Naumov
Together We Know How to Achieve: An Epistemic Logic of Know-How (Extended Abstract). TARK 2017: 441-453 - [i5]Pavel Naumov, Jia Tao:
Together We Know How to Achieve: An Epistemic Logic of Know-How. CoRR abs/1705.09349 (2017) - [i4]Pavel Naumov, Jia Tao:
Strategic Coalitions with Perfect Recall. CoRR abs/1707.04298 (2017) - 2016
- [c5]Pavel Naumov
Information Flow Under Budget Constraints. JELIA 2016: 353-368 - [i3]Pavel Naumov, Jia Tao:
Marketing Impact on Diffusion in Social Networks. CoRR abs/1601.05283 (2016) - 2015
- [j3]Pavel Naumov
Logic of confidence. Synth. 192(6): 1821-1838 (2015) - [c4]Pavel Naumov, Jia Tao:
Budget-Constrained Knowledge in Multiagent Systems. AAMAS 2015: 219-226 - [c3]Leqi Liu, Jia Tao, Ziyan Yang, Fadi Towfic:
Shared genetic architecture in autoimmune disease - preliminary analysis. BIBM 2015: 800-806 - [i2]Pavel Naumov, Jia Tao:
Knowledge in Communication Networks. CoRR abs/1501.03028 (2015) - [i1]Pavel Naumov
The Budget-Constrained Functional Dependency. CoRR abs/1507.05964 (2015) - 2014
- [j2]Jia Tao, Giora Slutzki, Vasant G. Honavar
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases. ACM Trans. Comput. Log. 16(1): 3:1-3:32 (2014) - 2012
- [j1]Jia Tao, Giora Slutzki, Vasant G. Honavar
PSPACE Tableau Algorithms for Acyclic Modalized $\boldsymbol{\mathcal{ALC}}$. J. Autom. Reason. 49(4): 551-582 (2012) - 2010
- [c2]Jia Tao, Giora Slutzki, Vasant G. Honavar
Secrecy-Preserving Query Answering for Instance Checking in EL\mathcal{EL}. RR 2010: 195-203
2000 – 2009
- 2009
- [c1]Hridesh Rajan
Tisa: A Language Design and Modular Verification Technique for Temporal Policies in Web Services. ESOP 2009: 333-347
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:21 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: