default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnantha Padmanabha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Anantha Padmanabha
, Luc Segoufin, Cristina Sirangelo:
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. Proc. ACM Manag. Data 2(2): 74 (2024)- [i7]Diego Figueira, S. Krishna, Om Swostik Mishra, Anantha Padmanabha:
Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions. CoRR abs/2407.20782 (2024) - 2023
- [j3]Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Are bundles good deals for first-order modal logic? Inf. Comput. 293: 105062 (2023) - [j2]Anantha Padmanabha, R. Ramanujam:
A Decidable Fragment of First Order Modal Logic: Two Variable Term Modal Logic. ACM Trans. Comput. Log. 24(4): 29:1-29:38 (2023) - [c8]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering Under Primary Keys. ICDT 2023: 24:1-24:18 - [i6]Diego Figueira, Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Simple Algorithm for Consistent Query Answering under Primary Keys. CoRR abs/2301.08482 (2023) - [i5]Anantha Padmanabha, Luc Segoufin, Cristina Sirangelo:
A Dichotomy in the Complexity of Consistent Query Answering for Two Atom Queries With Self-Join. CoRR abs/2309.12059 (2023) - 2022
- [c7]Mo Liu, Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Generalized Bundled Fragments for First-Order Modal Logic. MFCS 2022: 70:1-70:14 - [i4]Mo Liu, Anantha Padmanabha, Ramaswamy Ramanujam, Yanjing Wang:
Are Bundles Good Deals for FOML? CoRR abs/2202.01581 (2022) - 2021
- [c6]Ramit Das, Anantha Padmanabha, R. Ramanujam:
Reasoning in Large Games with Unboundedly Many Players. LORI 2021: 41-57 - 2020
- [c5]Anantha Padmanabha, R. Ramanujam:
Verifying Implicitly Quantified Modal Logic over Dynamic Networks of Processes. ICDCIT 2020: 165-176
2010 – 2019
- 2019
- [j1]Anantha Padmanabha, R. Ramanujam:
The Monodic Fragment of Propositional Term Modal Logic. Stud Logica 107(3): 533-557 (2019) - [c4]Anantha Padmanabha, R. Ramanujam:
Propositional Modal Logic with Implicit Modal Quantification. ICLA 2019: 6-17 - [c3]Anantha Padmanabha, R. Ramanujam:
Two variable fragment of Term Modal Logic. MFCS 2019: 30:1-30:14 - [i3]Anantha Padmanabha, R. Ramanujam:
Two variable fragment of Term Modal Logic. CoRR abs/1904.10260 (2019) - 2018
- [c2]Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Bundled Fragments of First-Order Modal Logic: (Un)Decidability. FSTTCS 2018: 43:1-43:20 - [i2]Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Bundled fragments of first-order modal logic: (un)decidability. CoRR abs/1803.10508 (2018) - [i1]Anantha Padmanabha, R. Ramanujam:
Propositional modal logic with implicit modal quantification. CoRR abs/1811.09454 (2018) - 2017
- [c1]Anantha Padmanabha, R. Ramanujam:
Model Checking a Logic over Systems with Regular Sets of Processes. DIAS/EDUDM@ISEC 2017
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-08-25 20:08 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:
