Difference between revisions of "Circumscription (logic)"
Karl Jones (Talk | contribs) |
Karl Jones (Talk | contribs) |
||
| Line 32: | Line 32: | ||
* [https://en.wikipedia.org/wiki/Circumscription_(logic) Circumscription (logic)] @ Wikipedia | * [https://en.wikipedia.org/wiki/Circumscription_(logic) Circumscription (logic)] @ Wikipedia | ||
| + | |||
| + | [[Category:Logic]] | ||
Latest revision as of 04:58, 12 April 2016
Circumscription is a non-monotonic logic created by John McCarthy to formalize the common sense assumption that things are as expected unless otherwise specified.
Contents
Description
Circumscription was later used by McCarthy in an attempt to solve the frame problem.
To implement circumscription in his initial formulation, McCarthy augmented first-order logic to allow the minimization of the 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.
Original problem
The original problem considered by McCarthy was missionaries and cannibals:
Problem statement
- 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
Excluding conditions that are not explicitly stated
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.
See also
- John McCarthy (computer scientist)
- Logic
- Missionaries and cannibals
- Theory curbing
- Yale shooting problem
External links
- Circumscription (logic) @ Wikipedia
