Abstract: Embodiments relate to validating logical statements in code for domain specific languages. An aspect includes parsing logical statements and annotating constraint type logical statements with specific constraint annotations from the logical grammar of the domain specific language. A non-contradiction graph is built using specific constraint annotations constrained to represent cases satisfying the logical statements and is solved to find a case that satisfies the logical statement or prove that no such case exists, thus locating a contradiction. The non-contradiction graph is negated to form a non-tautology graph constrained to represent cases violating the logical statements and the non-tautology graph is solved to find a case that violates the logical statement or prove that no such case exists, thus locating a tautology. A report is provided regarding at least one case satisfying the logical statement and at least one case violating the logical statement whereby the logical statement is validated.