The Satisfiability Problem and Its Extensions
Given a statement in logic can it ever be true? This is the satisfiability problem.We will confine our attention to the propositional calculus. However, the problem also arises in the predicate calculus where it is necessary to consider if there are instantiations of the variables which make a statement true. The problem is equivalent to the inference and consistency problems mentioned in Chapter 1.
KeywordsInteger Programme Travel Salesman Problem Conjunctive Normal Form Linear Programming Relaxation Horn Clause
Unable to display preview. Download preview PDF.