default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexis de Colnet
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c13]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider
:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. AAAI 2024: 7978-7986- [c12]Alexis de Colnet, Stefan Szeider, Tianwei Zhang:
Compilation and Fast Model Counting beyond CNF. IJCAI 2024: 3315-3323 - [c11]Alexis de Colnet:
On the Relative Efficiency of Dynamic and Static Top-Down Compilation to Decision-DNNF. SAT 2024: 11:1-11:21 - [i9]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Hardness of Random Reordered Encodings of Parity for Resolution and CDCL. CoRR abs/2402.00542 (2024) - [i8]Kuldeep S. Meel, Alexis de Colnet:
An FPRAS for #nFBDD. CoRR abs/2406.16515 (2024) - [i7]Kuldeep S. Meel, Alexis de Colnet:
#CFG and #DNNF admit FPRAS. CoRR abs/2406.18224 (2024) - 2023
- [j1]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. J. Artif. Intell. Res. 76: 265-286 (2023) - [c10]Alexis de Colnet, Pierre Marquis:
On Translations between ML Models for XAI Purposes. IJCAI 2023: 3158-3166 - [c9]Alexis de Colnet:
Separating Incremental and Non-Incremental Bottom-Up Compilation. SAT 2023: 7:1-7:20 - [d1]Leroy Chew, Alexis de Colnet, Friedrich Slivovsky, Stefan Szeider:
Dataset of Random Reordered Encodings of Parity Problems. Zenodo, 2023
- [i6]Alexis de Colnet, Pierre Marquis:
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. CoRR abs/2301.13328 (2023) - 2022
- [c8]Alexis de Colnet, Stefan Mengel:
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. AAAI 2022: 5564-5572 - [c7]Alexis de Colnet, Pierre Marquis:
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. IJCAI 2022: 2583-2590 - [c6]Alexis de Colnet, Pierre Marquis:
On the Complexity of Enumerating Prime Implicants from Decision-DNNF Circuits. ISAIM 2022 - 2021
- [c5]Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. KR 2021: 205-215 - [c4]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations. SAT 2021: 116-133 - [i5]Alexis de Colnet:
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints. CoRR abs/2101.01953 (2021) - [i4]Alexis de Colnet, Stefan Mengel:
Characterizing Tseitin-formulas with short regular resolution refutations. CoRR abs/2103.09609 (2021) - [i3]Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. CoRR abs/2110.13014 (2021) - [i2]Alexis de Colnet, Stefan Mengel:
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation. CoRR abs/2112.12430 (2021) - 2020
- [c3]Alexis de Colnet, Stefan Mengel:
Lower Bounds for Approximate Knowledge Compilation. IJCAI 2020: 1834-1840 - [c2]Alexis de Colnet:
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints. SAT 2020: 312-321 - [i1]Alexis de Colnet, Stefan Mengel:
Lower Bounds for Approximate Knowledge Compilation. CoRR abs/2011.13721 (2020)
2010 – 2019
- 2019
- [c1]Alexis de Colnet, Kuldeep S. Meel:
Dual Hashing-Based Algorithms for Discrete Integration. CP 2019: 161-176
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-21 21:30 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:
