The basis of the proposed project is an Automated Reasoning system developed at the University of Karlsruhe, that makes use of the idea of combining semantic tableaux and integer programming (IP): A formula (propositional or first-order) is transformed into an IP problem, and then IP methods are used to check whether the formula is satisfiable. The objective of this project is to extend the existing implementatio] (available when the project starts) and to unveil strongholds and problems of the method. Strategies and heuristics will be developed to utilize advantages, overcome problems and, thus, improve the method. This is an important and critical phase in the development of an Automated Reasoning system - even more in this case, since a calculus is implemented that has not been used before.
In addition, a method will be developed for extending the combination of semantic tableaux and IP to handle first-order logic with equality.