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
In my opinion, it is not necessary now but this can be proposed first maybe we can used one day.
Nowadays pi-base use a very simple deduction logic and as we can see, the deduction is actually a SAT-problem which can be manipulated with SAT solvers.
As far as I'm aware, it just uses boolean constraint propagation at the moment. I've been interested in improving it and have done some reading on algorithms, but I haven't found the time to actually write much code recently.
In my opinion, it is not necessary now but this can be proposed first maybe we can used one day.
Nowadays pi-base use a very simple deduction logic and as we can see, the deduction is actually a SAT-problem which can be manipulated with SAT solvers.
web/packages/core/src/Logic/Prover.ts
Lines 83 to 101 in c7c979a
For example, it can be deduced P is false if I set following artificially:
The text was updated successfully, but these errors were encountered: