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
duplicities => duplicates :D Brandon spotted I was using this word some
time ago wrongly.
On Wed, Feb 19, 2025 at 6:37 AM Štefan Miklošovič
wrote:
> Great resources, thanks for that.
>
> It is not immediately obvious to me that this is 2-SAT but I do agree that
> this is a CSP (Constraint satisf
Great resources, thanks for that.
It is not immediately obvious to me that this is 2-SAT but I do agree that
this is a CSP (Constraint satisfaction problem). Merely looking into that,
my gut feeling is that this might be somehow polynomial but the examples of
practically-solvable CSPs are related
Hi, are you sure you want to go that deep? :-)
https://en.wikipedia.org/wiki/Constraint_satisfaction_problem
https://en.wikipedia.org/wiki/2-satisfiability (an example what quite a
small change in constraints can change the picture dramatically: once we
moved from 3SAT to 2SAT - it is polynomial).
Sorry, CEP-42
On Tue, Feb 18, 2025 at 8:54 PM Štefan Miklošovič
wrote:
> Hi list,
>
> We are doing good progress together with Bernardo when it comes to
> constraints which were merged recently (CEP-24).
>
> What I do now is that I try to "harden" it a little bit. If you think
> about that, a us
