Reference work entry
A proof is a convincing argument expressed in the language of logic and mathematics.
A sample computation to prove automatically if the propositional formula ((p ∨ (q ∧ r)) →((p ∨ q) ∧ (p ∨ r)) is valid or not is included in Fig. 1 and Table 1, using tableau reasoning ( Deduction). With respect to systems biology, one could substitute p, q, and r for, e.g., “produces glucose,” “produces carbon dioxide,” and “releases water,” respectively. The tableau method is a decision procedure that checks the existence of a model (i.e., that it can be instantiated). It exhaustively looks at all the possibilities, so that it can eventually prove that no model could be found for unsatisfiable formulas (if it is satisfiable, we have found a counterexample). This is done by decomposing the formula in top-down fashion after it has been translated into negation normal form (i.e., all the negations have been pushed inside), which can be achieved using equivalences. Further, if a model...
© Springer Science+Business Media, LLC 2013