boolean-logic

问题 I can't seem to find a pointer in the right direction, I am not even sure what the terms are that I should be researching but countless hours of googling seem to be spinning me in circles, so hopefully the collective hive of intelligence of Stack Overflow can help. The problem is this, I need a way to filter data in what I can only call a compound logic tree. Currently the system implements a simple AND filtering system. For example, lets say we have a dataset of people. You add a bunch of

问题 I'm writing a python program that takes a given sentence in plan English and extracts some commands from it. It's very simple right now, but I was getting some unexpected results from my command parser. After looking into it a bit, it seems my condition-logic wasn't evaluating as I intended it to. This is a really inelegant way to do it of course, and way too verbose. I'm going to be entirely restructuring it, using possibly neural networks or regular expressions or a combination of them. But

问题 Consider the following method in Java: public static boolean expensiveComputation() { for (int i = 0; i < Integer.MAX_VALUE; ++i); return false; } And the following main method: public static void main(String[] args) { boolean b = false; if (expensiveComputation() && b) { } } Logical conjunction (same as &&) is a commutative operation. So why the compiler doesn't optimize the if-statement code to the equivalent: if (b && expensiveComputation()) { } which has the benefits of using short

问题 I'm writing a function to simplify a Boolean expression. For example, Nand(A, A) == Not(A) . I've tried to implement this particular rule using pattern matching, like so: -- Operands equivalent - simplify! simplify (Nand q q) = Not (simplify q) -- Operands must be different, so recurse. simplify (Nand q q') = Nand (simplify q) (simplify q') Upon compiling, I get the error: Conflicting definitions for `q' Bound at: boolean.hs:73:21 boolean:73:29 In an equation for `simplify' I think I

问题 I want to write an if/else statement that tests if the value of a text input does NOT equal either one of two different values. Like this (excuse my pseudo-English code): var test = $("#test").val(); if (test does not equal A or B){ do stuff; } else { do other stuff; } How do I write the condition for the if statement on line 2? 回答1: Think of ! (negation operator) as "not", || (boolean-or operator) as "or" and && (boolean-and operator) as "and". See Operators and Operator Precedence. Thus: if

问题 Closed . This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 2 years ago . I have this assignment that requires me to turn a premise statement into code. The idea is that i need to print out the truth table for a premise statement. This is the premise: (((P v Q) ^ (Q -> R)) XOR (P v R)) <-> (R ^ Q) I can create a manual Truth table Truth Table for the

问题 Closed . This question needs to be more focused. It is not currently accepting answers. Want to improve this question? Update the question so it focuses on one problem only by editing this post. Closed 2 years ago . I have this assignment that requires me to turn a premise statement into code. The idea is that i need to print out the truth table for a premise statement. This is the premise: (((P v Q) ^ (Q -> R)) XOR (P v R)) <-> (R ^ Q) I can create a manual Truth table Truth Table for the

问题 Can someone please help me with this? I have been researching and trying to get this working, but I'm out of luck. All the codes I found online were not working... The output, for now, is 00, 11, 22, 33, ... FF and lop back to 00. How do I separate the first and second digit displays? Like I want it to display from 0 to 255 (00, 01, 02...FF)? Requirements: When the circuit is first energized, the seven-segment LEDs will start counting at 0x00. The duel segment LEDs will count up to 0xFF,

问题 I have a circuit made from AND NOT and OR gates, i need to convert it so that it only has NOR gates, this isn't working to well for me so any tips would be much appreciated. This is the original function to convert: ~a~b~cd + ~a~bc~d + ~ab~c~d + ~abcd + a~b~c~d + a~bcd + ab~cd + abc~d 回答1: I'm assuming cd means c AND d. The rules are: ~a = a NOR a a^b = (a NOR a) NOR (b NOR b) a+b = (a NOR b) NOR (a NOR b) From that, it's purely mechanical. I'll do the first part as an example: ~a~b~cd + ~a

问题 Should I make an analysis of reachability of parts of a graph (called rule): a node can be reached if a certain boolean condition is verified. Each node knows only its predecessor, there are different types of nodes and not all nodes have at guard a condition to be verified. The rule is placed in a file. I made ​the parsing of the rule, I have selected (through the use of discriminated union) and ordered the nodes in accordance with the flow of execution. Now, I should make a kind of static