Stable models of logic programs

A logic program is a set of symbolic expressions called “rules”. Stable models of a logic program are defined as the fixpoints of an anti-monotone operator on sets of atomic symbols that is associated with this program. The concept of a stable model was originally introduced for describing the behavior of the programming system PROLOG. In recent years, it led to the development of a new approach to solving combinatorial search problems. We show how some concepts of graph theory can be represented in terms of stable models.