You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
SkolemFC takes in a F(X,Y) formula as input and returns the number of Boolean functions G(X) such that ∃Y F(X, Y) = F(X, G(X)). SkolemFC *counts the number of functions without even generating a single function.*
8
7
9
8
To learn more about SkolemFC, please have a look at our [AAAI-24 paper](https://arxiv.org/abs/2312.12026).
Please follow [`INSTALL.md`](https://github.com/meelgroup/skolemfc/tree/main/INSTALL.md) if the script reports some error, or you need more instructions for compiling in other OS, etc.
38
+
### configure.sh options
27
39
40
+
Run `./configure.sh --help` for the full usage message.
28
41
29
42
30
43
## How to Use the Binary
@@ -51,6 +64,7 @@ SkolemFC reports that we have approximately `16 (=2 ** 4)` functions satisfying
51
64
### Guarantees
52
65
SkolemFC provides so-called "PAC", or Probably Approximately Correct, guarantees. In less fancy words, the system guarantees that the solution found is within a certain tolerance (called "epsilon") with a certain probability (called "delta"). The default tolerance and probability, i.e. epsilon and delta values, are set to 0.8 and 0.4, respectively. Both values are configurable.
53
66
67
+
> Code in this branch does not provide theoretical guarantees. See `main` branch for code which truly follows the paper.
54
68
55
69
### Issues, questions, bugs, etc.
56
70
Please click on "issues" at the top and [create a new issue](https://github.com/meelgroup/skolemfc/issues/new). All issues are responded to promptly.
0 commit comments