Results 1  10
of
114
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
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
circumscription for
"... Morphological analyses suggest a new taxonomic circumscription... 101 Morphological analyses suggest a new taxonomic ..."
Abstract
 Add to MetaCart
Morphological analyses suggest a new taxonomic circumscription... 101 Morphological analyses suggest a new taxonomic
History of circumscription
 Artificial Intelligence
, 1993
"... 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 va ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
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
Phylogeny of the complex Vanguerieae (Rubiaceae) genera Fadogia, Rytigynia, and Vangueriawith close relatives and a new circumscription of Vangueria. Plant Systematics and Evolution 253
, 2005
"... Abstract. The phylogeny of the Vanguerieae genera Fadogia, Rytigynia, Vangueria, and closely related genera is investigated using nuclear rDNA ITS sequences and plastid trnTF and rpl16 sequences. Individual and combined analyses reveal several strongly supported clades. There are indications that ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract. The phylogeny of the Vanguerieae genera Fadogia, Rytigynia, Vangueria, and closely related genera is investigated using nuclear rDNA ITS sequences and plastid trnTF and rpl16 sequences. Individual and combined analyses reveal several strongly supported clades. There are indications that Fadogia, Rytigynia, Tapiphyllum, and Vangueria are paraor polyphyletic and only Multidentia is strongly supported as monophyletic. Several taxa are found to have incongruent positions in the ITS and chloroplast phylogenies, and possible reasons behind these incongruencies are discussed. For Ancylanthos rubiginosus a chloroplast capture event can explain the incongruent position. In the FadogiaRytigynia group the incongruence is more widespread and cannot be attributed to a single taxon or a few taxa, but hybridization and introgression is the most likely explanation for the incongruence. It is concluded that the genera Ancylanthos, Lagynias, Pachystigma, and Tapiphyllum and the three species Fadogia agrestis, Rytigynia fuscosetulosa, and Rytigynia induta should be transferred to Vangueria.
Stable Models and Circumscription
, 2007
"... The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming (includ ..."
Abstract

Cited by 71 (37 self)
 Add to MetaCart
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming
Feasible Commitment in Predicate Circumscription
"... In this paper we introduce a new semantic definition for predicate circumscription. We argue that the new definition is the most general one possible that captures the intuition, i.e., minimizing the objects that satisfy a given property. Yet, we can prove that it does not lead to inconsistency: ..."
Abstract
 Add to MetaCart
In this paper we introduce a new semantic definition for predicate circumscription. We argue that the new definition is the most general one possible that captures the intuition, i.e., minimizing the objects that satisfy a given property. Yet, we can prove that it does not lead to inconsistency
Projection and ScopeDetermined Circumscription
, 2012
"... We develop a semantic framework that extends firstorder logic by literal projection and a novel second semantically defined operator, raising, which is only slightly different from literal projection and can be used to define a generalization of parallel circumscription with varied predicates in a ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
and circumscription and their interaction. It reveals some refinements of and new views on previously known properties. In particular, we apply it to show that wellfoundedness with respect to circumscription can be expressed in terms of projection, and that a characterization of the consequences of circumscribed
Relating Belief Revision and Circumscription
 In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI95
, 1995
"... Nonmonotonic formalisms and belief revision operators have been introduced as useful tools to describe and reason about evolving scenarios. Both approaches have been proven effective in a number of different situations. However, little is known about their relationship. Previous work by Winslett has ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
has shown some correlations between a specific operator and circumscription. In this paper we greatly extend Winslett's work by establishing new relations between circumscription and a large number of belief revision operators. This highlights similarities and differences between these formalisms
A Proof Procedure for Circumscription
"... In [Siegel and Forget, 1996] a new non monotonic logic namely Xlogics was defined. In this formalism, useful for proof procedure, the nonmonotonic inference relation `X is defined by A `X B if every classical theorem of A [ B which is in X is a theorem of A. We proved that every preferential logic ..."
Abstract
 Add to MetaCart
In [Siegel and Forget, 1996] a new non monotonic logic namely Xlogics was defined. In this formalism, useful for proof procedure, the nonmonotonic inference relation `X is defined by A `X B if every classical theorem of A [ B which is in X is a theorem of A. We proved that every preferential logic
A Theorem Prover for Prioritized Circumscription
 In Proc. 11th International Joint Conf. on Artificial Intelligence (IJCAI
, 1989
"... In a recent paper, Ginsberg shows how a backwardchaining atms can be used to construct a theorem prover for circumscription. Here, this work is extended to handle prioritized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. 1 Introduct ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
Introduction Of all the approaches to nonmonotonic reasoning, McCarthy 's circumscription [ McCarthy, 1980, McCarthy, 1986 ] seems to be the most popular. A great deal of work has gone into the development of new versions of circumscription designed to address various problems in commonsense reasoning
Results 1  10
of
114