Results 11  20
of
72
Computing Protected Circumscription
, 1985
"... : This paper deals with computing circumscription in the case of Horn data with addi ional protection (indefinite data), an intermediate investigation between Reiter's result on predicate a c completion and Lifschitz's efforts to make general (formula) circumscription more efficient as omp ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
: This paper deals with computing circumscription in the case of Horn data with addi ional protection (indefinite data), an intermediate investigation between Reiter's result on predicate a c completion and Lifschitz's efforts to make general (formula) circumscription more efficient
On the Model Checking Complexity of Circumscription
"... The computational problem of model checking for circumscription of firstorder formulae is studied. We study in which subclasses of circumscriptive predicate formulas there are formulas with coNPcomplete model checking problem. We deal with naturally arising subclasses defined in terms of quantifier ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The computational problem of model checking for circumscription of firstorder formulae is studied. We study in which subclasses of circumscriptive predicate formulas there are formulas with coNPcomplete model checking problem. We deal with naturally arising subclasses defined in terms
Value Minimization in Circumscription
, 1998
"... Minimization in circumscription has focussed on minimizing the extent of a set of predicates (with or without priorities among them), or of a formula. Although functions and other constants may be left varying during circumscription, no earlier formalism to the best of our knowledge minimized functi ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Minimization in circumscription has focussed on minimizing the extent of a set of predicates (with or without priorities among them), or of a formula. Although functions and other constants may be left varying during circumscription, no earlier formalism to the best of our knowledge minimized
Circumscription in a modal logic
 Theoretical Aspects of Reasoning about Knowledge: Proc. of the Second Conf
, 1988
"... In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K " in a formula. In order to have a nontrivial circumscription schema, we extend $5 moda ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper, we extend circumscription [McCarthy, 80] to a propositional modal logic of knowledge of one agent. Instead of circumscribing a predicate, we circumscribe the knowledge operator "K " in a formula. In order to have a nontrivial circumscription schema, we extend $5
Reasoning in Circumscriptive ALCO
, 2007
"... Abstract. Nonmonotonic extensions of description logics (DLs) allow for default and local closedworld reasoning and are an acknowledged desired feature for applications, e.g. in the Semantic Web. A recent approach to such an extension is based on McCarthyâ€™s circumscription, which rests on the prin ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
on the principle of minimising the extension of selected predicates to locally close off dedicated parts of a domain model. While decidability and complexity results have been established in the literature, no practical algorithmisation for circumscriptive DLs has been proposed so far. In this paper, we present a
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
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
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
is an Xlogic, and we studied the particular case of circumscription without free predicate in the finite case. We found a set X smaller than the general one which simplifies the complexity of the proof procedure. In this paper, this result is extended to the case of circumscription with free predicates
Autoepistemic Logic and Introspective Circumscription
"... We investigate the relationship between two epistemic nonmonotonic formalisms: autoepistemic logic and introspective circumscription. Finitely axiomatized autoepistemic theories are shown to be equivalent to the propositional case of introspective circumscription. This theorem is applied to the prob ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate the relationship between two epistemic nonmonotonic formalisms: autoepistemic logic and introspective circumscription. Finitely axiomatized autoepistemic theories are shown to be equivalent to the propositional case of introspective circumscription. This theorem is applied
Pointwise Circumscription Revisited
"... A decade ago, Pointwise Circumscription was proposed as a tool for formalizing common sense. In this paper, we revisit some of its uses and examine some cases in which it does not yield the intended behavior. Specifically, we explore the cases in which unsatisfiability may result from the presence o ..."
Abstract
 Add to MetaCart
Sensitive Circumscription handles these cases without losing the control over selective finegrained variance of predicates and functions. Last, we compare the two tools and their potential uses in formalizing Theories of Action. 1 INTRODUCTION Pointwise Circumscription, devised by Lifschitz in (Lifschitz, 1987
PointSensitive Circumscription
, 1997
"... A decade ago, Pointwise Circumscription was proposed as a tool for formalizing common sense. In this paper, we revisit some of its uses and examine some cases in which it does not yield the intended behavior. Specifically, we explore the cases in which unsatisfiability may result from the presence o ..."
Abstract
 Add to MetaCart
Sensitive Circumscription handles these cases without losing the control over selective finegrained variance of predicates and functions. Last, we compare the two tools and their potential uses in formalizing Theories of Action. 1 Introduction Pointwise Circumscription, devised by Lifschitz in [Lif87] and [Lif89], is a
Results 11  20
of
72