A Recursive Algorithm for Projected Model Counting
Authors: Jean-Marie Lagniez, Pierre Marquis1536-1543
AAAI 2019 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | In order to evaluate the benefits offered by proj MC, we performed some experiments. The empirical protocol we followed is precisely the same as the one considered in (Aziz et al. 2015). Thus we have considered 260 instances coming from three data sets. ... Our experiments show that in many cases proj MC challenges the previous algorithms for projected model counting from the literature. |
| Researcher Affiliation | Academia | CRIL, U. Artois & CNRS Institut Universitaire de France F-62300 Lens, France {lagniez, marquis}@cril.fr |
| Pseudocode | Yes | Algorithm 1: proj MC(Σ, X) ... Algorithm 2: DD(Σ, ω, X) |
| Open Source Code | Yes | The binary code of proj MC, as well as the benchmarks used in our experiments and additional empirical results are available from www.cril.fr/KC/. |
| Open Datasets | Yes | The binary code of proj MC, as well as the benchmarks used in our experiments and additional empirical results are available from www.cril.fr/KC/. |
| Dataset Splits | No | The paper does not mention explicit training, validation, or test dataset splits in the context of machine learning model training. The 'instances' and 'benchmarks' are used for evaluation of the model counting algorithm itself. |
| Hardware Specification | Yes | All the experiments have been conducted on a cluster of Intel Xeon E5-2643 (3.30 GHz) quad core processors with 32 Gi B RAM. |
| Software Dependencies | Yes | The kernel used was Cent OS 7, Linux version 3.10.0-514.16.1.el7.x86 64. The compiler used was gcc version 5.3.1. |
| Experiment Setup | Yes | A time-out of 600s and a memory-out of 7.6 Gi B has been considered for each instance. |