1. Forum
  2. Usenet
  3. COMP.LANG.PROLOG

  • Re: Lets make 2021 the year of Solver Cooperation

    From Mostowski Collapse@21:1/5 to Mostowski Collapse on Tue Aug 2 14:52:54 2022
    For example Markus Triskas CLP(B) can show BDD trees:

    ?- set_prolog_flag(clpb_residuals, bdd).
    true.

    ?- sat(X#Y).
    node(3)- (v(X, 0)->node(2);node(1)),
    node(1)- (v(Y, 1)->true;false),
    node(2)- (v(Y, 1)->false;true).

    Can I store such a thingy in a clause for p/2 and use it
    with different values for X and Y, during multiple invocations?

    Mostowski Collapse schrieb am Dienstag, 2. August 2022 um 23:52:06 UTC+2:
    Agenda for 2023:

    How can a boolean formula be a map? Well if we take some input
    propositional variables x1,…,xn and view the rest of the propositional variables y1,…,ym in the formula as output, we get a relation.

    The problem is a little bit to treat this boolean formula as a stored procedure. None of the CLP(B) I have seen so far offer something
    explicitly to this end. When I define a predicate as follows:

    p(X, Y) :- /* some CLP(B) code */

    I have never seen a CLP(B) precompile and store the result in the
    clause of p/2. On the other hand SQL knows for example stored
    procedures, and it can do some optimizations ahead.
    Dhu on Gate schrieb am Sonntag, 14. März 2021 um 16:38:07 UTC+1:
    On Sat, 06 Mar 2021 08:03:14 -0800, Mostowski Collapse wrote:

    A more suitable view would be possibly to abandon classical
    logic, and consider (#=)/2 and (#\=)/2 not opposites of each
    other. Rather both being relations over the domain Integer x
    Integer, that would fail outside of the domain.
    Just a brain-fart, but I think this is an interesting and useful path
    of thought:

    black and white are only "opposites" in a context. From the outside they're,... some interesting optical properties?

    Dhu

    --
    Je suis Canadien. Ce n'est pas Francais ou Anglaise.
    C'est une esp`ece de sauvage: ne obliviscaris, vix ea nostra voco;-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Mostowski Collapse@21:1/5 to Dhu on Gate on Tue Aug 2 14:52:04 2022
    Agenda for 2023:

    How can a boolean formula be a map? Well if we take some input
    propositional variables x1,…,xn and view the rest of the propositional variables y1,…,ym in the formula as output, we get a relation.

    The problem is a little bit to treat this boolean formula as a stored procedure. None of the CLP(B) I have seen so far offer something
    explicitly to this end. When I define a predicate as follows:

    p(X, Y) :- /* some CLP(B) code */

    I have never seen a CLP(B) precompile and store the result in the
    clause of p/2. On the other hand SQL knows for example stored
    procedures, and it can do some optimizations ahead.

    Dhu on Gate schrieb am Sonntag, 14. März 2021 um 16:38:07 UTC+1:
    On Sat, 06 Mar 2021 08:03:14 -0800, Mostowski Collapse wrote:

    A more suitable view would be possibly to abandon classical
    logic, and consider (#=)/2 and (#\=)/2 not opposites of each
    other. Rather both being relations over the domain Integer x
    Integer, that would fail outside of the domain.
    Just a brain-fart, but I think this is an interesting and useful path
    of thought:

    black and white are only "opposites" in a context. From the outside they're,... some interesting optical properties?

    Dhu

    --
    Je suis Canadien. Ce n'est pas Francais ou Anglaise.
    C'est une esp`ece de sauvage: ne obliviscaris, vix ea nostra voco;-)

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)