Differences

This shows you the differences between two versions of the page.

--- teaching:cc4101:tareas:2015-2:tarea2 [2015/10/10 16:13] – [(1.3) Optimización] racruz
+++ teaching:cc4101:tareas:2015-2:tarea2 [2015/10/11 13:17] – [Motivación] racruz
@@ Line 21: / Line 21: @@
 <code scheme>
-(<=> (=> p q) (or (¬ p) q))
+(<=> (=> p q) (or (not p) q))
 </code>
@@ Line 30: / Line 30: @@
 <code scheme>
-(<=> (=> p q) (or p (¬ q)))
+(<=> (=> p q) (or p (not q)))
 </code>
@@ Line 147: / Line 147: @@
 > (satisfiable? (parse-expr '(or p q)))
 #t
-> (satisfiable? (parse-expr '(and p (not p)))))
+> (satisfiable? (parse-expr '(and p (not p))))
 #f
 > (satisfiable? (parse-expr '(<=> (=> p q) (or p q))))
 #t
-> (satisfiable? (parse-expr '(<=> (=> p q) (and p (not q))))))
+> (satisfiable? (parse-expr '(<=> (=> p q) (and p (not q)))))
 #f
 </code>
@@ Line 166: / Line 166: @@
     * ¬¬p <=> p
   Con esto se puede asegurar que en un programa válido, después de las negaciones ¬ no aparecen las expresiones: v, ^, ∀, ∃, ¬. Entiéndase programa válido (a este nivel), aquellos programas que no contienen operaciones invalidas como ''%%(+ #f 1)%%''. Ejemplos: <code scheme>
-> (simplify-negations (parse-expr '(¬ (or (¬ p) (¬ q)))))
+> (simplify-negations (parse-expr '(not (or (not p) (not q)))))
 (my-and (id 'p) (id 'q))
-> (simplify-negations (parse-expr '(¬ (¬ (¬ (or p q))))))
+> (simplify-negations (parse-expr '(not (not (not (or p q))))))
 (my-and (my-not (id 'p)) (my-not (id 'q)))
     </code>