Questions tagged [boolean-computation]
Questions on the functionality of Mathematica for Boolean computation.
187 questions
50
votes
7
answers
10k
views
Intersecting graphics
Does the Mathematica graphics system have any concept of intersecting graphics? I've not found much in the documents so far. For example, if I want to show the intersection of two shapes:
...
- 24.4k
38
votes
7
answers
4k
views
Are there "All" and "Any" functions in Mathematica?
In Python, there is a function all which returns true if all of its arguments are true, and any which returns true if at least ...
- 5,001
27
votes
0
answers
2k
views
Mathematica vs. state-of-the-art SAT solvers
I found some fascinating paper by Marijn Heule and Oliver Kullmann on advances in SAT solvers and automated reasoning. In particular, the authors where able to show (a year earlier) a breakthrough ...
- 2,211
25
votes
1
answer
789
views
Why is SatisfiabilityCount faster than SatisfiableQ?
Consider the following (large) Boolean expression, which arose in a SAT problem. (The expression is not satisfiable.)
...
- 2,336
23
votes
8
answers
3k
views
Applying And to lists of Booleans
I'd like to take {True,True,False} and {True,False,False} and apply And to get ...
- 7,860
21
votes
3
answers
1k
views
How to solve the liar problem?
In an island live two kinds of people: liar and truth-teller, the former only tells lies and the latter only tells truth, now there're two men A and B from the island, A said: "B is a truth-teller." B ...
- 71.6k
19
votes
2
answers
1k
views
How can I use Mathematica to solve a complex truth-teller/liar logic problem?
I have a logic puzzle I want to convert to Mathematica to solve:
Person A states, "Exactly two people are truth-tellers,"
Person B states, "I and Person C are truth-tellers."
...
- 1,885
17
votes
3
answers
3k
views
Binary decision diagrams (BDD)
I would like to use Mathematica to help me simplify a given Binary Decision Diagram (i.e. pick the optimal variable ordering). I don't seem to find anything at all on the topic, although it is ...
- 2,500
15
votes
2
answers
2k
views
Simplify assumes Boolean 1 and 0 in logical expressions
Per this chat discussion and this previous question where I encountered the strange behaviour:
...
- 47.2k
10
votes
1
answer
1k
views
Prenex and Skolem normal forms
In Mathematica version 7, there was a big advance in logic support ("Boolean computations" is the official name). This was not further developed in version 8.0.
So now we have a fairly robust support ...
- 5,310
8
votes
3
answers
299
views
Find positions of certain value in a big boolean list
I would like to know is it possible to find positions of False in t:
...
- 428
8
votes
2
answers
2k
views
Implementation of a new Game of Life Rule
I need to implement a new "game of life" in Mathematica: I have three states — black, red and white. Black means go forward, red go back and white take no action.
I would like to implement the ...
- 85
8
votes
4
answers
233
views
How to modify a string of symbols based on the positions of $1$'s in a list of Booleans?
Given a list of Booleans:
exampleInput = {1, 1, 0, 1, 0, 0, 1, 0};
and given the string:
...
- 7,933
8
votes
2
answers
276
views
Efficient uniform sampling of certain Boolean matrices
I want to uniformly sample $(0,1)$-matrices with certain constraints. In particular, I want sum of each row to be rowsum and the sums of columns to equal ...
- 19.9k
8
votes
0
answers
226
views
FindInstance boolean program is slow, but fast with BooleanConvert
FindInstance can be incredibly slow to solve a boolean program, but it can be significantly improved by using BooleanConvert to ...
- 1,661