ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1506.02639
  4. Cited By
New Limits for Knowledge Compilation and Applications to Exact Model
  Counting
v1v2 (latest)

New Limits for Knowledge Compilation and Applications to Exact Model Counting

Conference on Uncertainty in Artificial Intelligence (UAI), 2015
8 June 2015
P. Beame
Vincent Liew
ArXiv (abs)PDFHTML

Papers citing "New Limits for Knowledge Compilation and Applications to Exact Model Counting"

10 / 10 papers shown
Structured d-DNNF Is Not Closed Under Negation
Structured d-DNNF Is Not Closed Under Negation
Harry Vinall-Smeeth
225
4
0
07 Feb 2024
Logic for Explainable AI
Logic for Explainable AILogic in Computer Science (LICS), 2023
Adnan Darwiche
299
24
0
09 May 2023
On the Computation of Necessary and Sufficient Explanations
On the Computation of Necessary and Sufficient ExplanationsAAAI Conference on Artificial Intelligence (AAAI), 2022
Adnan Darwiche
Chunxi Ji
FAtt
278
32
0
20 Mar 2022
Tractable Boolean and Arithmetic Circuits
Tractable Boolean and Arithmetic Circuits
Adnan Darwiche
TPM
243
17
0
07 Feb 2022
On Quantifying Literals in Boolean Logic and Its Applications to
  Explainable AI
On Quantifying Literals in Boolean Logic and Its Applications to Explainable AIJournal of Artificial Intelligence Research (JAIR), 2021
Adnan Darwiche
Pierre Marquis
232
30
0
23 Aug 2021
Lower Bounds for Approximate Knowledge Compilation
Lower Bounds for Approximate Knowledge CompilationInternational Joint Conference on Artificial Intelligence (IJCAI), 2020
Alexis de Colnet
S. Mengel
87
4
0
27 Nov 2020
Three Modern Roles for Logic in AI
Three Modern Roles for Logic in AIACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), 2020
Adnan Darwiche
AI4CE
307
58
0
18 Apr 2020
On the relation between structured $d$-DNNFs and SDDs
On the relation between structured ddd-DNNFs and SDDsTheory of Computing Systems (TCS), 2019
Beate Bollig
Martin Farenholtz
88
4
0
02 Dec 2019
On the Relative Succinctness of Sentential Decision Diagrams
On the Relative Succinctness of Sentential Decision Diagrams
Beate Bollig
Matthias Buttkus
98
13
0
13 Feb 2018
Understanding the complexity of #SAT using knowledge compilation
Understanding the complexity of #SAT using knowledge compilationLogic in Computer Science (LICS), 2017
Florent Capelli
81
20
0
05 Jan 2017
1
Page 1 of 1