Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [constraint-satisfaction]

154 questions
15
votes
2 answers

What is Least-Constraining-Value?

In constraint satisfaction problems, heuristics can be used to improve the performance of a bactracking solver. Three commonly given heuristics for simple backtracking solvers are: Minimum-remaining-values (how many values are still valid for this…
zstewart
  • 251
  • 1
  • 2
  • 4
11
votes
1 answer

Algorithm to create dense style crossword puzzles

I am working on creating a program to generate dense American style crossword puzzles of grid sizes between 15x15 - 30x30. The database of words I'm using ranges between 20,000 and 100,000 words of all varying lengths. The current algorithm I'm…
219CID
  • 211
  • 2
  • 5
8
votes
2 answers

Algorithm for solving planar constraint problem ("Pokemon Go monster finding")

[Note: This problem was inspired by Pokemon Go. I will first explain the problem in mathematical terms, then explain the connection to Pokemon Go. My goal is not to cheat in the game. If I wanted to cheat, better information would be available more…
Sami Liedes
  • 393
  • 1
  • 4
8
votes
2 answers

SAT algorithm for determining if a graph is disjoint

What are some good algorithms to have a SAT (CNF) solver determine if a given graph is fully-connected or disjoint? The best one I can think of is this: Number the nodes 1..N, where N is the number of nodes in the graph. define N^2 variables with…
onigame
  • 203
  • 1
  • 5
7
votes
1 answer

Aren’t most constraining variable and least constraining value the exact opposite?

So aren’t MCV and LCV the exact opposite?MCV tries to choose the variable with the most constraints on remaining variables but LCV is opposite: it tries to rule out as least values for other variables as possible
user94485
7
votes
0 answers

complexity of a Constraint Satisfaction Promise Problem

Due to curiosity regarding possible extensions of Schaefer's dichotomy theorem, I wound up considering the "promise constraint" with 3 boolean inputs that's given by $C(x,y,z) ​ ​ = \hspace{.1 in}\begin{cases} \hspace{.19 in}\text{ True} & \text{ if…
user12859
6
votes
1 answer

Small world theorem for set constraints

Let $S_1,\dots,S_n$ be variables representing unknown sets. A set expression has the form $S_i$, $\overline{E}$ (the complement of $E$), or $E \cap E'$, where $E,E'$ are set expressions. A constraint has the form $E = \emptyset$ or $E \ne…
D.W.
  • 167,959
  • 22
  • 232
  • 500
6
votes
2 answers

Why don't modern SAT solvers use the notion of a "watched clause", in the same way they use the notion of a "watched literal"?

Modern SAT solvers use the notion of "watched literals": when a value is chosen for a literal $l$, the solver only checks whether that falsifies clauses with $l$ in them if $l$ is one of the watched literals in the clause. This prevents checking…
user118967
  • 651
  • 5
  • 13
5
votes
1 answer

Subgraph isomorphism on star multi-graphs with labelled edges

My approach to the problem has been to reformulate it into something more recognizable, but I don't know the best way to solve the reformulated problems either. I list the original problem, an example, and two reformulations below. The second…
Moormanly
  • 163
  • 6
5
votes
0 answers

Heuristic Repair and N-Queens Problem

Problem: I am trying to solve the $N$-Queens problem using Constraint Satisfaction and Heuristic Repair (also known as Min-Conflicts). I wrote a program to do this for any given $N$ queens and $N * N$ board. I observed that a solution should be…
Regan Koopmans
  • 265
  • 1
  • 9
5
votes
3 answers

How do we place $8n$ objects in a grid of size $n \times n$?

How do we place $8n$ objects on a square of size $n\times n$ in a form of grid such that no 4 of them form a rectangle with sides parallel to those of square? Each object occupies exactly one cell in the grid and two objects cannot occupy the same…
Viplaw Srivastava
  • 97
  • 6
5
votes
1 answer

Sorting strings with "before" and "after" constraints

I'm trying to solve a constraint-satisfaction problem for a project of mine that seems like it should have a well-known solution, but I can't for the life of me seem to find it described anywhere. I've been poring over what literature I can find…
sripberger
  • 153
  • 3
4
votes
2 answers

How could an SMT solver be implemented as simple as possible?

I'm trying to figure out how an SMT solver works as simple as possible. Let's assume we have a simple input program with symbolic values x and y. E.g. if (x+y < 20) { if (x > 10) { if (y > 10) { assume(false); } } } Here…
racc44
  • 667
  • 2
  • 7
  • 11
4
votes
1 answer

Efficient algorithm for simple constraint satisfaction problem

There are $k$ Boolean variables $x_1, x_2, \dots, x_k$. $m$ arbitrary subsets of these variables such that sum of each set equals to $1$ (i.e., only one variable is $1$, the others are $0$). E.g., one of $m$ constraints may be $x_1 + x_3 + x_5 +…
Ersin 101
  • 83
  • 5
4
votes
0 answers

(Historical perspective) CSP and SAT inter-fertilization

[Disclaimer: this is a rather specialized question] It is known that techniques like Conflict-Driven Clause Learning (CDCL) and back-jumping -- which improved the Satisfiability (SAT) strategies exponentially -- were actually inspired [2] by…
ZakC
  • 141
  • 1
1
2 3
…
10 11