ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2310.03352
  4. Cited By
Tractable Bounding of Counterfactual Queries by Knowledge Compilation

Tractable Bounding of Counterfactual Queries by Knowledge Compilation

5 October 2023
David Huber
Yizuo Chen
Alessandro Antonucci
Adnan Darwiche
Marco Zaffalon
    TPM
ArXivPDFHTML

Papers citing "Tractable Bounding of Counterfactual Queries by Knowledge Compilation"

3 / 3 papers shown
Title
Efficient Computation of Counterfactual Bounds
Efficient Computation of Counterfactual Bounds
Marco Zaffalon
Alessandro Antonucci
Rafael Cabañas
David Huber
Dario Azzimonti
15
2
0
17 Jul 2023
Tractable Boolean and Arithmetic Circuits
Tractable Boolean and Arithmetic Circuits
Adnan Darwiche
TPM
33
12
0
07 Feb 2022
An Automated Approach to Causal Inference in Discrete Settings
An Automated Approach to Causal Inference in Discrete Settings
Guilherme Duarte
N. Finkelstein
D. Knox
Jonathan Mummolo
I. Shpitser
31
48
0
28 Sep 2021
1