Results 1  10
of
844
Disambiguation by Prioritized Circumscription
"... This paper 1)r(,.sents a nml;ho(t of resolving ambiguity by using; ~ wu'imlt; of cir(:ums(:ril)l:ion, p'rio'ritizcd circwm, scriptio'm In a disa,ntbigu~tion task, human s/:(',ms to use various t)r(',fcrcnccs whi(:h have various str(mgi;h, hi llrioril,izcd cir. (:umscr ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper 1)r(,.sents a nml;ho(t of resolving ambiguity by using; ~ wu'imlt; of cir(:ums(:ril)l:ion, p'rio'ritizcd circwm, scriptio'm In a disa,ntbigu~tion task, human s/:(',ms to use various t)r(',fcrcnccs whi(:h have various str(mgi;h, hi llrioril,izcd cir. (:umscription, we (:;m ('.xt)ress thes/', t/references as defe;~sibh ~ (:onstr~fints with various strength and we infer the, most 1)referabh ', logical models which s~l,ist',y stronger COllStra,ill;S?l,s 11111c]1 as t)ossibh',. This ret)resenl,adon is very m~tu. ral for (tis;mfl)iguation sin(:c w(; (:;m r(~. ga, rd a logi(:al interprelqal;ion a.s a possibh,. r('.a(ling a.nd 1:lie most prefer;d)lc logical models as the most pr('.f('.ra,bh' ~ r(.'a(lings. Wc argue l,hat 1)rioritize.d (:ircums(:ril)tion is a,nol;her promising method for the task. We a]so dis(:uss an imt)hmmntation of l)rioritized (:ircums(:riplion by a hiera.rchi(:a.l logic programlning (]tCIA)) 1;ulgu~tge. 1
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
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
A Theorem Prover for Prioritized Circumscription
"... In a recent paper, Ginsberg shows how a backwardchaining ATMS can be used to con struct a theorem prover for circumscription. Here, this work is extended to handle prior itized circumscription. The ideas to be described have been implemented, and examples are given of the system in use. ..."
Abstract
 Add to MetaCart
In a recent paper, Ginsberg shows how a backwardchaining ATMS can be used to con struct a theorem prover for circumscription. Here, this work is extended to handle prior itized circumscription. The ideas to be described have been implemented, and examples are given of the system in use.
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
, 2008
"... The stable model semantics of disjunctive logic programs is based on minimal models which assign atoms false by default. While this feature is highly useful and leads to concise problem encodings, it occasionally makes knowledge representation with disjunctive rules difficult. Lifschitz’ parallel ci ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
circumscription provides a remedy by introducing atoms that are allowed to vary or to have fixed values while others are falsified. Prioritized circumscription further refines this setting in terms of priority classes for atoms being falsified. In this paper, we present a linear and faithful transformation
Compiling prioritized circumscription into extended logic programs
 in: Proceedings of the 15th International Joint Conference on Artificial Intelligence
, 1997
"... We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain closu ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized circumscription. In this paper, we show theoretically that any circumscription whose theory contains both the domain
A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming ⋆
"... Introduction. The stable model semantics of disjunctive logic programs (DLPs) is based on minimal models which assign atoms false by default. While this feature is highly useful—leading to concise problem encodings—it occasionally renders knowledge representation with disjunctive rules difficult. Re ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Introduction. The stable model semantics of disjunctive logic programs (DLPs) is based on minimal models which assign atoms false by default. While this feature is highly useful—leading to concise problem encodings—it occasionally renders knowledge representation with disjunctive rules difficult. Reiterstyle minimal diagnoses [1] provide a good example in this respect. This problem can be alleviated by a more refined
Circumscription
, 1996
"... The idea of circumscription can be explained on a simple example. We would like to represent information about the locations of blocks in a blocks world, using the "default": ..."
Abstract

Cited by 342 (10 self)
 Add to MetaCart
The idea of circumscription can be explained on a simple example. We would like to represent information about the locations of blocks in a blocks world, using the "default":
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 536 (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
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 9 (0 self)
 Add to MetaCart
general formalism called prioritized circumscription is briefly explored.
Results 1  10
of
844