Results 1 
8 of
8
Applications Of Circumscription To Formalizing Common Sense Knowledge
 Artificial Intelligence
, 1986
"... 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 o ..."
Abstract

Cited by 532 (12 self)
 Add to MetaCart
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
Curb Your Theory!  A circumscriptive approach for inclusive interpretation of disjunctive information
 In Proc. of IJCAI93
, 1993
"... We introduce curbing, a new nonmonotonic technique of commonsense reasoning that is based on model minimality but unlike circumscription treats disjunction inclusively. A finitely axiomatized firstorder theory T is transformed to a formula Curb(T ) whose set of models is defined as the smallest co ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
the complexity of inferencing from a curbed propositional theory and present a PSPACE algorithm for this problem. Finally, we address different possibilities to approximate the curb of a theory. 1 Introduction Circumscription [ McCarthy, 1980 ] looks to many as one of the most promising principles
On Open Defaults
, 1990
"... In Reiter's default logic, the parameters of a default are treated as metavariables for ground terms. We propose an alternative definition of an extension for a default theory, which handles parameters as genuine object variables. The new form of default logic may be preferable when the domain ..."
Abstract

Cited by 45 (5 self)
 Add to MetaCart
closure assumption is not postulated. It stands in a particularly simple relation to circumscription. Like circumscription, it can be viewed as a syntactic transformation of formulas of higher order logic. 1 Introduction Default logic [Reiter, 1980] is one of the most expressive and most widely used
On the Logic of Causal Explanation
 Artificial Intelligence
, 1997
"... The McCainTurner semantics of causal rules is based on a fixpoint construction similar to the one found in the definition of default logic. In the special case when the heads of the rules are literals, it can be equivalently expressed by a translation from sets of rules into sets of propositiona ..."
Abstract

Cited by 55 (17 self)
 Add to MetaCart
theories. Keywords: Actions; Causal logic; Circumscription 1 Introduction The nonmonotonic logic of causal explanation proposed by Norman McCain and Hudson Turner [1997a] provides a simple and powerful formalism for representing properties of actions. Their work builds on the analysis of causality due
On the Concept of Generic Object: A Nonmonotonic Reasoning Approach and Examples
"... . In this paper we discuss the logical and commonsense intuitions behind the concept of generic object and the possibility of characterizing this concept by means of both classical firstorder logic and circumscription. We also show that circumscription can be used in the characterization of the co ..."
Abstract
 Add to MetaCart
of the concept of generic point of a curve, as it appears in algebraic geometry. Finally, we show that several occurrences of the concept of generic object in computer science and mathematics can be shaped according to the same pattern of definition. 1 Introduction We all have intuitions about the concept
Laws of Generalized Prioritization (Extended Abstract)
, 1993
"... Giving a semantics to an inheritance hierarchy, or more generally to a set of prioritized defaults, can be done using the lexicographic ordering, first used by [5] for circumscription. The technique can be extended to any preferential logic, as noted in [2], where it is dubbed generalized prioritiz ..."
Abstract
 Add to MetaCart
prioritization. It has also been used independently in [9, 12]. In this paper we examine how important properties of preference relations propagate through lexicographic definition, and the algebraic laws satisfied by this technique. To express them we build a theory of operators on preferences. 1 Introduction
Chapter 12 Rough Sets and Rough Logic: A KDD Perspective
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract
 Add to MetaCart
Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of concepts. This main goal is motivated by the basic fact, constituting also the main problem of KDD, that languages we may choose for knowledge description are incomplete. A fortiori, we have to describe concepts of interest (features, properties, relations etc.) not completely but by means of their reflections (i.e. approximations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction of operations producing complex concepts from the primitive ones.