Whoops, 5 months ago, not six months ago. Much more reasonable to be making
this kind of fix.
On Wed, Feb 19, 2025, at 3:56 PM, Ariel Weisberg wrote:
> Hi,
>
> This does not constitute a review, but I looked at both of them to convince
> myself how they go about solving their respective problem
Hi,
This does not constitute a review, but I looked at both of them to convince
myself how they go about solving their respective problems is a good idea. I am
weakly +1. The risk reward is there, but 13 months since 5.0 was released feels
a little late to trying to improve node density instead
As a matter of fact, we are actually better than PosgreSQL here, they are
not checking if it is satisfiable at all.
A user was able to specify a check which is not satisfiable but it just
proceeded:
Table "public.users"
Column| Type |
As said earlier, I am happy to support just simple "x > 10 AND x < 100" and
be done with it.
However ... I was looking into that PDF more closely and on page 16 there
is section 6.6.1 describing "Allen's Interval Algebra". Citing:
"One form of infinite-valued CSP which has been widely studied is
sorry, I was not very clear in my mail.
I mentioned 2-SAT for 2 reasons:
1) to show that the NP-complete topic is very sensitive to definitions and
limitations, even a small change in task definition (2-clause vs 3-clause)
can affect the target complexity class a lot. Another example to show that
a
