From 196e9c1e47c827b6e45c6a8e331774ed33274fb6 Mon Sep 17 00:00:00 2001 From: Markus Triska Date: Fri, 3 Feb 2023 20:44:11 +0100 Subject: [PATCH] DOC: teletype font for reification --- src/lib/clpz.pl | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/src/lib/clpz.pl b/src/lib/clpz.pl index 0e860bf3..5823aa42 100644 --- a/src/lib/clpz.pl +++ b/src/lib/clpz.pl @@ -895,13 +895,13 @@ their truth values into Boolean values represented by the integers 0 and 1. Let P and Q denote reifiable constraints or Boolean variables, then: -| #\ Q | True iff Q is false | -| P #\/ Q | True iff either P or Q | -| P #/\ Q | True iff both P and Q | -| P #\ Q | True iff either P or Q, but not both | -| P #<==> Q | True iff P and Q are equivalent | -| P #==> Q | True iff P implies Q | -| P #<== Q | True iff Q implies P | +| `#\ Q` | True iff Q is false | +| `P #\/ Q` | True iff either P or Q | +| `P #/\ Q` | True iff both P and Q | +| `P #\ Q` | True iff either P or Q, but not both | +| `P #<==> Q` | True iff P and Q are equivalent | +| `P #==> Q` | True iff P implies Q | +| `P #<== Q` | True iff Q implies P | The constraints of this table are reifiable as well. -- 2.54.0