login

Applications of circumscription to formalizing common-sense knowledge

Artificial IntelligencePublished 1 February 1986
John McCarthy
Citations78
SJR quartileQ1
SJR score1.84
SNIP3.30

TL;DR

A new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge are presented.

Abstract

We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects of various entities. Included are nonmonotonic treatments of is-a hierarchies, the unique names hypothesis, and the frame problem. The new circumscription may be called formula circumscription to distinguish it from the previously defined domain circumscription and predicate circumscription. A still more general formalism called prioritized circumscription is briefly explored. 1 INTRODUCTION ANDNEW DEFINITION OF CIRCUMSCRIPTION (McCarthy 1980) introduces the circumscription method of nonmonotonic reasoning and gives motivation, some mathematical properties and some ex1 amples of its application. The present paper is logically self-contained, but motivation may be enhanced by reading t...

Keywords

Computer Science