Added a warning to QMaxSAT in case someone does not store the qmaxsat binary at /bin/qmaxsat

Added TreeGrammarDecomposition.scala, which implements the trat-n grammar decomposition method from Stefan and Sebastian
for a later usage in the n-cutIntroduction. Status: Not finished, yet.

git-svn-id: http://gapt.googlecode.com/svn/trunk@2083 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
changed qmaxsat that the binary requires to be put somewhere on the PATH than in /bin/

git-svn-id: http://gapt.googlecode.com/svn/trunk@2084 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Implemented left-to-right part of the reduction to MinCostSAT in TreeGrammarDecomposition.scala, not yet tested

git-svn-id: http://gapt.googlecode.com/svn/trunk@2085 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a bug in qmaxsat

git-svn-id: http://gapt.googlecode.com/svn/trunk@2086 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a wrong type declaration in QMaxSAT
fixed a few bugs in TreeGrammarDecomposition, regarding the generation of the MinCostSAT Formulation

git-svn-id: http://gapt.googlecode.com/svn/trunk@2087 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Major bug fix in TreeGrammarDecomposition: mixed up some indexes of non-terminals, slightly wrong computation of suffKeys, 2 errors in the MinCostSAT formulation found.

The reduction is still not correctly implemented, due to UNSAT of a very simple instance, but converges.


git-svn-id: http://gapt.googlecode.com/svn/trunk@2088 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
Fixed a bug and
added extended debug output to TreeGrammarDecomposition

git-svn-id: http://gapt.googlecode.com/svn/trunk@2089 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a bug in TreeGrammarDecomposition, leading to an unsatisfiable MinCostSAT formula

git-svn-id: http://gapt.googlecode.com/svn/trunk@2090 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
merged olivier's push to scala 2.11. thanks a lot! 

git-svn-id: http://gapt.googlecode.com/svn/trunk@2091 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
small bugfix in ceres(schema), started removing Pair deprecation warnings

git-svn-id: http://gapt.googlecode.com/svn/trunk@2093 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
removing intellij project file

git-svn-id: http://gapt.googlecode.com/svn/trunk@2094 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
added commutativity of + example

git-svn-id: http://gapt.googlecode.com/svn/trunk@2095 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
added debug messages in latex math format for MinCostSAT formulation

git-svn-id: http://gapt.googlecode.com/svn/trunk@2097 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed 2 major bugs resulting in a wrong MinCostSAT formulation
Getting now the right formulas for n=1

git-svn-id: http://gapt.googlecode.com/svn/trunk@2098 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a bug in TreeGrammarDecomposition when dealing with cases where n>2 (n = number of non-terminals)

git-svn-id: http://gapt.googlecode.com/svn/trunk@2099 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
refactored the documentation as well as the code of TreeGrammarDecomposition

git-svn-id: http://gapt.googlecode.com/svn/trunk@2100 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a bug by reverting resulting in wrong grammars
fixed an issue with languages, where we have to deal with non-linear term growing

git-svn-id: http://gapt.googlecode.com/svn/trunk@2101 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
fixed a bug in TreeGrammarDecompositions method for calculating normform and characteristic partitions, resulting in a wrong set of keys in cases of n >= 2

git-svn-id: http://gapt.googlecode.com/svn/trunk@2102 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
slight code clean up in TreeGrammarDecomposition
added ncutIntro to the cli
added NCutIntroduction
still not usable due to a NullPointerException in NCutIntroduction

git-svn-id: http://gapt.googlecode.com/svn/trunk@2103 85d21ef8-add0-11de-ae77-5bfb9c5a3f34
refactored TreeGrammarDeccomposition for implementing another formulation for MinCostSAT

git-svn-id: http://gapt.googlecode.com/svn/trunk@2104 85d21ef8-add0-11de-ae77-5bfb9c5a3f34