Results 1  10
of
72
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
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
of various entities. Included are nonmonotonic treatments of isa 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
Eliminating the fixed predicates from a circumscription
 Artificial Intelligence
, 1989
"... Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription usingfixed predicates into an equivalent one which does not. Thus, w ..."
Abstract

Cited by 31 (0 self)
 Add to MetaCart
Parallel predicate circumscription is the primary circumscriptive technique used in formalizing commonsense reasoning. In this paper we present a direct syntactic construction for transforming any parallel predicate circumscription usingfixed predicates into an equivalent one which does not. Thus
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
of various entities. Included are nonmonotonic treatments of isa 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
An Efficient Method for Eliminating Varying Predicates from a Circumscription
, 1992
"... Circumscription appears to be the most powerful and wellstudied technique used in formalizing commonsense reasoning. The general form of predicate circumscription allows for fixed and varying (floating) predicates. We show that the inference problem under this form of circumscription is efficientl ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
Circumscription appears to be the most powerful and wellstudied technique used in formalizing commonsense reasoning. The general form of predicate circumscription allows for fixed and varying (floating) predicates. We show that the inference problem under this form of circumscription
Literal Projection and Circumscription
, 2009
"... We develop a formal framework intended as a preliminary step for a single knowledge representation system that provides different representation techniques in a unified way. In particular we consider firstorder logic extended by techniques for secondorder quantifier elimination and nonmonotonic ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
predicate symbol. We introduce an operator raise that is only slightly different from literal projection and can be used to define a generalization of predicate circumscription in a straightforward and compact way. We call this variant of circumscription scopedetermined. Some properties of raise and scope
On the relation between autoepistemic logic and circumscription
 In Proceedings IJCAI89
, 1989
"... Circumscription on the one hand and autoepistemic and default logics on the other seem to have quite different characteristics as formal systems, which makes it difficult to compare them as formalizations of defeasible connmonsense reasoning. In this paper we accomplish two tasks: (1) we extend the ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
that all of the firstorder consequences of parallel predicate circumscription can be obtained from this class of autoepistemic theories. The correspondence we construct also sheds light on the problematic treatment of equality in circumscription. 1
Pointwise circumscription: Preliminary report
 In AAAI
, 1986
"... Circumscription is the minimization of predicates subject to restrictions expressed by predicate formulas. We propose a modified notion of circumscription so that, instead of being a single minimality condition, it becomes an “infinite conjun(*tion ” of “local ” minimality conditions; each of these ..."
Abstract

Cited by 37 (5 self)
 Add to MetaCart
Circumscription is the minimization of predicates subject to restrictions expressed by predicate formulas. We propose a modified notion of circumscription so that, instead of being a single minimality condition, it becomes an “infinite conjun(*tion ” of “local ” minimality conditions; each
Description logics with circumscription
 In Proc. of KR
, 2006
"... We show that circumscription can be used to extend description logics (DLs) with nonmonotonic features in a straightforward and transparent way. In particular, we consider extensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is decidable ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
cidable under a simple restriction: only concept names can be circumscribed, and role names vary freely during circumscription. We pinpoint the exact computational complexity of reasoning as complete for NPNEXP and NEXPNP, depending on whether or not the number of minimized and fixed predicates is assumed
The Complexity of Circumscription in Description Logic
"... As fragments of firstorder logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability of such features, several families of nonmonotonic DLs have been developed that are mostly ba ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
based on default logic and autoepistemic logic. In this paper, we consider circumscription as an interesting alternative approach to nonmonotonic DLs that, in particular, supports defeasible inheritance in a natural way. We study DLs extended with circumscription under different language restrictions
Results 1  10
of
72