The Satisfiability Problem and Its Extensions

  • H. Paul Williams
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 130)

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.


Integer Programme Travel Salesman Problem Conjunctive Normal Form Linear Programming Relaxation Horn Clause 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag US 2009

Authors and Affiliations

  1. 1.The London School of EconomicsUK

Personalised recommendations