Disambiguation by prioritized circumscription
Ken Satoh · 1996
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(l-ings.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.llogic programlning (]tCIA)) 1;ulgu~tge.