View source for Cifrão

{{distinguish|circumscribe}}
'''Circumscription''' is a [[non-monotonic logic]] created by [[John McCarthy (computer scientist)|John McCarthy]] to formalize the [[common sense]] assumption that things are as expected unless otherwise specified. Circumscription was later used by McCarthy in an attempt to solve the [[frame problem]]. In its original [[first-order logic]] formulation, circumscription minimizes the [[extension (semantics)|extension]] of some predicates, where the extension of a predicate is the set of tuples of values the predicate is true on. This minimization is similar to the [[closed world assumption]] that what is not known to be true is false.

The original problem considered by McCarthy was that of [[missionaries and cannibals problem|missionaries and cannibals]]: there are three missionaries and three cannibals on one bank of a river; they have to cross the river using a boat that can only take two, with the additional constraint that cannibals must never outnumber the missionaries on either bank (as otherwise the missionaries would be killed and, presumably, eaten). The problem considered by McCarthy was not that of finding a sequence of steps to reach the goal (the article on the [[missionaries and cannibals problem]] contains one such solution), but rather that of excluding conditions that are not explicitly stated. For example, the solution &ldquo;go half a mile south and cross the river on the bridge&rdquo; is intuitively not valid because the statement of the problem does not mention such a bridge. On the other hand, the existence of this bridge is not excluded by the statement of the problem either. That the bridge does not exist is
a consequence of the implicit assumption that the statement of the problem contains everything that is relevant to its solution. Explicitly stating that a bridge does not exist is not a solution to this problem, as there are many other exceptional conditions that should be excluded (such as the presence of a rope for fastening the cannibals, the presence of a larger boat nearby, etc.)

Circumscription was later used by McCarthy to formalize the implicit assumption of [[inertia]]: things do not change unless otherwise specified.  Circumscription seemed to be useful to avoid specifying that conditions are not changed by all actions except those explicitly known to change them; this is known as the [[frame problem]]. However, the solution proposed by McCarthy was later shown leading to wrong results in some cases, like in the [[Yale shooting problem]] scenario. Other solutions to the frame problem that correctly formalize the Yale shooting problem exist; some use circumscription but in a different way .  

==The propositional case==

While circumscription was initially defined in the first-order logic case, the particularization to the propositional case is easier to define. Given a [[propositional formula]] <math>T</math>, its circumscription is the formula having only the [[Structure (mathematical logic)|models]] of <math>T</math> that do not assign a variable to true unless necessary.

Formally, propositional models can be represented by sets of [[propositional variable]]s; namely, each model is represented by the set of propositional variables it assigns to true. For example, the model assigning true to <math>a</math>, false to <math>b</math>, and true to <math>c</math> is represented by the set <math>\{a, c\}</math>, because <math>a</math> and <math>c</math> are exactly the variables that are assigned to true by this model.

Given two models <math>M</math> and <math>N</math> represented this way, the condition <math>N \subseteq M</math> is equivalent to <math>M</math> setting to true every variable that <math>N</math> sets to true. In other words, <math>\subseteq</math> models the relation of &ldquo;setting to true less variables&rdquo;. <math>N \subset M</math> means that <math>N \subseteq M</math> but these two models do not coincide.

This lets us define models that do not assign variables to true unless necessary.
A model <math>M</math> of a [[Theory (logic)|theory]] <math>T</math> is called '''minimal''', if and only if there is no model
<math>N</math> of <math>T</math> for which <math>N \subset M</math>. 

Circumscription is expressed by selecting only the minimal models. It is defined as follows:

:<math>CIRC(T) = \{ M ~|~ M \mbox{ is a minimal model of } T \}</math>

Alternatively, one can define <math>CIRC(T)</math> as a formula having exactly the above set of models; furthermore, one can also avoid giving a definition of <math>CIRC</math> and only define minimal inference as <math>T \models_M Q</math> if and only if every minimal model  of <math>T</math> is also a model of <math>Q</math>.

As an example, the formula <math>T=a \land (b \lor c)</math> has three models:

# <math>a</math>, <math>b</math>, <math>c</math> are true, i.e. <math>\{a,b,c\}</math>;
# <math>a</math> and <math>b</math> are true, <math>c</math> is false, i.e. <math>\{a,b\}</math>;
# <math>a</math> and <math>c</math> are true, <math>b</math> is false, i.e. <math>\{a,c\}</math>.

The first model is not minimal in the set of variables it assigns to true. Indeed, the second model makes the same assignments except for <math>c</math>, which is assigned to false and not to true. Therefore, the first model is not minimal. The second and third models are incomparable: while the second assigns true to <math>b</math>, the third assigns true to <math>c</math> instead. Therefore, the models circumscribing <math>T</math> are the second and third models of the list. A propositional formula having exactly these two models is the following one:

