Benchmarks: Pebbling

[akinanop]

Write a script for generating arbitrary Pebbling problems in Extended DIMACS format. Thanks for collaboration! :star:

[ankarpenko]

ni4ka,

що таке indegree and outdegree?

2016-05-01 20:14 GMT+02:00 Nika Pona notifications@github.com:

Assigned #4 https://github.com/akinanop/mvl-solver/issues/4 to @ankarpenko https://github.com/ankarpenko.

— You are receiving this because you were mentioned. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#event-646950398

[akinanop]

Правильне питання! indegree of a vertex is the number of the ingoing edges from this vertex, outdegree - the number of the outgoing edges from the vertex.

On Mon, May 2, 2016 at 1:13 PM, ankarpenko notifications@github.com wrote:

ni4ka,

що таке indegree and outdegree?

2016-05-01 20:14 GMT+02:00 Nika Pona notifications@github.com:

Assigned #4 https://github.com/akinanop/mvl-solver/issues/4 to @ankarpenko https://github.com/ankarpenko.

— You are receiving this because you were mentioned. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#event-646950398

— You are receiving this because you authored the thread. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#issuecomment-216206353

[ankarpenko]

Нічко, коли я створюю солвер by "make" у відповідь отримую таке :

g++ -g -c GenBenFunc.cc make: g++: Command not found make: *\ [GenBenFunc.o] Error 127

він не створився, правильно?

2016-05-02 16:42 GMT+02:00 Nika Pona notifications@github.com:

Правильне питання! indegree of a vertex is the number of the ingoing edges from this vertex, outdegree - the number of the outgoing edges from the vertex.

On Mon, May 2, 2016 at 1:13 PM, ankarpenko notifications@github.com wrote:

ni4ka,

що таке indegree and outdegree?

2016-05-01 20:14 GMT+02:00 Nika Pona notifications@github.com:

Assigned #4 https://github.com/akinanop/mvl-solver/issues/4 to @ankarpenko https://github.com/ankarpenko.

— You are receiving this because you were mentioned. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#event-646950398

— You are receiving this because you authored the thread. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#issuecomment-216206353

— You are receiving this because you were mentioned. Reply to this email directly or view it on GitHub https://github.com/akinanop/mvl-solver/issues/4#issuecomment-216253926

[akinanop]

Не створився. У тебе не встановлений g++? Перевір! (В архіві в головній папці є вже готовий бінарний файл Solver, яким можна користуватись. Спробуй, наприклад, ./Solver -solvenc -var 4 -clause 16 -file "example_SAT").

[ankarpenko]

встановила g++, тепер : g++ -g -c GenBenFunc.cc make: *\ No rule to make target Boolean2Finite.cc', needed byBoolean2Finite.o'. Stop.

коли користуєшся готовим, то пише таке : bash: ./Solver: cannot execute binary file: Exec format error

[ankarpenko]

ni4ko, check understanding, please.

[akinanop]

Мені здається, що твої приклади не підходять під визначення. Там на початку у визначенні написано: "A pebbling graph is a finite acyclic directed graph whose nodes are clauses – with no variables in common between clauses ". Тобто 3=1 не має з’являтись в інших nodes.

[akinanop]

Розпишеш окремо, що в твоїх прикладах pebbling graph, pebbling та pebbling problem, ок? Бо я не впевнена, чи я правильно зрозуміла твоє розуміння :cactus:

[ankarpenko]

все правильно, дякую! no variables in common я проігнорувала як умову

[ankarpenko]

new question :

is that fine if initial pebbling graph (for which we need to construct a problem) is equally given in DIMACS format ?

[akinanop]

If it is possible, yes. Otherwise, invent your own similar format (e.g., see https://github.com/akinanop/mvl-solver/wiki/CCG-format).