User Manual - mazmaz2k/Modular-Construction-of-Minimal-Models GitHub Wiki

This product will find minimal model of SAT problem in N-CNF form

About The Product:

This is an java project,in this project we implement the algorithm that finds an exponential time solution at the component size in the largest binding, for which the binding component is the size of the graph and therefore the running time will be significantly larger i.e. the exponential size of the large binding component.

How To Install:

  • You can install the alpha release or the final release by your choose

  • Download the final release application - just fork this project.

  • Install the application on the device by tapping on it and accept with all the require terms.

  • Run the application on Eclipse IDE.

How To Use Modular-Construction-of-Minimal-Models:

  • You will need txt file within set of clauses, each variable is a number("0" cant be a variable) , separate each rule with "0" number.In the beginning you will need to write(in the txt file) how many rules(clauses) there is.

  • Run the application .

  • you have to change the txt file "CnfFile.txt" with the following rules.

  • First line is to write the number of rules.

  • after every rules are in separate line when "0" is mark that end of line

  • body are negative integers head are positive integers

  • The result is that you will see if there is minimal module it will find it, if not it will write that can find.

How To Use Minimal balanced node separator:

  • If you would like to run ONLY to graph separator algorithm you have to do the following:

  • Run the readGraphFromFileNewAlgorithm.java class which is in Test package.

  • you can change the txt file "GraphFile.txt" with the following rules.

  • in every line the first number is an vertex that edge is coming out to every one of the next number in the same line for example if one line is written 1 2 77 9 it says that there is an edges from : 1->2, 1->77, 1->9. don't forget it is a directed graph

Bug Report:

For report any bugs issue or any other problem with project,

Please contact us at email: [email protected] or by opening an issue at github.

To View The Bugs History click here.

⚠️ **GitHub.com Fallback** ⚠️