:<math>a \land \neg (b \leftrightarrow c)</math>

Intuitively, in circumscription a variable is assigned to true only if this is necessary. Dually, if a variable '''can''' be false, it '''must''' be false. For example, at least one of <math>b</math> and <math>c</math> must be assigned to true according to <math>T</math>; in the circumscription exactly one of the two variables must be true. The variable <math>a</math> cannot be false in any model of <math>T</math> and neither of the circumscription.

==Fixed and varying predicates==

The extension of circumscription with fixed and varying predicates is due to [[Vladimir Lifschitz]]. The idea is that some conditions are not to be minimized. In propositional logic terms, some variables are not to be falsified if possible. In particular, two kind of variables can be considered:

; varying : these are variables that are not to be taken into account at all in the course of minimization;

; fixed : these are variables considered fixed while doing a minimization; in other words, minimization can be done only by comparing models with the same values of these variables.

The difference is that the value of the varying conditions are simply assumed not to matter. The fixed conditions instead characterize a possible situation, so that comparing two situations where these conditions have different value makes no sense.

Formally, the extension of circumscription that incorporate varying and fixed variables is as follows, where <math>P</math> is the set of variables to minimize, <math>Z</math> the fixed variables, and the varying variables are those not in <math>P \cup Z</math>:

:<math>\text{CIRC}(T;P,Z) = \{ M ~|~ M \models T \text{ and }
\not\exists N \text{ such that } N \models T ,~  N \cap P  \subset M \cap P \text{ and } N \cap Z = M \cap Z \}</math>

In words, minimization of the variables assigned to true is only done for the variables in <math>P</math>; moreover, models are only compared if the assign the same values on the variables of <math>Z</math>. All other variables are not taken into account while comparing models.

The solution to the frame problem proposed by McCarthy is based on circumscription with no fixed conditions. In the propositional case, this solution can be described as follows: in addition to the formulae directly encoding what is known, one also define new variables representing changes in the values of the conditions; these new variables are then minimized.

For example, of the domain in which there is a door that is closed at time 0 and in which the action of opening the door is executed at time 2, what is explicitly known is represented by the two formulae:

:<math>\neg \text{open}_0</math>
:<math>\text{true} \rightarrow \text{open}_2</math>

The frame problem shows in this example as the problem that <math>\neg open_1</math> is not a consequence of the above formulae, while the door is supposed to stay closed until the action of opening it is performed. Circumscription can be used to this aim by defining new variables <math>change\_open_t</math> to model changes and then minimizing them:

:<math>\text{change open}_0 \equiv (\text{open}_0 \not\equiv \text{open}_1)</math>
:<math>\text{change open}_1 \equiv (\text{open}_1 \not\equiv \text{open}_2)</math>
: ...

As shown by the [[Yale shooting problem]], this kind of solution does not work. For example, <math>\neg \text{open}_1</math> is not yet entailed by the circumscription of the formulae above: the model in which <math>\text{change open}_0</math> is true and <math>\text{change open}_1</math> is false is incomparable with the model with the opposite values. Therefore, the situation in which the door becomes open at time 1 and then remains open as a consequence of the action is not excluded by circumscription.

Several other formalizations of dynamical domains not suffering from such problems have been developed (see [[frame problem]] for an overview). Many use circumscription but in a different way.

==Predicate circumscription==

The original definition of circumscription proposed by McCarthy is about first-order logic. The role of variables in propositional logic (something that can be true or false) is played in first-order logic by predicates. Namely, a propositional formula can be expressed in first-order logic by replacing each propositional variable with a predicate of zero arity (i.e., a predicate with no arguments). Therefore, minimization is done on predicates in the first-order logic version of circumscription: the circumscription of a formula is obtained forcing predicates to be false whenever possible.  

Given a first-order logic formula <math>T</math> containing a [[Predicate (logic)|predicate]] <math>P</math>, circumscribing this predicate amounts to selecting only the models of <math>T</math> in which <math>P</math> is assigned to true on a minimal set of tuples of values. 

Formally, the ''extension'' of a predicate in a first-order model is the set of tuples of values this predicate assign to true in the model. First-order models indeed includes the evaluation of each predicate symbol; such an evaluation tells whether the predicate is true or false for any possible value of its arguments. Since each argument of a predicate must be a term, and each term evaluates to a value, the models tells whether <math>P(v_1,\ldots,v_n)</math> is true for any possible tuple of values <math>\langle v_1,\ldots,v_n \rangle</math>. The extension of <math>P</math> in a model is the set of tuples of terms such that <math>P(v_1,\ldots,v_n)</math> is true in the model.

