default search action
Sagar Malhotra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c7]Alessandro Daniele, Tommaso Campari, Sagar Malhotra, Luciano Serafini:
Simple and Effective Transfer Learning for Neuro-Symbolic Integration. NeSy (1) 2024: 166-179 - [c6]Florian Chen, Felix Weitkämper, Sagar Malhotra:
Understanding Domain-Size Generalization in Markov Logic Networks. ECML/PKDD (7) 2024: 297-314 - [i11]Alessandro Daniele, Tommaso Campari, Sagar Malhotra, Luciano Serafini:
Simple and Effective Transfer Learning for Neuro-Symbolic Integration. CoRR abs/2402.14047 (2024) - [i10]Florian Chen, Felix Weitkämper
, Sagar Malhotra:
Understanding Domain-Size Generalization in Markov Logic Networks. CoRR abs/2403.15933 (2024) - [i9]Davide Bizzaro, Luciano Serafini, Sagar Malhotra:
Towards Counting Markov Equivalence Classes with Logical Constraints. CoRR abs/2405.13736 (2024) - [i8]Alexander Pluska, Pascal Welke, Thomas Gärtner, Sagar Malhotra:
Logical Distillation of Graph Neural Networks. CoRR abs/2406.07126 (2024) - 2023
- [c5]Alessandro Daniele, Tommaso Campari, Sagar Malhotra, Luciano Serafini:
Deep Symbolic Learning: Discovering Symbols and Rules from Perceptions. IJCAI 2023: 3597-3605 - [c4]Alessandro Daniele, Tommaso Campari, Sagar Malhotra, Luciano Serafini:
Deep Symbolic Learning: Discovering Symbols and Rules from Perceptions. NeSy 2023: 418-419 - [i7]Sagar Malhotra, Luciano Serafini:
Weighted First Order Model Counting with Directed Acyclic Graph Axioms. CoRR abs/2302.09830 (2023) - [i6]Sagar Malhotra, Davide Bizzaro, Luciano Serafini:
Lifted Inference beyond First-Order Logic. CoRR abs/2308.11738 (2023) - 2022
- [c3]Sagar Malhotra, Luciano Serafini:
Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula. AAAI 2022: 5817-5824 - [c2]Sagar Malhotra, Luciano Serafini:
On Projectivity in Markov Logic Networks. ECML/PKDD (5) 2022: 223-238 - [i5]Sagar Malhotra, Luciano Serafini:
On Projectivity in Markov Logic Networks. CoRR abs/2204.04009 (2022) - [i4]Alessandro Daniele, Tommaso Campari, Sagar Malhotra, Luciano Serafini:
Deep Symbolic Learning: Discovering Symbols and Rules from Perceptions. CoRR abs/2208.11561 (2022) - 2021
- [c1]Sagar Malhotra, Luciano Serafini:
A Combinatorial Approach to Weighted Model Counting in the Two-Variable Fragment with Cardinality Constraints. AI*IA 2021: 137-152 - [i3]Sagar Malhotra, Luciano Serafini:
Weighted Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula. CoRR abs/2110.05992 (2021) - 2020
- [i2]Sagar Malhotra, Luciano Serafini:
Weighed Model Counting in FO2 with Cardinality Constraints and Counting Quantifiers: A Closed Form Formula. CoRR abs/2009.12237 (2020)
2010 – 2019
- 2010
- [i1]Asok De, N. S. Raghava, Sagar Malhotra, Pushkar Arora, Rishik Bazaz:
Effect of different substrates on Compact stacked square Microstrip Antenna. CoRR abs/1002.3337 (2010)
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-09-19 23:42 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: