A question on transforming (some) logical program as a linear system of equalities/inequalities: Say proposition X=0 for false, X=1 for true, and likewise for all propositions, then X → Y (X leads to Y) can be written as - X + Y >= 0 As above, one may transform (some) logical program into a linea…

Solve logical program as a linear system of (in)equalities

brebs April 8, 2024, 9:25am 3

Yes - clpb.

Topic		Replies	Views
{X + Y >= 1} fails - bug? Help! clpr	1	393	March 31, 2022
Surprising result with equals dot dot Help! functor	16	1391	February 8, 2022
Solving Systems of Equations with Prolog Help!	15	1632	March 17, 2022
Beginner's quick chart of Prolog comparison predicates Nice to know	4	576	April 5, 2020
clpBNR: bug in boolean constraints Predicate	6	496	August 30, 2021