The circumscription of a predicate <math>P</math> in a formula <math>T</math> is obtained by selecting only the models of <math>T</math> with a minimal extension of <math>P</math>. For example, if a formula has only two models, differing only because <math>P(v_1,\ldots,v_n)</math> is true in one and false in the second, then only the second model is selected. This is because <math>\langle v_1,\ldots,v_n \rangle</math> is in the extension of <math>P</math> in the first model but not in the second.

The original definition by McCarthy was syntactical rather than semantical. Given a formula <math>T</math> and a predicate <math>P</math>, circumscribing <math>P</math> in <math>T</math> is the following second-order formula:

:<math>T(P) \wedge \forall p \neg (T(p) \wedge p<P)</math>

In this formula <math>p</math> is a predicate of the same arity as <math>P</math>. This is a second-order formula because it contains a quantification over a predicate. The subformula <math>p<P</math> is a shorthand for:

:<math>\forall x (p(x) \rightarrow P(x)) \wedge 
\neg \forall x (P(x) \rightarrow p(x))</math>

In this formula, <math>x</math> is a n-tuple of terms, where n is the arity of <math>P</math>. This formula states that extension minimization has to be done: in order for a truth evaluation on <math>P</math> of a model being considered, it must be the case that no other predicate <math>p</math> can assign to false every tuple that <math>P</math> assigns to false and yet being different from <math>P</math>.

This definition only allows circumscribing a single predicate. While the extension to more than one predicate is trivial, minimizing the extension of a single predicate has an important application: capturing the idea that things are usually as expected. This idea can be formalized by minimized a single predicate expressing the abnormality of situations. In particular, every known fact is expressed in logic with the addition of a literal <math>\neg Abnormal(...)</math> stating that the fact holds only in normal situations.  Minimizing the extension of this predicate allows for reasoning under the implicit assumption that things are as expected (that is, they are not abnormal), and that this assumption is made only if possible (abnormality can be assumed false only if this is consistent with the facts.)

==Pointwise circumscription==

Pointwise circumscription is a variant of first-order circumscription that has been introduced by [[Vladimir Lifschitz]]. In the propositional case, pointwise and predicate circumscription coincide. The rationale of pointwise circumscription it minimize the value of a predicate for each tuple of values separately, rather than minimizing the extension of the predicate. For example, there are two models of <math>P(a) \equiv P(b)</math> with domain <math>\{a,b\}</math>, one setting <math>P(a)=P(b)=false</math> and the other setting <math>P(a)=P(b)=true</math>. Since the extension of <math>P</math> in the first model is <math>\emptyset</math> while the extension for the second is <math>\{a,b\}</math>, circumscription only selects the first model.

In pointwise circumscription, each tuple of values is considered separately. For example, in the formula <math>P(a) \equiv P(b)</math> one would consider the value of <math>P(a)</math> separately from <math>P(b)</math>. A model is minimal only it is not possible to turn any such value from true to false while still satisfying the formula. As a result, the model in which <math>P(a)=P(b)=true</math> is selected by pointwise circumscription because turning only <math>P(a)</math> into false does not satisfy the formula, and the same happens for <math>P(b)</math>.

==Domain and formula circumscription==

An earlier formulation of circumscription by McCarthy is based on minimizing the [[Domain (mathematics)|domain]] of first-order models, rather than the extension of predicates.  Namely, a model is considered less than another if it has a smaller domain, and the two models coincide on the evaluation of the common tuples of values. This version of circumscription can be reduced to predicate circumscription.

Formula circumscription was a later formalism introduced by McCarthy. This is a generalization of circumscription in which the extension of a formula is minimized, rather than the extension of a predicate. In other words, a formula can be specified so that the set of tuples of values of the domain that satisfy the formula is made as small as possible.

==Theory curbing==

Circumscription does not always correctly handle disjunctive information. [[Raymond Reiter|Ray Reiter]] provided the following example: a coin is tossed over a checkboard, and the result is that the coin is either on a black area, or on a white area, or both. However, there are a large number of other possible places where the coin is not supposed to be on; for example, it is implicit that the coin is not on the floor, or on the refrigerator, or on the moon surface. Circumscription can therefore be used to minimize the extension of <math>On</math> predicate, so that <math>On(\text{coin},\text{moon})</math> is false even if this is not explicitly stated.

On the other hand, the minimization of the <math>On</math> predicate leads
to the wrong result that the coin is either on a black area or on a white area, ''but not both''. This is because the models in which <math>On</math> is true only on <math>(\text{coin},\text{white area})</math> and only on <math>(\text{coin},\text{black area})</math> have a minimal extension of <math>On</math>, while the model in which the extension of <math>On</math> is composed of both pairs is not minimal.

