On the Conditional Logic of Simulation Models
Authors: Duligur Ibeling, Thomas Icard
IJCAI 2018 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main results include a series of axiomatizations, allowing comparison between this framework and existing frameworks (normality-ordering models, causal structural equation models), and a complexity result establishing NP-completeness of the satisfiability problem. |
| Researcher Affiliation | Academia | 1 Department of Computer Science, Stanford University 2 Department of Philosophy, Stanford University duligur@stanford.edu, icard@stanford.edu |
| Pseudocode | Yes | Listing 1: Is Intervened(Xi); Listing 2: Holds From Intervention(α) |
| Open Source Code | No | The paper does not provide any statement or link indicating that the source code for the methodology is openly available. |
| Open Datasets | No | This is a theoretical paper focused on logical frameworks and complexity results, not empirical experiments. Therefore, there are no datasets used for training. |
| Dataset Splits | No | This is a theoretical paper focused on logical frameworks and complexity results, not empirical experiments. Therefore, there is no validation data. |
| Hardware Specification | No | This is a theoretical paper focused on logical frameworks and complexity results, not empirical experiments. Therefore, no hardware specifications are provided. |
| Software Dependencies | No | This is a theoretical paper focused on logical frameworks and complexity results, not empirical experiments. The paper describes programming language definitions as part of its formal framework, but not specific software dependencies with version numbers for implementation or experimentation. |
| Experiment Setup | No | This is a theoretical paper focused on logical frameworks and complexity results, not empirical experiments. Therefore, no experimental setup details are provided. |