Theory curbing is a solution proposed by [[Thomas Eiter]], [[Georg Gottlob]], and [[Yuri Gurevich]]. The idea is that the model that circumscription fails to select, the one in which both <math>On(\text{coin},\text{white area})</math> and <math>On(\text{coin},\text{black area})</math> are true, is a model of the formula that is greater (w.r.t. the extension of <math>On</math>) than both the two models that are selected. More specifically, among the models of the formula, the excluded model is the least upper bound of the two selected models. Theory curbing selects such least upper bounds models in addition to the ones selected by circumscription. This inclusion is done until the set of models is closed, in the sense that it includes all least upper bounds of all sets of models it contains.

== See also ==

* [[Defeasible reasoning]]
* [[Preferential entailment]]

==References==
{{refbegin}}

*{{cite journal |first=M. |last=Cadoli |title=The complexity of model checking for circumscriptive formulae |journal=Information Processing Letters |volume=44 |issue=3 |pages=113–8 |date=November 1992 |doi=10.1016/0020-0190(92)90049-2 |url=http://www.sciencedirect.com/science/article/pii/0020019092900492}}

*{{cite journal |first1=M. |last1=Cadoli |first2=M. |last2=Lenzerini |title=The complexity of propositional closed world reasoning and circumscription |journal=Journal of Computer and System Sciences |volume=48 |issue=2 |pages=255–310 |date=April 1994 |doi=10.1016/S0022-0000(05)80004-2 |url=http://www.sciencedirect.com/science/article/pii/S0022000005800042}}

*{{cite journal |first1=T. |last1=Eiter |first2=G. |last2=Gottlob |title=Propositional circumscription and extended closed world reasoning are \Pi^p_2-complete |journal=Theoretical Computer Science |volume=114 |issue=2 |pages=231–245 |date=June 1993 |doi=10.1016/0304-3975(93)90073-3 |url=http://www.sciencedirect.com/science/article/pii/0304397593900733}}

*{{cite book |first1=T. |last1=Eiter |first2=G. |last2=Gottlob |first3=Y. |last3=Gurevich |chapter=CURB your theory! |chapterurl= |editor-first=Ruzena |editor-last=Bajcsy |title=IJCAI-93: proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Chambéry, France, August 28–September 3, 1993 |publisher=IJCAII |date=1993 |isbn=155860300X |pages=634–9 }}

*{{cite journal |first=V. |last=Lifschitz |title=Closed-world databases and circumscription |journal=Artificial Intelligence |volume=27 |issue= |pages=229–235 |date=November 1985 |doi=10.1016/0004-3702(85)90055-4 |url=http://www.sciencedirect.com/science/article/pii/0004370285900554}}

*{{cite book |first=V. |last=Lifschitz |chapter=Pointwise circumscription |editor= |title=Proceedings AAAI-86 Fifth National Conference on Artificial Intelligence, August 11-15, 1986, Philadelphia, PA |year=1986 |isbn=0934613133 |pages=406–410 }}

*{{cite book |first=V. |last=Lifschitz |chapter=Circumscription |editor1-first=D.M. |editor1-last=Gabbay |editor1-first=C.J. |editor1-last=Hogger |editor1-first=J.A. |editor1-last=Robinson |title=Nonmonotonic Reasoning and Uncertain Reasoning |publisher=Oxford University Press |year=1994 |isbn=0198537476 |pages=297–352 |volume=3 |series=Handbooks of Logic in Computer Science and Artificial Intelligence and Logic Programming}}

*{{cite journal |first=J. |last=McCarthy |title=Circumscription – A form of non-monotonic reasoning |journal=Artificial Intelligence |volume=13 |issue= |pages=27–39 |date=April 1980 |doi=10.1016/0004-3702(80)90011-9 |url=http://www.sciencedirect.com/science/article/pii/0004370280900119}}

*{{cite journal |first=J. |last=McCarthy |title=Applications of circumscription to formalizing common-sense knowledge |journal=Artificial Intelligence |volume=28 |issue=1 |pages=89–116 |date=February 1986 |doi=10.1016/0004-3702(86)90032-9 |url=http://www.sciencedirect.com/science/article/pii/0004370286900329}}
{{refend}}

== External links ==
* [http://www-formal.stanford.edu/jmc/circumscription.html Circumscription – a form of nonmonotonic reasoning], a paper by McCarthy.
* [http://plato.stanford.edu/entries/reasoning-defeasible/#5.5 An explanation in the Stanford encyclopedia on philosophy]

{{John McCarthy navbox}}
[[Category:Logic programming]]
[[Category:Non-classical logic]]