Alternative Approaches to Default Logic. Fachgebiet Intellektik. Technische Hochschule Darmstadt. Alexanderstrae 10. W. Ken Jackson. Burnaby, B.C.

Size: px
Start display at page:

Download "Alternative Approaches to Default Logic. Fachgebiet Intellektik. Technische Hochschule Darmstadt. Alexanderstrae 10. W. Ken Jackson. Burnaby, B.C."

Transcription

1 Alterative Appraches t Default Lgic James P. Delgrade Schl f Cmputig Sciece Sim Fraser Uiversity Buraby, B.C. Caada V5A 1S6 Trste Schaub Fachgebiet Itellektik Techische Hchschule Darmstadt Alexaderstrae 10 D-6100 Darmstadt Germay W. Ke Jacks Schl f Cmputig Sciece Sim Fraser Uiversity Buraby, B.C. Caada V5A 1S6 August 1993 Abstract Reiter's default lgic has prve t be a edurig ad versatile apprach t mtic reasig. Subsequet wrk i default lgic has ccetrated i tw majr areas. First, mdicatis have bee develped t exted ad augmet the apprach. Secd, there has bee gig iterest i sematic fudatis fr default lgic. I this paper, a umber f variats f default lgic are develped t address dierig ituitis arisig frm the rigial ad subsequet frmulatis. First, we mdify the maer i which csistecy is used i the deiti f a default extesi. The idea is that a glbal rather tha lcal ti f csistecy is emplyed i the frmati f a default extesi. Secd, we argue that i sme situatis the requiremet f prvig the atecedet f a default is t strg. A secd variat f default lgic is develped where this requiremet is drpped; subsequetly these appraches are cmbied, leadig t a al variat. These variats the lead t default systems which cfrm t alterative ituitis regardig default reasig. Fr all f these appraches, a xedpit ad a pseud-iterative deiti are give; as well a sematic characterisati f these appraches is prvided. I the cmbied apprach we argue als that e ca w reas abut a set f defaults ad ca determie, fr example, if a particular default i a set is redudat. We shw the relati f this wrk t that f Lukaszewicz ad Brewka, ad t the Therist system. Curret address IRISA, Campus de Beaulieu, Rees cedex, Frace 1

2 1 Itrducti Reiter's default lgic [Reiter, 1980] is e f the best kw appraches t mtic reasig. I this apprach, dmai-specic rules f iferece r defaults are added t classical prpsitial r rst-rder lgic t capture patters f iferece f the frm \i the absece f ifrmati t the ctrary, cclude that ". A example f a default Bird(x) F ly(x) represetig the asserti \Birds y" is F ly(x). This rule is rughly iterpreted as \if smethig ca be iferred t be a bird, ad if that thig ca be csistetly assumed t y, the ifer that it des y". The meaig f a rule the rests tis f prvability ad csistecy with respect t a give set f beliefs. A set f beliefs sactied by a set f defaults, with respect t a iitial set f facts, is called a extesi f this set f facts. Hwever, as discussed i the ext secti, this frmalism lacks several imprtat prperties, icludig existece f extesis ad semi-mticity [Reiter, 1980], ad cumulativity [Makis, 1989]. I additi, dierig ituitis ccerig the rle f default rules lead t dierig piis ccerig ther prperties, mst tably that f \cmmitmet t assumptis" [Ple, 1989]. With regard t cmmitmet t assumptis, the geeral idea is that the ti f csistecy ca be emplyed i either a brad r \glbal" fashi, r i a mre limited r \lcal" fashi. Varius prpsals have bee put frward t address these issues ad diculties; as we shw hwever, e f these prpsals csider the full set f issues. Secti 3 describes a variat f default lgic, called cstraied default lgic. This variat essetially marries ad exteds the wrk fud i [Delgrade ad Jacks, 1991] ad [Schaub, 1991b]. I this variat, a default extesi is characterised by a set f frmulas (as befre) givig the set f default cclusis, ad a secd set f frmulas givig the \ctext f reasig", determied by the justicatis ad cclusis f applied defaults. Csistecy is treated i a \glbal" fashi, ad the justicatis f default rules are take as expressig uderlyig assumptis, rather tha a ti f pssibility. As a result, this variat cfrms with the ti f cmmitmet t assumptis. Furthermre, the prblems f semi-mticity ad existece f extesis are addressed, ad i a simpler framewrk tha ther prpsals. It may als be argued that i certai situatis default lgic is verly weak, i that desirable cclusis are t frthcmig. We argue that i such cases the requiremet that the atecedet be prvable is t strg, ad i Secti 4 preset a variat where defaults are replaced by prerequisite-free cuterparts. The missi f prerequisite cditis leads t a simpler frmulati, wherei e may reas by mdus tlles ad by cases. This variat is referred t as prerequisite-free default lgic. This secti als examies the system btaied by jiig cstraied default lgic with prerequisite-free default lgic. I this variat, prblems that arise i the rigial frmulati are fully addressed, icludig that f cumulativity, ad i a simpler system tha ther variats. We als shw hw e ca w reas abut a default i the metathery t determie, fr example, if it may ever be applicable i the frmati f a extesi. Fr each f these variats, xed-pit, iterative, ad sematic characterisatis are give ad shw t be equivalet. As well, i Secti 5, the relati t previus wrk by Lukaszewicz [1988] ad Brewka [1991a] is give; i additi we demstrate the relati f 2

3 ur mdicatis t the Therist system [Ple, 1988]. Hece the results reprted i this paper prvide liks amg these systems. The rst appedix ctais tw tables summarisig the systems discussed here. The rst table lists the ames ad abbreviatis f these systems, tgether with the sectis i which they are discussed. The secd table ctais a summary f prperties f the variats f default lgic. The secd appedix ctais the prfs f the results stated i the bdy f the paper. 2 Default Lgic 2.1 Itrducti t Default Lgic Default lgic (r DL) exteds classical rst-rder lgic by the additi f dmai-specic (~x) (~x) rules f iferece f the frm (~x). A rule may be ifrmally iterpreted as \If, fr sme set f istaces ~c, (~c) is prvable frm what is kw ad (~c) is csistet, the cclude by default that (~c)." (~x) is called the prerequisite; (~x) is the justicati; ad (~x) is the csequet. Fr cveiece, we dete the prerequisite f a default by Prereq(), its justicati by Justif () ad its csequet by Cseq(). These prjectis exted t sets f defaults i the bvius way. A rmal default is e where the justicati ad csequet are equivalet. A semi-rmal default is e where the csequet is a lgical csequece f the justicati. Almst all \aturally ccurrig" defaults are rmal [Etherigt, 1988], althugh semi-rmal defaults are required fr \iteractig" defaults [Reiter ad Criscul, 1981]. A default thery is a pair (D; W ) where D is a set f defaults ad W is a set f clsed rst-rder (r prpsitial) frmulas. 1 A clsed default thery is e where e f the frmulas i the defaults ctais a free variable. 2 Als, a default thery is said t be rmal r semi-rmal if it ctais ly rmal r semi-rmal defaults, respectively, The set f defaults is iteded t capture hypthetical r -strict ifereces. Hwever defaults dier markedly frm stadard rules f iferece i a aximatic specicati f a lgic. First, they are \dmai-specic" i that a rule makes referece t specic frmulas. Secd, these rules allw fr ifereces based t ly what ca be prve frm the facts, W (as give i a rule's prerequisite), but als frm what cat be prve (as give i the justicati). A set f defaults iduces e r mre extesis f the frmulas i W. A extesi ca be viewed as a maximal acceptable set f beliefs that e may hld abut the wrld W, suitably augmeted by the defaults D. Reiter species three prperties which shuld hld fr a extesi it shuld ctai the iitial set f facts W ; it shuld be deductively clsed; ad fr each default rule, if the prerequisite is i a extesi, but the egati f the justicati is t, the the csequet is i the extesi. If Th(S) is used t dete the deductive clsure f S, we btai 1 I what fllws, we simply say frmula istead f clsed rst-rder frmula. 2 Fr simplicity we deal ly with clsed default theries; pe theries are described i [Reiter, 1980]. Als we restrict urselves t default rules with ly a sigle justicati. I the systems we develp, multiple justicatis crrespd t their cjucti. 3

4 Deiti 2.1 [Reiter, 1980] Let (D; W ) be a default thery. Fr ay set S f frmulas, let (S) be the smallest set satisfyig the fllwig prperties 1. W (S), 2. (S) = Th( (S)), 3. If 2 D ad 2 (S) ad 62 S the 2 (S), the E is a extesi f the default thery (D; W ) i (E) = E. That is, E is a xed pit f. A pseud-iterative specicati f a extesi is als give Therem 2.1 [Reiter, 1980] Let (D; W ) be a default thery ad let E be a set f frmulas. Dee E 0 = W ad fr i 0 E i+1 = Th(E i ) [ 2 D; 2 E i; 62 E The E is a extesi fr (D; W ) i E = S 1 i=0 E i. The abve prcedure is t strictly iterative sice E appears i the specicati f E i+1. If we had fr example that Quakers are typically pacists while Republicas typically are t (i.e. D = Q(x) P (x) R(x) P (x) ; P (x) P (x) ) the, fr W = fq(sue); R(sue)g, there are tw extesis, e i which P (sue) is true ad e i which P (sue) is true. If D 0 = D [ Q(x) G(x) A(x) E(x) ; (say, Quakers are typically geerus ad adults are typically G(x) E(x) emplyed) the agai we btai tw extesis where P (sue) is true i e ad P (sue) is true i the ther, ad where additially G(sue) is true i bth, ad E(sue) is true i either. While these characterisatis f a default thery are clear ad ituitive, they etheless are essetially sytactic i ature. As a rst step i develpig sematic uderpiigs fr DL, [ Lukaszewicz, 1985] prvides a sematic characterisati f rmal default theries. The geeral idea is that every rmal default ca be regarded as a mappig frm sets f mdels it sets f mdels, such that the rage f the mappig is the subset f the dmai where the csequet is true. I [Etherigt, 1987; Etherigt, 1988] sematic characterisatis f geeral default theries are give, based a ti f preferece betwee sets f mdels. A default prefers a set f mdels 1 i which the csequet f the default hlds, ver a superset f mdels 2 where the prerequisite is true ad the justicati is csistet but the csequet is t ecessarily satised. If we let MOD(W ) dete the set f all mdels f W, the preferece relati is deed as fllws Deiti 2.2 [Etherigt, 1988] Let = be a default rule, a set f mdels ad 1 ; The relati crrespdig t,, is deed as fllws 1 2 i 4

5 1. fr every 2 2 we have j=, 2. there is 2 2 such that j=, 3. 1 = f 2 2 j j= g. This rder is easily exteded t a set f defaults D Deiti 2.3 [Etherigt, 1988] Let D be a set f default rules, a set f mdels ad 1 ; The relati crrespdig t D, D, is the trasitive clsure f the ui f the relatis fr every 2 D 1 D 2 i 1. there exists 2 D, such that 1 2 r else 2. there is a such that 1 3 ad 3 2. Fr rmal default theries, we eed ly csider the D -maximal elemets f 2 MOD(W ) [ Lukaszewicz, 1985]. Hwever fr geeral default theries, we eed t esure that the justicati f each default is csistet with the al extesi. Etherigt dees a prperty which he calls stability that esures this cditi Deiti 2.4 [Etherigt, 1988] Let (D; W ) be a default thery ad 2 2 MOD(W ). is stable fr (D; W ) i there is a set f default rules D 0 D such that 1. D 0 MOD(W ), ad 2. fr every 2 D 0, we have fr sme 2 that j=. Stable, maximal sets f mdels fr a default thery are shw t crrespd t extesis i a default thery, thus prvidig a aalgue t sudess ad cmpleteess results. 2.2 Prperties f Default Lgic There are a umber f prperties which are t preset i DL. These may be rughly divided it, rst, limitatis f the frmalism itself, ad, secd, prperties that arise due t dierig ituitis ccerig the ature f a default rule. This divisi is i sme sese a arbitrary e, ad sme prperties that may be prblematic t e pers r applicati may appear t be quite reasable t ather. Sice the examples illustratig these prperties are used thrughut the paper, they are develped i sme detail here. First, it is t always the case that a default thery has a extesi. Example 2.1 (Existece f Extesis) The default thery A A ; ; has extesi. 5

6 Nrmal default theries guaratee the existece f extesis, which is t the case fr semi-rmal default theries. The ext example illustrates the prperty f semi-mticity ad thus ccers icreasig the set f defaults i a thery. Ituitively, we wuld wat that if D 0 D fr tw sets f defaults, the if E 0 is a extesi f D 0 the there is a extesi E f D where E 0 E. While this ideed is the case fr rmal defaults [Reiter, 1980, p. 96], the ext example, adapted frm [ Lukaszewicz, 1988], illustrates that it is t s i geeral. Example 2.2 (Semi-mticity) The default thery The default thery A B^C B A B^C B ; fag has a uique extesi Th(fA; Bg). ; fag has a uique extesi Th(fA; Cg). ; A C C As [Reiter, 1980] discusses, semi-mticity has the imprtat practical csequece that it allws fr lcal prf prcedures that may discard sme f the defaults. Mrever, if we iterpret justicatis as supplyig tetative assumptis (r wrkig hyptheses) the the fact that we btai ly e extesi, Th(fA; Cg), i the secd part f the precedig example is arguably uituitive if we kw ly W = fag rigially, the ifrmally it seems that the rst default shuld be \applicable". The argumet might ru \Iitially I kw thig at all; hece B ^ C is csistet ad I ca cclude that B. Hwever, C is icsistet with my rigial assumpti f B ^ C, ad s I cat apply the secd default." Thus we btai a extesi Th(fA; Bg) by cmmittig t B ^ C. Similar reasig begiig with the secd default yields the secd extesi Th(fA; Cg). Uder this argumet, we wuld btai semi-mticity, sice addig a default wuld ly elarge r preserve existig extesis. Nte that this iterpretati f justicatis as cstitutig \wrkig hyptheses" is just that uderlyig the failure t cmmit t assumptis, discussed belw. Hwever if we d't treat justicatis as cstitutig wrkig hyptheses, but take them simply as csistecy cditis (as i the rigial frmulatis), the i ther cases this behaviur ca be see t be quite reasable. Csider a iterpretati f Example 2.2 expressig the ifrmati that, wherever I am, if a televisi picks up Chael 19 ad it is pssible t tur t the theatre prgramme ad the recepti is t pr, the I will tur t the theatre prgramme. That is, A is \The televisi receives chael 19"; B is \I tur t the theatre prgramme"; C is \The recepti is pr". Give the rst default thery I will tur t the prgramme by default. Hwever if we als A C kew that Chael 19 typically gets pr recepti (i.e. ), the arguably this default C verrides the previus, ad by default I d't attempt t watch the prgramme. Sice extesis are iteded t represet maximal csistet sets f beliefs, e wuld expect that distict extesis wuld be icsistet. I a rmal default thery this ideed is the case; hwever, it is t the case fr semi-rmal default theries. 6

7 Example 2.3 (Orthgality f Extesis) The default thery ; ; has tw extesis Th(fBg) ad Th(fAg). A^B B ; A^B A I Secti 3 we suggest that a mre apprpriate prperty is weak rthgality where, if a thery has distict extesis, the the extesis tgether with a \ctext f reasig", supplied by the set f justicatis f applied defaults, are icsistet. The ext example, dealig with cumulativity, is due t David Makis [1989]. The ituitive idea is that if a therem is added t the set f premises frm which the therem was derived, the the set f derivable frmulas shuld remai uchaged. Ufrtuately this is t the case fr DL Example 2.4 [Makis, 1989] (Cumulativity) The default thery A A_B A ; ; ; has e extesi Th(fAg). A A Csequetly the extesi ctais A _ B. The default thery A A_B A ; ; fa _ Bg has tw extesis A A Th(fAg) ad Th(fA; Bg). This example suggests that the failure f cumulativity is caused by chagig the way i which a default's prerequisite has bee derived. I the rst part f the example, the prerequisite A _ B is derived by default frm the applicati f the rule A A Here the secd default is iapplicable. I the secd part, A _ B cstitutes the wrld kwledge W, s that w we btai a secd extesi geerated by the secd default. Hwever, the failure f cumulativity ca als be caused by chagig the way i which a justicati f a default is refuted, as the ext example illustrates. Example 2.5 (Cumulativity) A B B ; A B B ; C The default thery C Csequetly the extesi ctais C. The default thery A B B ; A B B ; C C Th(fA; B; C g) ad Th(fA; B; C g) ; fa; B C g has e extesi Th(fA; B; C g) ; fa; C ; B C g has tw extesis I the case f the rst default thery, the third default is ly blcked wheever the rst default applies. This is because the csequet f the rst default A B B implies C, which ctradicts the justicati f the third default C C As a csequece, there is extesi geerated by the secd default. This chages whe the default cclusi C is added t the set f facts, as de i the secd default thery. Nw, we additially btai a secd extesi geerated by the secd default. Ather issue is cmmitmet t assumptis [Ple, 1989] Example 2.6 (Cmmitmet t Assumptis) The default thery B C ; B ; ; has e extesi Th(fC; Dg). D If we take justicatis as specifyig strict csistecy cditis (as Deiti 2.1 suggests) the this is e. Hwever, a alterative view takes justicatis as prvidig \implicit assumptis" r \wrkig hyptheses". Thus e might argue that the default 7

8 cclusi C ^ D is implausible, sice bth default rules are applicable eve thugh they have ctradictry justicatis. That is, the default cclusi C relies B beig assumed as the csistecy cditi, whereas D relies B. The implausibility arises frm the fact that B ad B cat jitly hld, ad s it wuld seem that C ad D shuld t jitly hld. This may have further eects, as the fllwig shws Example 2.6 (ct'd) The default thery B C ; B D ; C E ; D ; ; has e extesi Th(fC; Dg). F Thus, a family may decide t d e f tw thigs, g t the beach r t a mvie (C r D) the weeked, depedig whether it is suy (B) r t. Of the tw childre e des't like the beach, the ther des't like gig t mvies. S Chris will be happy (E) by default if they d't g t the beach, ad Leslie will be happy (F ) if they d't g t a mvie. We wuld expect t have three extesis, e i which fc; Fg are true; e i which fd; Eg are true; ad e i which fe; Fg are true. Thus i the rst case, assumig that it is suy, the family ges t the beach ad Leslie is happy; i the secd case the family ges t a mvie ad Chris is happy; i the last case, based the assumpti that the family ges t either the beach r t a mvie, bth childre are happy. Hwever i DL we cclude ly that fc; Dg, ad the family ges t bth the beach ad a mvie. The situati is eve wrse if we assert that gig t the beach ad gig t a mvie are mutually exclusive, ad s W = fc _ Dg. I this case i DL we have extesis. This pheme shws up mre subtly i the \brke arms" example Example 2.7 [Ple, 1989] (Cmmitmet t Assumptis) The default thery ; fb _ Dg has e extesi Th(fA; Cg). A^B A ; C^D C Sice e f B r D must be false, e f the default cditis, it wuld seem, cat hld, ad s bth default cclusis shuld t jitly hld. Csider, ccretely, where we assert that by default a pers's left arm is usable (A) uless it is brke (B); similarly a pers's right arm is usable (C) uless it is brke (D). The precedig thery the directs us t cclude that bth arms are usable, eve if e f them is kw t be brke (B _ D). The diculty, frm a techical pit f view, is that i Deiti 2.1 (ad i Therem 2.1) justicatis eed ly be idividually csistet with a extesi. Hwever the abve lie f argumet relies the view that justicatis i default rules are iteded t fucti as uderlyig assumptis. The rigial frmulati f DL thugh tk justicatis as straightfrward csistecy cditis. Csider the iterpretati f Example 2.6, where we wish t use the default rules t help us decide what t take a trip if it is csistet (i.e. pssible) that it will be ht (B) the take a T-shirt (C); if it is csistet that it will t be ht the take a sweater (D). S w if I kw thig abut the weather I take a T-shirt ad sweater. I this case ur iteded iterpretati f the justicatis i the rules is clser t \is pssible". Hece it makes sese t cclude by default fc; Dg, eve thugh the justicatis are jitly icsistet. The failure f DL t cmmit t assumptis the may be see t as a \bug", but rather as reectig a alterative ituiti ccerig default rules. I this paper, as 8

9 metied, we primarily explre alterative frmulatis i which we btai cmmitmet t assumptis. There are a umber f further prperties that e might expect f default ifereces that are t preset i DL. These, like cmmitmet t assumptis, are a matter f e's ituitis, but here the ituitis ccer the iteded iterpretati f a default rule as a whle, rather tha the justicati ale. First, DL prvides a ti aki t defeasible mdus pes, i that frm W = fag ad A B if B is csistet with A we ca ifer by B default that B. Hwever this des t exted t mdus tlles, r reasig by cases. Example 2.8 (Mdus Tlles) The default thery ; ffg has e extesi Th(fFg). B F F Hece, fr example, if birds y by default 3 ad we kw that a give idividual des t y, the we cat cclude by default that the idividual is t a bird. Example 2.9 (Reasig by Cases) The default thery A B B ; A B B ; ; has e extesi Th(;). While A _ A is a therem, either A r A ale are prvable, ad s either default ca be applied. This situati als arises where mre tha e class may have the same default prperty Example 2.9 (ct'd) The default thery Q P P ; V P ; fq _ V g has e extesi Th(fQ _ V g). P Thus if Quakers ad vegetarias are bth pacists by default, ad if smee is either Quaker r vegetaria, we still cclude thig abut pacism. These examples rely the implicit assumpti that a default rule shuld behave like classical implicati, except that it is defeasible. Such a assumpti als seems t uderly the wrk f [Reiter ad Criscul, 1981]. There, fr example, it is assumed that defaults f the frm A B ad B C B C shuld be trasitive uless explicitly blcked. Csequetly if W = fag we wuld cclude C by default, uless the trasitivity was explicitly blcked accrdig t the recipe give i that paper. If e accepts the argumet that defaults behave like defeasible implicatis the it makes sese that e be able t reas usig the \ctrapsitive" f a default, uless it is explicitly blcked. Hwever, agai, this argumet is t uiversally applicable. Fr example, i a diagstic prgram, we might wat t express that peple are rmally pers diabetic diabetic t diabetic, (i.e. ); clearly i this case we wuld t wat t emply the ctrapsitive t cclude that a diabetic was by default t a pers. I Secti 4 we address the issues raised by the last tw examples. Fially, while e ca draw default cclusis i DL e cat reas abut defaults. I classical lgic, fr example, if ad are true, the _ must als be 3 Fr simplicity we use a prpsitial \glss" i sme f the examples, rather tha the mre apprpriate B(x) F (x) F (x). 9

10 true. I DL, there is explicit cecti betwee, ad _, eve thugh we kw ituitively that the third default ca be applied wheever either f the rst tw ca. That is, i DL, i rder t determie whether a default is applicable (fr sme extesi) i a give default thery, we must eectively cmpute the extesis f the thery. I Secti 4.3 we address the issue f reasig abut defaults. I particular, we shw that, i the al variat f default lgic that we develp, it is pssible t deductively reas abut defaults i the metathery t determie, fr example, whether the applicability cditis f e default is subsumed by thers. 2.3 Related Wrk This secti itrduces subsequet wrk i default lgic. The majr appraches described here are discussed i detail i Secti 5, where they are cmpared t the preseted framewrk. Lukaszewicz [1988] presets a variat f DL that addresses the issues f semi-mticity ad existece f extesis. I this apprach, a tw-place xed-pit peratr is used i the deiti f a extesi. The rst argumet accumulates the csequets f applied defaults, while the secd accumulates the justicatis. Fr a default t be applicable, Lukaszewicz requires that a csequet be csistet with the csequets f applied defaults, ad als csistet with the idividual justicatis f the ther applied defaults. The apprach guaratees semi-mticity ad the existece f extesis. It des t address cumulativity r cmmitmet. These last tw prperties are csidered i [Brewka, 1991a], where a variat called cumulative default lgic is described. Tw mdicatis t the rigial frmulati are itrduced. First, the applicability cditi fr a default is stregtheed s that a justicati must be csistet with bth the set f csequets ad the set f justicatis f the applied defaults. The set f justicatis is kept track f by itrducig assertis, where a asserti is a rst-rder frmula (the asserted frmula) tgether with a set f reass (r supprt) fr believig the frmula. A extesi csists f a set f assertis, where the rst elemet f each asserti csists f either wrld kwledge r the csequet f a applied default; i the latter case, the secd elemet is the set f justicatis ad csequets f the ther defaults that eabled the default t be applied. This apprach yields a variat that makes explicit the ti that justicatis are t be emplyed as tetative assumptis. This variat is cumulative ad cmmits t assumptis. As well it is semi-mtic ad guaratees the existece f extesis. Brewka et al. [1991] idetify a diculty with this apprach called the \atig cclusis" prblem. The diculty essetially is that, sice extesis are lger sets f rst-rder frmulas but are sets f assertis, it is uclear (at best) hw the extesis ca be jied t yield cclusis cmm t every extesi. While [Brewka, 1991a] prvides a xed-pit ad pseud-iterative specicati f a extesi i cumulative default lgic, it des t prvide a sematic characterisati. This missi is addressed i [Schaub, 1991a] where a extesi f Etherigt's sematics is preseted, alg with a sematical appraisal f the apprach. [Delgrade ad Jacks, 1991] presets a series f sytactic variats f DL. Oe f these variats essetially cmbies the 10

11 appraches f Lukaszewicz ad Brewka, ad crrespds t the system described i [Schaub, 1991b]. I this apprach, justicatis f applied defaults must be csistet as a grup; extesis are as i the rigial frmulati ad s the atig cclusis prblem des t arise. This apprach is further elabrated i [Schaub, 1992b], where the relatiship t the Brewka ad Lukaszewicz variats are als ivestigated. Examples 2.8 ad 2.9 illustrate that there are arguably-useful situatis where default rules cat be applied. [Besard, 1989] describes a trasfrmati f rmal default rules which permits mdus tlles ad reasig by cases with default rules. [Delgrade ad Jacks, 1991] idepedetly prpses the same trasfrmati, but exteded t semirmal defaults. 3 Cstraied Default Lgic The \brke arms" example (Example 2.7) illustrates that, depedig e's ituitis, DL may prduce cclusis that are strger tha desired. The example suggests that the set f justicatis used i the specicati f a extesi shuld be csistet, rather tha each idividual justicati. I this secti we develp ad explre this ituiti. We itrduce the ti f a cstraied extesi ad call the resultig system cstraied default lgic r CDL. A cstraied extesi is cmpsed f tw sets f frmulas E ad C, where E C The extesi E ctais all frmulas which are assumed t be true ad the set f cstraits C csists f E ad the justicatis f all applied defaults. I this apprach, we regard the csistecy assumptis (i.e. the justicatis) as cstraits a give extesi. This is illustrated i Figure 1. The gure illustrates the atural set iclusi betwee the facts W, their deductive clsure Th(W ), the extesi E, ad its cstraits C. I this respect Th(W ) cstitutes a lwer bud whereas the cstraits C cstitute a upper bud fr ur set f beliefs give by E. W Th(W ) E C Figure 1 A cstraied extesi (E,C ) f a default thery (D; W ). Fr a default t apply i DL its prerequisite must be i E ad its justicati must be csistet with E. I CDL, hwever, the prerequisite must be i extesi E 11

12 whereas the csistecy f the justicati is checked with respect t the set f cstraits C. The cstraits ca be regarded as a ctext established by the premises give i W, the mtic therems (i.e. cclusis derived by meas f defaults), ad the uderlyig csistecy assumptis. I this sese, CDL aturally exteds the itrisic ctext-sesitive character f defaults by distiguishig betwee ur set f beliefs give i the extesi, ad the uderlyig cstraits that frm a ctext guidig ur beliefs. While this slightly cmplicates the deiti f a extesi, it als meas that rules ad extesis are w represeted uifrmly, i that bth csist f a csistecy cditi alg with cclusis based the csistecy cditis. Deiti 3.1 Let (D; W ) be a default thery. Fr ay set f frmulas T let (T ) be the pair f smallest sets f frmulas (S 0 ; T 0 ) such that 1. W S 0 T 0, 2. S 0 = Th(S 0 ) ad T 0 = Th(T 0 ), 3. Fr ay 2 D, if 2 S0 ad T [ fg [ fg 6`? the 2 S 0 ad ^ 2 T 0. A pair f sets f frmulas (E,C ) is a cstraied extesi f (D; W ) i (C) = (E,C ) The set f cstraits is geerated by accumulatig the justicatis frm the applied defaults alg with the cclusis. Thus, each justicati is jitly csistet with the extesi ad all ther justicatis f applied defaults. Cmpared with Deiti 2.1, the xed-pit cditi relies ly the cstraits (T ). Ituitively, this meas that ur ctext f reasig has t cicide with ur set f accumulated cstraits. A immediate csequece f this deiti is that semi-rmal ad geeral default theries are equivalet. This is see by tig that the deiti cicides fr defaults f the frm ^ ad. Fr the default thery A B C ; fag ; istead f a \at" extesi Th(fA; C g) as i DL, we btai i CDL a extesi that is embedded i a ctext, viz. the cstraied extesi (Th(fA; C g); Th(fA; B; Cg)) Fr the brke arms example (Example 2.7), we w btai tw cstraied extesis. Example 3.1 The default thery A^B A ; C C ^D ; fb _ Dg has tw cstraied extesis (Th(fA; B _ Dg); Th(fA ^ B; Dg)) ad (Th(fC ; B _ Dg); Th(fC ^ D; Bg)) We btai e cstraied extesi i which A is true ad the value f C is uspecied, ad ather i which C is true ad the value f A is uspecied. I the rst cstraied extesi, the cstraits csist f the justicati A ^ B frm the rst default ad D frm the wrld kwledge. I the secd cstraied extesi, the cstraits ctai the justicati C ^ D frm the secd default ad B frm the wrld kwledge. I Example 2.2 we w als btai tw cstraied extesis. This reects the fact that CDL is semi-mtic (cf. Therem 3.3 belw). Example 3.2 The default thery A B^C B ; A C C (Th(fA; Bg); Th(fA; B ^ Cg)) ad (Th(fA; Cg); Th(fA; Cg)) 12 ; fag has tw cstraied extesis

13 Thus, i a cstraied extesi (E; C), the extesi E represets what we believe abut the wrld whereas the cstraits C tell us what assumptis we have made i rder t adpt ur beliefs. Hece, a extesi is ur evisiig f hw thigs are, whereas the cstraits represet ur assumptis i drawig these cclusis. Similar t [Reiter, 1980], we are able t prvide a mre ituitive but still \pseuditerative" characterisati f cstraied extesis Therem 3.1 Let (D; W ) be a default thery ad let E; C be sets f frmulas. Dee E 0 = W ad C 0 = W ad fr i 0 E i+1 = Th(E i ) [ C i+1 = Th(C i ) [ ^ 2 D; 2 E i; C [ fg [ fg 6`? 2 D; 2 E i; C [ fg [ fg 6`? (E,C ) is a cstraied extesi f (D; W ) i (E,C ) = ( S 1 i=0 E i ; S 1 i=0 C i ) Whe cmputig a extesi, referece is made t the previus partial extesi E i whereas the csistecy is checked with respect t all cstraits. Thus, we btai that cstraied extesis are uiquely determied by their sets f cstraits, i that if (E; C) ad (E 0 ; C 0 ) are cstraied extesis where C = C 0, the E = E Prperties f Cstraied Default Lgic The precedig discussi demstrates that CDL cmmits t assumptis. Cstraied extesis are maximal, i.e. fr cstraied extesis (E,C ) ad (E 0 ; C 0 ) f (D; W ) we have that if E E 0 ad C C 0 the E = E 0 ad C = C 0 4 Hwever, the example demstratig the failure f cumulativity give fr DL carries ver t CDL as well, ad s the system is t cumulative. Als, the set f beliefs i a extesi ale is t ecessarily maximal, as the ext example illustrates [ Lukaszewicz, 1988]. BA ; B D (Th(fAg); Th(fA; Bg)) ad (Th(fA; Bg); Th(fA; B; Dg)) Example 3.3 The default thery ; fag has tw cstraied extesis S the actual extesi f the rst cstraied extesi is icluded i the extesi f the secd cstraied extesi. Ntably, CDL guaratees the existece f extesis ad pssesses the prperty f semi-mticity. Therem 3.2 (Existece f extesis) Every default thery has a cstraied extesi. Csider the default thery f Example 2.1, which illustrates that DL des t guaratee the existece f extesis 4 Cf. [Schaub, 1992a, Therem 4.3.4]. 13

14 Example 3.4 The default thery A ; ; has e cstraied extesi (Th(;); Th(;)) A The default A A is t applicable sice, accrdig t Deiti 3.1, its justicati ad its csequet must be csistet. Therem 3.3 (Semi-mticity) Let (D; W ) be a default thery ad D 0 a set f defaults such that D D 0 If (E,C ) is a cstraied extesi f (D; W ), the there is a cstraied extesi (E 0 ; C 0 ) f (D 0 ; W ) such that E E 0 ad C C 0 That is, CDL is mtic with respect t the defaults. Csider agai Example 2.2. Example 3.5 The default thery (Th(fA; Bg); Th(fA; B ^ Cg)). The default thery A B^C ; fag has e cstraied extesi B A B^C B ; A C C ; fag has tw cstraied extesis (Th(fA; Bg); Th(fA; B ^ Cg)) ad (Th(fA; Cg); Th(fA; Cg)). Semi-mticity ad cmpactess imply that cstraied extesis are cstructible i a truly iterative way by applyig e applicable default after ather. The, i the case f a ite umber f clsed defaults, the csistecy f each justicati ca be checked with respect t the previus partial set f cstraits iduced by the facts ad all previuslyapplied defaults. I the iite case, e has t emply sme srt f diagalizati methd. Ather prperty which hlds fr cstraied extesis, we refer t as weak rthgality. This is aalgus t the prperty f rthgality i DL, which hlds fr rmal default theries, ad states that distict extesis are mutually ctradictry. Therem 3.4 (Weak rthgality) Let (D; W ) be a default thery. If (E,C ) ad (E 0 ; C 0 ) are distict cstraied extesis f (D; W ), the C [ C 0 is icsistet. That is, give tw dieret cstraied extesis the cstraits f the extesis are mutually ctradictry. Nte that weak rthgality is iapplicable fr DL, sice meti is made f the set f cstraits used i cstructig a extesi. Example 3.6 The default thery B C ; C B ; ; has tw cstraied extesis (Th(fC g); Th(fC ; Bg)) ad (Th(fBg); Th(fB; C g)) The tw cstraied extesis result frm icmpatible sets f cstraits. Thus, ad i ctrast t stadard extesis which hide their uderlyig csistecy assumptis ad therefre lack trasparecy, cstraied extesis exhibit their csistecy assumptis. 3.2 Cstraied versus Stadard Default Lgic We discuss here the relatiship betwee DL ad CDL. I DL, the prperties discussed i the previus subsecti (fr example, semi-mticity ad existece f extesis) actually hld fr rmal default theries. Thus e view f CDL is f a variat f DL 14

15 that exteds the prperties fud i rmal default theries t geeral default theries. The tight relatiship betwee DL ad CDL i the case f rmal default theries is shw by the fact that the appraches cicide i this case. 5 Therem 3.5 Let (D; W ) be a rmal default thery ad E a set f frmulas. The, E is a stadard extesi f (D; W ) i (E; E) is a cstraied extesi f (D; W ). At rst glace, it seems that CDL is strictly weaker tha its classical cuterpart ad that every cstraied extesi is \subsumed" by a stadard e. T see that this is t the case csider agai the family-beach-mvie situati f Example 2.6. Example 3.7 The default thery BC ; D B ; C E ; D F ; ; has e stadard extesi Th(fC ; Dg); but three cstraied extesis 1. (Th(fC ; Fg); Th(fB; C ; D; Fg)); 2. (Th(fD; Eg); Th(fB; C ; D; Eg)); 3. (Th(fE; Fg); Th(fC ; D; E; Fg)) Hece, CDL is either strger r weaker tha its classical cuterpart. I particular, the ly stadard extesi is either a superset r a subset f the extesis btaied i CDL. We ca describe the relatiship betwee DL ad CDL by usig the justicatis f the geeratig defaults, that is, fr a stadard extesi E, C E = 2 D; 2 E; 62 E Therem 3.6 Let (D; W ) be a default thery ad let E be a stadard extesi f (D; W ). If E [ C E is csistet, the (E; Th(E [ C E )) is a cstraied extesi f (D; W ). Observe that the cverse f the abve therem des t hld sice DL des t guaratee the existece f extesis. Hwever, if the extesis cicide we have Therem 3.7 Let (D; W ) be a default thery. If (E,C ) is a cstraied extesi f (D; W ) ad E is a stadard extesi f (D; W ), the C Th(E [ C E ) Fially, it is iterestig t bserve hw the specicati f a prblem i CDL ca be represeted i DL. 6 The idea is t shift the ifrmati give by the cstraits C i a cstraied extesi (E,C ) t the justicatis f the defaults. The, each such justicati is supplied with a additial but xed csistecy cditi represetig the cstraits i C. Agai, this is de by usig the set f geeratig defaults 7 f a cstraied extesi GD((E; C); D) = 2 D 2 E; C [ fg [ fg 6`? 5 We refer t extesis i Reiter's apprach as stadard extesis, i rder t distiguish them frm thers. 6 We wuld like t thak the aymus referees fr brigig this relatiship t ur atteti. 7 See Deiti B.1 fr a frmal deiti f the set f geeratig defaults. 15

16 Therem 3.8 Let (D; W ) be a default thery ad E ad C sets f frmulas. Let ^C = V 2GD((E ;C);D) Cseq() ^ Justif () with ite GD((E; C); D) ad D 0 = ^^ ^C 2 D The, if (E,C ) is a cstraied extesi f (D; W ) the E is a stadard extesi f (D 0 ; W ) 3.3 The Fcussed Mdels Sematics I rder t characterise cstraied extesis sematically, we dee a preferece relati similar t that give i [Etherigt, 1988]. Istead f sets f mdels, we csider pairs (; ) f sets f mdels. These pairs admit mre structure; we refer t them as fcused mdels structures. The ituiti behid a fcused mdels structure is as fllws. If we view the justicatis f defaults as \wrkig assumptis", the the csistecy cditi f DL is lger adequate. A primary diculty that arises is -cmmitmet t assumptis (cf. Example 2.6 ad 2.7). Sematically, we als eed t csider thse mdels satisfyig ur implicit assumptis, give i the ttality f the justicatis f the applied defaults. Sice we d t require that the justicatis be valid, there may exist mdels that falsify them. Csequetly, we impse mre structure the sets f mdels uder csiderati, viewig the secd cmpet, which is a subset f, as ur fcused set f mdels. We illustrate the crrespdig structure f fcused mdels structures i Figure 2. The set f mdels represets the set f mdels i which the set f csequets f applied defaults is true, while additially icludes thse mdels where the justicatis are true. Mdels Fcused Mdels Figure 2 A fcused mdels structure (; ). I rder t illustrate this, csider agai the default thery A B C ; fag Etherigt [1988] characterises the stadard extesi Th(fA; C g) by meas f a \at" set f mdels = f j j= A ^ C g 16

17 Hece, fr example, if B ad C are lgically idepedet the there are as may mdels satisfyig ur \wrkig assumpti" B as there are mdels falsifyig it. The apprach take by the fcused mdels sematics yields a pair (; ) = (f j j= A ^ C g; f j j= A ^ B ^ C g) that crrespds t a structured set f mdels icludig a fcus which additially satises ur implicit assumptis. This is the set f mdels satisfyig A, C, ad B. I ther wrds, we admit mre structured sets f mdels by fcusig thse mdels that satisfy ur assumptis. Sematically, a default prefers a fcused mdels structure ( 1 ; 1 ) t ather ( 2 ; 2 ) if its prerequisite is valid i 2 ad the cjucti f its justicati ad csequet ^ is satisable i sme fcused mdel i 2, ad lastly if 1 ad 1 etail the csequet (i additi t the previus requiremets). Frmally, we achieve all this by deig a rder relatig the csistecy f the justicatis with their satisability i the fcused mdels. Deiti 3.2 Let = ad let be a set f mdels, ad ( 1; 1 ); ( 2 ; 2 ) The relati crrespdig t, ; is deed as fllws ( 1 ; 1 ) ( 2 ; 2 ) i 1. fr every 2 2 we have j=, 2. there is 2 2 such that j= ^, 3. 1 = f 2 2 j j= g; 4. 1 = f 2 2 j j= ^ g The iduced rder D is deed as the trasitive clsure f all rders such that 2 D Deiti 3.3 Let D be a set f defaults, a set f mdels, ad ( 1 ; 1 ); ( 2 ; 2 ) The relati crrespdig t D, D ; is the trasitive clsure f the ui f the relatis fr every 2 D ( 1 ; 1 ) D ( 2 ; 2 ) i 1. there exists 2 D such that ( 1 ; 1 ) ( 2 ; 2 ) r else 2. there is ( 3 ; 3 ) such that ( 1 ; 1 ) D ( 3 ; 3 ) ad ( 3 ; 3 ) D ( 2 ; 2 ) We will refer t the D -maximal sets abve (MOD(W ); MOD(W )) as the preferred fcused mdels structures fr a default thery (D; W ). Give a preferred fcused mdels structure (; ); a extesi is frmed by all frmulas that are valid i, whereas the fcused mdels express the cstraits surrudig the extesi. Accrdigly, we have the fllwig crrectess ad cmpleteess therem establishig the crrespdece betwee cstraied extesis ad preferred fcused mdels structure fr a default thery (D; W ). 17

18 @ R@ Therem 3.9 Let (D; W ) be a default thery. Let (; ) be a pair f sets f mdels ad E; C deductively clsed sets f frmulas such that = f j j= Eg ad = f j j= Cg The, (E,C ) is a cstraied extesi f (D; W ) i (; ) is a D -maximal elemet abve (MOD(W ); MOD(W )) As i [Etherigt, 1988], we btai a simpler sematical characterisati i the case f rmal default theries 8. The larger set f mdels cllapses t the fcussed mdels sice rmal defaults require their justicatis t be valid after they have bee shw t be satisable 9. Cmpared with [Etherigt, 1988], we have stregtheed the ti f csistecy i extesis, by requirig that all justicatis ad csequets be jitly satisable by the fcused mdels. I particular, we d t require a stability cditi (cf. Deiti 2.4). Techically, this is due t the fact that we are dealig with a semi-mtic default lgic. Frm the viewpit f the fcused mdels sematics, hwever, we esure the ctiued csistecy f the justicatis f applyig defaults by allwig ly thse defaults t be applied that are cmpatible with the established fcus. Figure 3 illustrates why we btai tw cstraied extesis i Example 3.1. Oce we have \applied" e f the defaults the ther default is lger applicable the fcus des t satisfy its justicati. Applyig e f the defaults des t just require the validity f its csequet; it als makes us fcus its uderlyig assumpti (i.e. its justicati) i rder t preserve its satisability. Fr example, addig A uder the assumpti that A ^ B is csistet (by applyig the default A^B A ) prhibits us frm assumig that C ^ D is csistet tgether with the kwledge that B _ D; ad vice versa. B _ D A^B A C ^D C A B _ D C B _ D B ^ D B ^ D Figure 3 Cmmitmet t assumptis i CDL. The abve example shws hw the fcused mdels structures sematically accuts fr 8 Recall Therem We will see i Secti 5.2 that the fcus plays a fudametal rle i the case f rmal assertial default theries i rder t capture sematically the ti f cumulativity. 18

19 cmmitmet t assumptis. I view f the fact that the fcused mdels sematics als captures Brewka's cumulative default lgic (cf. Secti 5.2), ad the fact that Brewka's variat cmmits t assumptis as well, we may regard the fcused mdels sematics as a geeral apprach t cmmitmet t assumptis i default lgics. I additi, the sematics supplies us with several isights it the prperties f CDL. The existece f fcused mdels structures ad s the existece f cstraied extesis, is guarateed sice Deiti 3.2 esures that ever becmes the empty set. The same deiti als takes care f semi-mticity, sice there has t exist a fcused mdel satisfyig the prerequisite, csequet, ad justicati f a added default befre it is applied. Weak rthgality is mirrred by the fact that there ever exists a fcused mdel which is cmm t tw dieret preferred sets f fcused mdels. We will see i Secti 5.2 that the fcused mdels sematics captures als the prperty f cumulativity. A alterative sematics fr CDL has bee prpsed i [Besard ad Schaub, 1993]. The basic idea is t emply Kripke structures such that a fcused mdels structure (; ) crrespds t a set M f Kripke structures, where is captured by the actual wrlds i M ad by the accessible wrlds i M. The, a \preferred" set f Kripke structures M characterises a cstraied extesi (E,C ) such that E = f -mdal j M j= g ad C = f -mdal j M j= 2g. 4 Prerequisite-Free Appraches This secti discusses variats f DL ad CDL, wherei defaults are replaced by prerequisitefree cuterparts. This trasfrmati allws fr reasig by cases ad default ifereces ivlvig the ctrapsitive. Fr DL, the resultat system diers little frmally frm the rigial system; the majr dierece is that e lger eeds t prve the atecedet. This variat is discussed i Subsecti 4.1. Surprisigly, the prerequisite-free variat f CDL has quite dieret frmal prperties frm regular CDL. First, the resultat system is cumulative. Secd, i a limited, but -trivial maer, e ca w reas abut a set f defaults t determie, fr example, whether the applicability cditi f e default is subsumed by thers. This variat is discussed i Subsectis 4.2 ad 4.3. Fr clarity, we assume thrughut this secti that rmal ad semi-rmal defaults cstitute distict classes f defaults. This is t say, fr istace, that a semi-rmal default is e where the csequet is a lgical csequece f the justicati but t vice versa. 4.1 Prerequisite-Free Default Lgic This subsecti deals with the traslati f rmal ad semi-rmal defaults it their prerequisite-free cuterparts i DL. We have ted that i default reasig it wuld be useful t be able t reas by cases r reas by mdus tlles, uless such prperties are explicitly blcked. A ratiale is that a default cditial shuld retai prperties f the classical cditial, uless explicitly blcked. The emphasis the shifts t the cditial itself, rather tha a rule ivlvig a prerequisite ad justicati fr a cclusi. 19

20 Csider rst rmal defaults. The default is read as \if is prvably true ad is csistet, the is true". The readig we prpse is \if it is csistet that the cclude that ". Thus is ccluded (whe csistet) regardless f the BF prvability f. \Birds y" the is expressed prpsitially as BF. T be precise, we trasfrm rmal defaults it prerequisite-free rmal defaults i regular DL i the fllwig way. 7 () The resultig subsystem f DL, amely prerequisite-free default lgic, is referred t as PfDL. As a rst example, suppse that we have that, implausibly, A's are rmally B's ad A's are rmally t B's Example 4.1 The default thery A B The default thery B ; A B B AB AB ; AB AB ; ; has e extesi Th(;). ; ; has e extesi Th(fAg). Hece i the traslated thery we btai a reducti result if A's are rmally B's ad A's are als rmally t B's, the by default we ca cclude that A. Csider ext what this traslati meas fr reasig by cases. Fr Example 2.9 we btai Example 4.2 The default thery The default thery Q P P ; V P P QP QP ; V P V P ; fq _ V g has e extesi Th(fQ _ V g). ; fq _ V g has e extesi Th(fQ _ V; Pg). Thus if Quakers are rmally pacists, ad vegetarias are rmally pacists, the if smee is either a Quaker r vegetaria the, sice either Q r V are prvable, i DL either rule is applicable ad we cclude thig abut P. Hwever, ituitively, we kw that e f Q r V must be true, ad that P fllws by default frm either Q r V ; s arguably it shuld fllw by default that P. This ideed is the case fr the traslated defaults. A similar argumet applies t the ctrapsitive. Give that birds rmally y, the if smethig is kw t t y the it seems reasable t cclude by default that this thig is t a bird. Agai, we ca accmplish this if the cditial itself is ccluded wheever csistet. Example 4.3 The default thery The default thery B F F BF BF ; ffg has e extesi Th(fFg). ; ffg has e extesi Th(fB; Fg). There are hwever times whe we wat t blck the ctrapsitive; this issue is addressed usig semi-rmal defaults. The primary use f semi-rmal defaults is t specify that e default takes precedece ver thers [Reiter ad Criscul, 1981]. Fr example, csider the statemets \uiversity studets are typically adults", \adults are typically emplyed", ad \studets are typically t emplyed". 20

21 S A A ; A E E ; S E ; fsg has tw extesis E Th(fA; E; Sg) ad Th(fA; E; Sg). Example 4.4 The default thery The rst extesi is btaied by applyig the rst ad last default; the secd by applyig the rst tw defaults. Ituitively we wat ly e extesi, where E is true the mre specic default that studets are t emplyed shuld take precedece ver the less specic default that adults are emplyed. Oe pssible x is t assert that adults are t rmally A S A^S E studets (viz. ) ad the replace the secd default by. This results i a S E rmal default thery, but requires that we be able t assume that adults are t rmally studets. I additi, it frces us t cclude that a adult is a -studet, uless we ca prve therwise; it may well be that we wuld wat t remai agstic abut the fact f a pers's studethd. If we are uwillig r uable t make such a assumpti, semi-rmal defaults appear t be required. Example 4.4 (ct'd) The default thery S A A ; A S^E E ; S E E ; fsg has e extesi Th(fA; S; Eg). The same csideratis apply fr PfDL. Sice PfDL extesis are geeralisatis f extesis i regular DL (see Therem 4.1 belw), the prblem f ctrllig iteractis is mre acute. Csider the precedig example, traslated it PfDL Example 4.4 (ct'd) The default thery SA SA ; AE AE ; SE SE ; fsg has three extesis Th(fA; S; Eg), Th(fA; S; Eg), ad Th(fA; S; Eg). The third extesi results frm applyig the third ad secd defaults. We wuld like t blck the trasitivities implicit i the secd ad third extesis. The apprach here is t exted that f [Reiter ad Criscul, 1981] t prerequisite-free defaults. There are tw pssible traslatis replace ^ with ()^ () ; r replace ^ with (^) The rst pssibility carries as a \glbal" csistecy cditi, while the secd uses as a \lcal" csistecy cditi, uder the assumpti f. Hwever the secd alterative fails t blck the third extesi i the example abve. I additi, this alterative cat be used t satisfactrily blck the ctrapsitive (see belw). Hece we adpt the rst alterative. That is, we trasfrm semi-rmal defaults it prerequisite-free rmal defaults i DL i the fllwig way. ^ 7 ()^ I the precedig example, the default \adults are typically emplyed" is t applicable fr studets ad s we have Example 4.4 (ct'd) The default thery SA SA ; (AE)^S (AE) ; SE ; fsg has e extesi Th(fA; S; Eg). SE 21

22 Blckig the ctrapsitive f a cditial,, is a special case f this where is. Fr example, the ctrapsitive f the default, \A's are typically B's" is blcked by writig the rule as (AB)^B. If we are give W = fbg the clearly the default is iapplicable AB ad s we cat cclude A B r, csequetly, A. Nte that the default (AB)^B AB is equivalet t B AB. This last frm was suggested i [Brewka, 1991b], ad s the abve traslati may be regarded as a geeralisati f Brewka's. The fllwig therem shws that this traslati gives a system i which mre cclusis are frthcmig tha i the stadard apprach. Therem 4.1 Let (D; W ) be a semi-rmal default thery ad let (D 0 ; W ) be the thery where (^) 2 D i ()^ 2 D 0. If E is a extesi f (D; W ) the there is a () extesi f (D 0 ; W ), E 0, such that E E 0. Hwever we may als get mre extesis frm (D 0 ; W ). Example 4.5 The default thery A B^C ; B A^D B A (AB)^C (AB) The default thery Th(fA; Bg), Th(fA; Bg). ; fag has e extesi Th(fA; Bg). ; fag has tw extesis ; (BA)^D (BA) Of curse, the same result hlds fr rmal default theries. As a example, csider the previus e, where the last cjuct i the justicatis f each default is drpped. At rst sight, the abve disticti betwee rmal ad semi-rmal seems t be redudat. Hwever, tice that the precedig traslatis are sytax-depedet. This is why we distiguish betwee rmal ad semi-rmal defaults. 10 As a example, csider the default A B^B This is clearly a rmal default. Hwever, e culd be tempted t B trasfrm this default accrdig t the recipe give fr semi-rmal defaults. Hwever, this yields a dieret result tha trasfrmig the default A B accrdig t the recipe give fr B rmal defaults, as ca be easily veried. 11 As regards geeral defaults, we fllw [Etherigt, 1988; Lukaszewicz, 1990] i arguig that it is reasable t replace geeral defaults by semi-rmal es by cjiig the csequet t the justicati. I all, this amuts t the fllwig traslati i the case f geeral defaults i Reiter's DL 7 ^ 7 ()^ Fially, let us summarize the diereces betwee Reiter's DL ad its fragmet PfDL. I geeral, prerequisite-free rmal default theries ejy the same advatages as stadard rmal default theries, ad geeral prerequisite-free default theries suer frm the same drawbacks as stadard default theries. Apart frm cumulativity, bth types f rmal default theries have e f the diculties discussed i Secti 2.2, while bth types f geeral default theries have all f these diculties. 10 Recall that accrdig t the deiti give at start f this secti, rmal ad semi-rmal defaults are mutually exclusive. 11 We thak e f the referees fr this example. 22

Chapter 3.1: Polynomial Functions

Chapter 3.1: Polynomial Functions Ntes 3.1: Ply Fucs Chapter 3.1: Plymial Fuctis I Algebra I ad Algebra II, yu ecutered sme very famus plymial fuctis. I this secti, yu will meet may ther members f the plymial family, what sets them apart

More information

ENGI 4421 Central Limit Theorem Page Central Limit Theorem [Navidi, section 4.11; Devore sections ]

ENGI 4421 Central Limit Theorem Page Central Limit Theorem [Navidi, section 4.11; Devore sections ] ENGI 441 Cetral Limit Therem Page 11-01 Cetral Limit Therem [Navidi, secti 4.11; Devre sectis 5.3-5.4] If X i is t rmally distributed, but E X i, V X i ad is large (apprximately 30 r mre), the, t a gd

More information

D.S.G. POLLOCK: TOPICS IN TIME-SERIES ANALYSIS STATISTICAL FOURIER ANALYSIS

D.S.G. POLLOCK: TOPICS IN TIME-SERIES ANALYSIS STATISTICAL FOURIER ANALYSIS STATISTICAL FOURIER ANALYSIS The Furier Represetati f a Sequece Accrdig t the basic result f Furier aalysis, it is always pssible t apprximate a arbitrary aalytic fucti defied ver a fiite iterval f the

More information

ENGI 4421 Central Limit Theorem Page Central Limit Theorem [Navidi, section 4.11; Devore sections ]

ENGI 4421 Central Limit Theorem Page Central Limit Theorem [Navidi, section 4.11; Devore sections ] ENGI 441 Cetral Limit Therem Page 11-01 Cetral Limit Therem [Navidi, secti 4.11; Devre sectis 5.3-5.4] If X i is t rmally distributed, but E X i, V X i ad is large (apprximately 30 r mre), the, t a gd

More information

Multi-objective Programming Approach for. Fuzzy Linear Programming Problems

Multi-objective Programming Approach for. Fuzzy Linear Programming Problems Applied Mathematical Scieces Vl. 7 03. 37 8-87 HIKARI Ltd www.m-hikari.cm Multi-bective Prgrammig Apprach fr Fuzzy Liear Prgrammig Prblems P. Padia Departmet f Mathematics Schl f Advaced Scieces VIT Uiversity

More information

Intermediate Division Solutions

Intermediate Division Solutions Itermediate Divisi Slutis 1. Cmpute the largest 4-digit umber f the frm ABBA which is exactly divisible by 7. Sluti ABBA 1000A + 100B +10B+A 1001A + 110B 1001 is divisible by 7 (1001 7 143), s 1001A is

More information

5.1 Two-Step Conditional Density Estimator

5.1 Two-Step Conditional Density Estimator 5.1 Tw-Step Cditial Desity Estimatr We ca write y = g(x) + e where g(x) is the cditial mea fucti ad e is the regressi errr. Let f e (e j x) be the cditial desity f e give X = x: The the cditial desity

More information

BIO752: Advanced Methods in Biostatistics, II TERM 2, 2010 T. A. Louis. BIO 752: MIDTERM EXAMINATION: ANSWERS 30 November 2010

BIO752: Advanced Methods in Biostatistics, II TERM 2, 2010 T. A. Louis. BIO 752: MIDTERM EXAMINATION: ANSWERS 30 November 2010 BIO752: Advaced Methds i Bistatistics, II TERM 2, 2010 T. A. Luis BIO 752: MIDTERM EXAMINATION: ANSWERS 30 Nvember 2010 Questi #1 (15 pits): Let X ad Y be radm variables with a jit distributi ad assume

More information

Solutions. Definitions pertaining to solutions

Solutions. Definitions pertaining to solutions Slutis Defiitis pertaiig t slutis Slute is the substace that is disslved. It is usually preset i the smaller amut. Slvet is the substace that des the disslvig. It is usually preset i the larger amut. Slubility

More information

Grade 3 Mathematics Course Syllabus Prince George s County Public Schools

Grade 3 Mathematics Course Syllabus Prince George s County Public Schools Ctet Grade 3 Mathematics Curse Syllabus Price Gerge s Cuty Public Schls Prerequisites: Ne Curse Descripti: I Grade 3, istructial time shuld fcus fur critical areas: (1) develpig uderstadig f multiplicati

More information

Unifying the Derivations for. the Akaike and Corrected Akaike. Information Criteria. from Statistics & Probability Letters,

Unifying the Derivations for. the Akaike and Corrected Akaike. Information Criteria. from Statistics & Probability Letters, Uifyig the Derivatis fr the Akaike ad Crrected Akaike Ifrmati Criteria frm Statistics & Prbability Letters, Vlume 33, 1997, pages 201{208. by Jseph E. Cavaaugh Departmet f Statistics, Uiversity f Missuri,

More information

is caused by a latet utreated frm f syphilis, althugh the prbability that latet utreated syphilis leads t paresis is ly 25%. Nte that the directialiti

is caused by a latet utreated frm f syphilis, althugh the prbability that latet utreated syphilis leads t paresis is ly 25%. Nte that the directialiti Tempral Reasig with i-abducti Secd Draft Marc Deecker Kristf Va Belleghem Departmet f Cmputer Sciece, K.U.Leuve, Celestijelaa 200A, B-3001 Heverlee, Belgium. e-mail : marcd@cs.kuleuve.ac.be Abstract Abducti

More information

AP Statistics Notes Unit Eight: Introduction to Inference

AP Statistics Notes Unit Eight: Introduction to Inference AP Statistics Ntes Uit Eight: Itrducti t Iferece Syllabus Objectives: 4.1 The studet will estimate ppulati parameters ad margis f errrs fr meas. 4.2 The studet will discuss the prperties f pit estimatrs,

More information

Quantum Mechanics for Scientists and Engineers. David Miller

Quantum Mechanics for Scientists and Engineers. David Miller Quatum Mechaics fr Scietists ad Egieers David Miller Time-depedet perturbati thery Time-depedet perturbati thery Time-depedet perturbati basics Time-depedet perturbati thery Fr time-depedet prblems csider

More information

K [f(t)] 2 [ (st) /2 K A GENERALIZED MEIJER TRANSFORMATION. Ku(z) ()x) t -)-I e. K(z) r( + ) () (t 2 I) -1/2 e -zt dt, G. L. N. RAO L.

K [f(t)] 2 [ (st) /2 K A GENERALIZED MEIJER TRANSFORMATION. Ku(z) ()x) t -)-I e. K(z) r( + ) () (t 2 I) -1/2 e -zt dt, G. L. N. RAO L. Iterat. J. Math. & Math. Scl. Vl. 8 N. 2 (1985) 359-365 359 A GENERALIZED MEIJER TRANSFORMATION G. L. N. RAO Departmet f Mathematics Jamshedpur C-perative Cllege f the Rachi Uiversity Jamshedpur, Idia

More information

Markov processes and the Kolmogorov equations

Markov processes and the Kolmogorov equations Chapter 6 Markv prcesses ad the Klmgrv equatis 6. Stchastic Differetial Equatis Csider the stchastic differetial equati: dx(t) =a(t X(t)) dt + (t X(t)) db(t): (SDE) Here a(t x) ad (t x) are give fuctis,

More information

A Study on Estimation of Lifetime Distribution with Covariates Under Misspecification

A Study on Estimation of Lifetime Distribution with Covariates Under Misspecification Prceedigs f the Wrld Cgress Egieerig ad Cmputer Sciece 2015 Vl II, Octber 21-23, 2015, Sa Fracisc, USA A Study Estimati f Lifetime Distributi with Cvariates Uder Misspecificati Masahir Ykyama, Member,

More information

Author. Introduction. Author. o Asmir Tobudic. ISE 599 Computational Modeling of Expressive Performance

Author. Introduction. Author. o Asmir Tobudic. ISE 599 Computational Modeling of Expressive Performance ISE 599 Cmputatial Mdelig f Expressive Perfrmace Playig Mzart by Aalgy: Learig Multi-level Timig ad Dyamics Strategies by Gerhard Widmer ad Asmir Tbudic Preseted by Tsug-Ha (Rbert) Chiag April 5, 2006

More information

[1 & α(t & T 1. ' ρ 1

[1 & α(t & T 1. ' ρ 1 NAME 89.304 - IGNEOUS & METAMORPHIC PETROLOGY DENSITY & VISCOSITY OF MAGMAS I. Desity The desity (mass/vlume) f a magma is a imprtat parameter which plays a rle i a umber f aspects f magma behavir ad evluti.

More information

Function representation of a noncommutative uniform algebra

Function representation of a noncommutative uniform algebra Fucti represetati f a cmmutative uifrm algebra Krzysztf Jarsz Abstract. We cstruct a Gelfad type represetati f a real cmmutative Baach algebra A satisfyig f 2 = kfk 2, fr all f 2 A:. Itrducti A uifrm algebra

More information

The Excel FFT Function v1.1 P. T. Debevec February 12, The discrete Fourier transform may be used to identify periodic structures in time ht.

The Excel FFT Function v1.1 P. T. Debevec February 12, The discrete Fourier transform may be used to identify periodic structures in time ht. The Excel FFT Fucti v P T Debevec February 2, 26 The discrete Furier trasfrm may be used t idetify peridic structures i time ht series data Suppse that a physical prcess is represeted by the fucti f time,

More information

A New Method for Finding an Optimal Solution. of Fully Interval Integer Transportation Problems

A New Method for Finding an Optimal Solution. of Fully Interval Integer Transportation Problems Applied Matheatical Scieces, Vl. 4, 200,. 37, 89-830 A New Methd fr Fidig a Optial Sluti f Fully Iterval Iteger Trasprtati Prbles P. Padia ad G. Nataraja Departet f Matheatics, Schl f Advaced Scieces,

More information

Physical Chemistry Laboratory I CHEM 445 Experiment 2 Partial Molar Volume (Revised, 01/13/03)

Physical Chemistry Laboratory I CHEM 445 Experiment 2 Partial Molar Volume (Revised, 01/13/03) Physical Chemistry Labratry I CHEM 445 Experimet Partial Mlar lume (Revised, 0/3/03) lume is, t a gd apprximati, a additive prperty. Certaily this apprximati is used i preparig slutis whse ccetratis are

More information

Mean residual life of coherent systems consisting of multiple types of dependent components

Mean residual life of coherent systems consisting of multiple types of dependent components Mea residual life f cheret systems csistig f multiple types f depedet cmpets Serka Eryilmaz, Frak P.A. Cle y ad Tahai Cle-Maturi z February 20, 208 Abstract Mea residual life is a useful dyamic characteristic

More information

Ch. 1 Introduction to Estimation 1/15

Ch. 1 Introduction to Estimation 1/15 Ch. Itrducti t stimati /5 ample stimati Prblem: DSB R S f M f s f f f ; f, φ m tcsπf t + φ t f lectrics dds ise wt usually white BPF & mp t s t + w t st. lg. f & φ X udi mp cs π f + φ t Oscillatr w/ f

More information

Fourier Series & Fourier Transforms

Fourier Series & Fourier Transforms Experimet 1 Furier Series & Furier Trasfrms MATLAB Simulati Objectives Furier aalysis plays a imprtat rle i cmmuicati thery. The mai bjectives f this experimet are: 1) T gai a gd uderstadig ad practice

More information

Directional Duality Theory

Directional Duality Theory Suther Illiis Uiversity Carbdale OpeSIUC Discussi Papers Departmet f Ecmics 2004 Directial Duality Thery Daiel Primt Suther Illiis Uiversity Carbdale Rlf Fare Oreg State Uiversity Fllw this ad additial

More information

Active redundancy allocation in systems. R. Romera; J. Valdés; R. Zequeira*

Active redundancy allocation in systems. R. Romera; J. Valdés; R. Zequeira* Wrkig Paper -6 (3) Statistics ad Ecmetrics Series March Departamet de Estadística y Ecmetría Uiversidad Carls III de Madrid Calle Madrid, 6 893 Getafe (Spai) Fax (34) 9 64-98-49 Active redudacy allcati

More information

MATHEMATICS 9740/01 Paper 1 14 Sep hours

MATHEMATICS 9740/01 Paper 1 14 Sep hours Cadidate Name: Class: JC PRELIMINARY EXAM Higher MATHEMATICS 9740/0 Paper 4 Sep 06 3 hurs Additial Materials: Cver page Aswer papers List f Frmulae (MF5) READ THESE INSTRUCTIONS FIRST Write yur full ame

More information

ALE 26. Equilibria for Cell Reactions. What happens to the cell potential as the reaction proceeds over time?

ALE 26. Equilibria for Cell Reactions. What happens to the cell potential as the reaction proceeds over time? Name Chem 163 Secti: Team Number: AL 26. quilibria fr Cell Reactis (Referece: 21.4 Silberberg 5 th editi) What happes t the ptetial as the reacti prceeds ver time? The Mdel: Basis fr the Nerst quati Previusly,

More information

UNIVERSITY OF TECHNOLOGY. Department of Mathematics PROBABILITY THEORY, STATISTICS AND OPERATIONS RESEARCH GROUP. Memorandum COSOR 76-10

UNIVERSITY OF TECHNOLOGY. Department of Mathematics PROBABILITY THEORY, STATISTICS AND OPERATIONS RESEARCH GROUP. Memorandum COSOR 76-10 EI~~HOVEN UNIVERSITY OF TECHNOLOGY Departmet f Mathematics PROBABILITY THEORY, STATISTICS AND OPERATIONS RESEARCH GROUP Memradum COSOR 76-10 O a class f embedded Markv prcesses ad recurrece by F.H. Sims

More information

Fourier Method for Solving Transportation. Problems with Mixed Constraints

Fourier Method for Solving Transportation. Problems with Mixed Constraints It. J. Ctemp. Math. Scieces, Vl. 5, 200,. 28, 385-395 Furier Methd fr Slvig Trasprtati Prblems with Mixed Cstraits P. Padia ad G. Nataraja Departmet f Mathematics, Schl f Advaced Scieces V I T Uiversity,

More information

Abstract: The asympttically ptimal hypthesis testig prblem with the geeral surces as the ull ad alterative hyptheses is studied uder expetial-type err

Abstract: The asympttically ptimal hypthesis testig prblem with the geeral surces as the ull ad alterative hyptheses is studied uder expetial-type err Hypthesis Testig with the Geeral Surce y Te Su HAN z April 26, 2000 y This paper is a exteded ad revised versi f Sectis 4.4 4.7 i Chapter 4 f the Japaese bk f Ha [8]. z Te Su Ha is with the Graduate Schl

More information

Copyright 1978, by the author(s). All rights reserved.

Copyright 1978, by the author(s). All rights reserved. Cpyright 1978, by the authr(s). All rights reserved. Permissi t make digital r hard cpies f all r part f this wrk fr persal r classrm use is grated withut fee prvided that cpies are t made r distributed

More information

the legitimate cmmuicatrs, called Alice ad Bb, ad the adversary (which may therwise iitiate a cversati with Alice pretedig t be Bb). We list sme ppula

the legitimate cmmuicatrs, called Alice ad Bb, ad the adversary (which may therwise iitiate a cversati with Alice pretedig t be Bb). We list sme ppula Sessi-Key Geerati usig Huma Passwrds Oly Oded Gldreich? ad Yehuda Lidell Departmet f Cmputer Sciece ad Applied Math, Weizma Istitute f Sciece, Rehvt, Israel. fded,lidellg@wisdm.weizma.ac.il Abstract. We

More information

In: Proceedings of the Fourteenth International Joint Conference on Articial Intelligence (IJCAI-95), C. Mellish

In: Proceedings of the Fourteenth International Joint Conference on Articial Intelligence (IJCAI-95), C. Mellish I: rceedigs f the Furteeth Iteratial Jit Cferece Articial Itelligece (IJCAI-95), C. Mellish ed, Mrga Kaufma, 1995. I press. Sematics ad Cmplexity f Abducti frm Default Theries (Exteded abstract ) Thmas

More information

The generalized marginal rate of substitution

The generalized marginal rate of substitution Jural f Mathematical Ecmics 31 1999 553 560 The geeralized margial rate f substituti M Besada, C Vazuez ) Facultade de Ecmicas, UiÕersidade de Vig, Aptd 874, 3600 Vig, Spai Received 31 May 1995; accepted

More information

A Hartree-Fock Calculation of the Water Molecule

A Hartree-Fock Calculation of the Water Molecule Chemistry 460 Fall 2017 Dr. Jea M. Stadard Nvember 29, 2017 A Hartree-Fck Calculati f the Water Mlecule Itrducti A example Hartree-Fck calculati f the water mlecule will be preseted. I this case, the water

More information

, the random variable. and a sample size over the y-values 0:1:10.

, the random variable. and a sample size over the y-values 0:1:10. Lecture 3 (4//9) 000 HW PROBLEM 3(5pts) The estimatr i (c) f PROBLEM, p 000, where { } ~ iid bimial(,, is 000 e f the mst ppular statistics It is the estimatr f the ppulati prprti I PROBLEM we used simulatis

More information

Super-efficiency Models, Part II

Super-efficiency Models, Part II Super-efficiec Mdels, Part II Emilia Niskae The 4th f Nvember S steemiaalsi Ctets. Etesis t Variable Returs-t-Scale (0.4) S steemiaalsi Radial Super-efficiec Case Prblems with Radial Super-efficiec Case

More information

ON FREE RING EXTENSIONS OF DEGREE N

ON FREE RING EXTENSIONS OF DEGREE N I terat. J. Math. & Mah. Sci. Vl. 4 N. 4 (1981) 703-709 703 ON FREE RING EXTENSIONS OF DEGREE N GEORGE SZETO Mathematics Departmet Bradley Uiversity Peria, Illiis 61625 U.S.A. (Received Jue 25, 1980) ABSTRACT.

More information

Every gas consists of a large number of small particles called molecules moving with very high velocities in all possible directions.

Every gas consists of a large number of small particles called molecules moving with very high velocities in all possible directions. Kietic thery f gases ( Kietic thery was develped by Berlli, Jle, Clasis, axwell ad Bltzma etc. ad represets dyamic particle r micrscpic mdel fr differet gases sice it thrws light the behir f the particles

More information

Regression Quantiles for Time Series Data ZONGWU CAI. Department of Mathematics. Abstract

Regression Quantiles for Time Series Data ZONGWU CAI. Department of Mathematics.   Abstract Regressi Quatiles fr Time Series Data ZONGWU CAI Departmet f Mathematics Uiversity f Nrth Carlia Charltte, NC 28223, USA E-mail: zcai@ucc.edu Abstract I this article we study parametric estimati f regressi

More information

Claude Elysée Lobry Université de Nice, Faculté des Sciences, parc Valrose, NICE, France.

Claude Elysée Lobry Université de Nice, Faculté des Sciences, parc Valrose, NICE, France. CHAOS AND CELLULAR AUTOMATA Claude Elysée Lbry Uiversité de Nice, Faculté des Scieces, parc Valrse, 06000 NICE, Frace. Keywrds: Chas, bifurcati, cellularautmata, cmputersimulatis, dyamical system, ifectius

More information

are specified , are linearly independent Otherwise, they are linearly dependent, and one is expressed by a linear combination of the others

are specified , are linearly independent Otherwise, they are linearly dependent, and one is expressed by a linear combination of the others Chater 3. Higher Order Liear ODEs Kreyszig by YHLee;4; 3-3. Hmgeeus Liear ODEs The stadard frm f the th rder liear ODE ( ) ( ) = : hmgeeus if r( ) = y y y y r Hmgeeus Liear ODE: Suersiti Pricile, Geeral

More information

We can see from the graph above that the intersection is, i.e., [ ).

We can see from the graph above that the intersection is, i.e., [ ). MTH 111 Cllege Algebra Lecture Ntes July 2, 2014 Functin Arithmetic: With nt t much difficulty, we ntice that inputs f functins are numbers, and utputs f functins are numbers. S whatever we can d with

More information

MA131 - Analysis 1. Workbook 3 Sequences II

MA131 - Analysis 1. Workbook 3 Sequences II MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................

More information

x 2 x 3 x b 0, then a, b, c log x 1 log z log x log y 1 logb log a dy 4. dx As tangent is perpendicular to the x axis, slope

x 2 x 3 x b 0, then a, b, c log x 1 log z log x log y 1 logb log a dy 4. dx As tangent is perpendicular to the x axis, slope The agle betwee the tagets draw t the parabla y = frm the pit (-,) 5 9 6 Here give pit lies the directri, hece the agle betwee the tagets frm that pit right agle Ratig :EASY The umber f values f c such

More information

Identical Particles. We would like to move from the quantum theory of hydrogen to that for the rest of the periodic table

Identical Particles. We would like to move from the quantum theory of hydrogen to that for the rest of the periodic table We wuld like t ve fr the quatu thery f hydrge t that fr the rest f the peridic table Oe electr at t ultielectr ats This is cplicated by the iteracti f the electrs with each ther ad by the fact that the

More information

TEST TUBE SYSTEMS WITH CUTTING/RECOMBINATION OPERATIONS Rudolf FREUND Institut fur Computersprachen, Technische Universitat Wien Resselgasse 3, 1040 W

TEST TUBE SYSTEMS WITH CUTTING/RECOMBINATION OPERATIONS Rudolf FREUND Institut fur Computersprachen, Technische Universitat Wien Resselgasse 3, 1040 W TEST TUBE SYSTEMS WITH CUTTING/RECOMBINATION OPERATIONS Rudlf FREUND Istitut fur Cmputersprache, Techische Uiversitat Wie Resselgasse 3, 1040 Wie, Austria email: rudi@lgic.tuwie.ac.at Erzsebet CSUHAJ-VARJ

More information

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

Section 4.3. Boolean functions

Section 4.3. Boolean functions Sectio 4.3. Boolea fuctios Let us take aother look at the simplest o-trivial Boolea algebra, ({0}), the power-set algebra based o a oe-elemet set, chose here as {0}. This has two elemets, the empty set,

More information

Revisiting the Socrates Example

Revisiting the Socrates Example Sectin 1.6 Sectin Summary Valid Arguments Inference Rules fr Prpsitinal Lgic Using Rules f Inference t Build Arguments Rules f Inference fr Quantified Statements Building Arguments fr Quantified Statements

More information

Axial Temperature Distribution in W-Tailored Optical Fibers

Axial Temperature Distribution in W-Tailored Optical Fibers Axial Temperature Distributi i W-Tailred Optical ibers Mhamed I. Shehata (m.ismail34@yah.cm), Mustafa H. Aly(drmsaly@gmail.cm) OSA Member, ad M. B. Saleh (Basheer@aast.edu) Arab Academy fr Sciece, Techlgy

More information

MATH Midterm Examination Victor Matveev October 26, 2016

MATH Midterm Examination Victor Matveev October 26, 2016 MATH 33- Midterm Examiati Victr Matveev Octber 6, 6. (5pts, mi) Suppse f(x) equals si x the iterval < x < (=), ad is a eve peridic extesi f this fucti t the rest f the real lie. Fid the csie series fr

More information

Declarative approach to cyclic steady state space refinement: periodic process scheduling

Declarative approach to cyclic steady state space refinement: periodic process scheduling It J Adv Mauf Techl DOI 10.1007/s00170-013-4760-0 ORIGINAL ARTICLE Declarative apprach t cyclic steady state space refiemet: peridic prcess schedulig Grzegrz Bcewicz Zbigiew A. Baaszak Received: 16 April

More information

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer. 6 Itegers Modulo I Example 2.3(e), we have defied the cogruece of two itegers a,b with respect to a modulus. Let us recall that a b (mod ) meas a b. We have proved that cogruece is a equivalece relatio

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

Study of Energy Eigenvalues of Three Dimensional. Quantum Wires with Variable Cross Section

Study of Energy Eigenvalues of Three Dimensional. Quantum Wires with Variable Cross Section Adv. Studies Ther. Phys. Vl. 3 009. 5 3-0 Study f Eergy Eigevalues f Three Dimesial Quatum Wires with Variale Crss Secti M.. Sltai Erde Msa Departmet f physics Islamic Aad Uiversity Share-ey rach Ira alrevahidi@yah.cm

More information

Axioms of Measure Theory

Axioms of Measure Theory MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that

More information

Examination No. 3 - Tuesday, Nov. 15

Examination No. 3 - Tuesday, Nov. 15 NAME (lease rit) SOLUTIONS ECE 35 - DEVICE ELECTRONICS Fall Semester 005 Examiati N 3 - Tuesday, Nv 5 3 4 5 The time fr examiati is hr 5 mi Studets are allwed t use 3 sheets f tes Please shw yur wrk, artial

More information

Efficient Static Analysis of XML Paths and Types

Efficient Static Analysis of XML Paths and Types Efficiet Static Aalysis f XML Paths ad Types Pierre Geevès, Nabil Layaïda, Ala Schmitt T cite this versi: Pierre Geevès, Nabil Layaïda, Ala Schmitt Efficiet Static Aalysis f XML Paths ad Types Prceedigs

More information

CS284A: Representations and Algorithms in Molecular Biology

CS284A: Representations and Algorithms in Molecular Biology CS284A: Represetatios ad Algorithms i Molecular Biology Scribe Notes o Lectures 3 & 4: Motif Discovery via Eumeratio & Motif Represetatio Usig Positio Weight Matrix Joshua Gervi Based o presetatios by

More information

1. Itrducti Let X fx(t) t 0g be a symmetric stable prcess f idex, with X(0) 0. That is, X has idepedet ad statiary icremets, with characteristic fucti

1. Itrducti Let X fx(t) t 0g be a symmetric stable prcess f idex, with X(0) 0. That is, X has idepedet ad statiary icremets, with characteristic fucti The mst visited sites f symmetric stable prcesses by Richard F. Bass 1, Nathalie Eisebaum ad Zha Shi Uiversity f Cecticut, Uiversite aris VI ad Uiversite aris VI Summary. Let X be a symmetric stable prcess

More information

Recovery of Third Order Tensors via Convex Optimization

Recovery of Third Order Tensors via Convex Optimization Recvery f Third Order Tesrs via Cvex Optimizati Hlger Rauhut RWTH Aache Uiversity Lehrstuhl C für Mathematik (Aalysis) Ptdriesch 10 5056 Aache Germay Email: rauhut@mathcrwth-aachede Željka Stjaac RWTH

More information

On the affine nonlinearity in circuit theory

On the affine nonlinearity in circuit theory O the affie liearity i circuit thery Emauel Gluski The Kieret Cllege the Sea f Galilee; ad Ort Braude Cllege (Carmiel), Israel. gluski@ee.bgu.ac.il; http://www.ee.bgu.ac.il/~gluski/ E. Gluski, O the affie

More information

Hypothesis Tests for One Population Mean

Hypothesis Tests for One Population Mean Hypthesis Tests fr One Ppulatin Mean Chapter 9 Ala Abdelbaki Objective Objective: T estimate the value f ne ppulatin mean Inferential statistics using statistics in rder t estimate parameters We will be

More information

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014.

Product measures, Tonelli s and Fubini s theorems For use in MAT3400/4400, autumn 2014 Nadia S. Larsen. Version of 13 October 2014. Product measures, Toelli s ad Fubii s theorems For use i MAT3400/4400, autum 2014 Nadia S. Larse Versio of 13 October 2014. 1. Costructio of the product measure The purpose of these otes is to preset the

More information

arxiv: v1 [cs.cg] 31 Mar 2013

arxiv: v1 [cs.cg] 31 Mar 2013 Fidig a argest empty cvex subset i space is W[]-hard Pas Giapus. Christia Kauer May 0, 04 arxiv:304.047v [cs.cg] 3 Mar 03 Abstract We csider the fwig prbem: Give a pit set i space fid a argest subset that

More information

. Prelimiaries ad otatios Let f C q [ 1 1] be give, where q 0. The for a xed r such that q < r q + 1 we dee a polyomial H r f of degree at most + r 1

. Prelimiaries ad otatios Let f C q [ 1 1] be give, where q 0. The for a xed r such that q < r q + 1 we dee a polyomial H r f of degree at most + r 1 Poitwise Gopegauz Estimates for Iterpolatio T. Kilgore ad J. Presti Abstract We derive some ew poitwise estimates for the error i simultaeous approximatio of a fuctio f C q [ 1 1] ad its derivatives by

More information

Comparative analysis of bayesian control chart estimation and conventional multivariate control chart

Comparative analysis of bayesian control chart estimation and conventional multivariate control chart America Jural f Theretical ad Applied Statistics 3; ( : 7- ublished lie Jauary, 3 (http://www.sciecepublishiggrup.cm//atas di:.648/.atas.3. Cmparative aalysis f bayesia ctrl chart estimati ad cvetial multivariate

More information

An epsilon-based measure of efficiency in DEA revisited -A third pole of technical efficiency-

An epsilon-based measure of efficiency in DEA revisited -A third pole of technical efficiency- GRIPS Plicy Ifrmati Ceter Discussi Paper : 09-2 A epsil-based measure f efficiecy i DEA revisited -A third ple f techical efficiecy- Karu Te Natial Graduate Istitute fr Plicy Studies 7-22- Rppgi, Miat-ku,

More information

The focusing Manakov system with nonzero boundary conditions

The focusing Manakov system with nonzero boundary conditions Nliearity 8 (05) 30 35 Ld Mathematical Sciety Nliearity di:0088/095-775/8/9/30 The fcusig Maakv system with er budary cditis Daiel Kraus Gi Bidii ad Gregr Kvačič State Uiversity f New Yrk at Buffal Departmet

More information

SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis

SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical model for microarray data analysis SUPPLEMENTARY MATERIAL GaGa: a simple and flexible hierarchical mdel fr micrarray data analysis David Rssell Department f Bistatistics M.D. Andersn Cancer Center, Hustn, TX 77030, USA rsselldavid@gmail.cm

More information

WEST VIRGINIA UNIVERSITY

WEST VIRGINIA UNIVERSITY WEST VIRGINIA UNIVERSITY PLASMA PHYSICS GROUP INTERNAL REPORT PL - 045 Mea Optical epth ad Optical Escape Factr fr Helium Trasitis i Helic Plasmas R.F. Bivi Nvember 000 Revised March 00 TABLE OF CONTENT.0

More information

Distributed Trajectory Generation for Cooperative Multi-Arm Robots via Virtual Force Interactions

Distributed Trajectory Generation for Cooperative Multi-Arm Robots via Virtual Force Interactions 862 IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS PART B: CYBERNETICS, VOL. 27, NO. 5, OCTOBER 1997 Distributed Trajectry Geerati fr Cperative Multi-Arm Rbts via Virtual Frce Iteractis Tshi Tsuji,

More information

Lecture 21: Signal Subspaces and Sparsity

Lecture 21: Signal Subspaces and Sparsity ECE 830 Fall 00 Statistical Sigal Prcessig istructr: R. Nwak Lecture : Sigal Subspaces ad Sparsity Sigal Subspaces ad Sparsity Recall the classical liear sigal mdel: X = H + w, w N(0, where S = H, is a

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

Full algebra of generalized functions and non-standard asymptotic analysis

Full algebra of generalized functions and non-standard asymptotic analysis Full algebra f geeralized fuctis ad -stadard asympttic aalysis Tdr D. Tdrv Has Veraeve Abstract We cstruct a algebra f geeralized fuctis edwed with a caical embeddig f the space f Schwartz distributis.

More information

General Chemistry 1 (CHEM1141) Shawnee State University Fall 2016

General Chemistry 1 (CHEM1141) Shawnee State University Fall 2016 Geeral Chemistry 1 (CHEM1141) Shawee State Uiversity Fall 2016 September 23, 2016 Name E x a m # I C Please write yur full ame, ad the exam versi (IC) that yu have the scatr sheet! Please 0 check the bx

More information

1 Introduction to reducing variance in Monte Carlo simulations

1 Introduction to reducing variance in Monte Carlo simulations Copyright c 010 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a ukow mea µ = E(X) of a distributio by

More information

Mathematical Induction

Mathematical Induction Mathematical Iductio Itroductio Mathematical iductio, or just iductio, is a proof techique. Suppose that for every atural umber, P() is a statemet. We wish to show that all statemets P() are true. I a

More information

Design and Implementation of Cosine Transforms Employing a CORDIC Processor

Design and Implementation of Cosine Transforms Employing a CORDIC Processor C16 1 Desig ad Implemetati f Csie Trasfrms Emplyig a CORDIC Prcessr Sharaf El-Di El-Nahas, Ammar Mttie Al Hsaiy, Magdy M. Saeb Arab Academy fr Sciece ad Techlgy, Schl f Egieerig, Alexadria, EGYPT ABSTRACT

More information

5.80 Small-Molecule Spectroscopy and Dynamics

5.80 Small-Molecule Spectroscopy and Dynamics MIT OpeCurseWare http://cw.mit.edu 5.8 Small-Mlecule Spectrscpy ad Dyamics Fall 8 Fr ifrmati abut citig these materials r ur Terms f Use, visit: http://cw.mit.edu/terms. 5.8 Lecture #33 Fall, 8 Page f

More information

IJISET - International Journal of Innovative Science, Engineering & Technology, Vol. 2 Issue 12, December

IJISET - International Journal of Innovative Science, Engineering & Technology, Vol. 2 Issue 12, December IJISET - Iteratial Jural f Ivative Sciece, Egieerig & Techlgy, Vl Issue, December 5 wwwijisetcm ISSN 48 7968 Psirmal ad * Pararmal mpsiti Operatrs the Fc Space Abstract Dr N Sivamai Departmet f athematics,

More information

Tail Probabilities and Almost Sure Bounds for Martingales. W.L. Steiger

Tail Probabilities and Almost Sure Bounds for Martingales. W.L. Steiger Tail Prbabilities ad Almst Sure Buds fr Martigales by W.L. Steiger A thesis preseted t the Australia Natial Uiversity fr the degree f Dctr f Philsphy i the Departmet f Statistics July 1969. Statemet Uless

More information

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes

Partial-Sum Queries in OLAP Data Cubes Using Covering Codes 326 IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 2, DECEMBER 998 Partial-Sum Queries i OLAP Data Cubes Usig Cverig Cdes Chig-Tie H, Member, IEEE, Jehshua Bruck, Seir Member, IEEE, ad Rakesh Agrawal, Seir

More information

QUADRATURE FORMULAS ON THE UNIT CIRCLE BASED ON RATIONAL FUNCTIONS

QUADRATURE FORMULAS ON THE UNIT CIRCLE BASED ON RATIONAL FUNCTIONS QUADRATURE FORMULAS ON THE UNIT CIRCLE BASED ON RATIONAL FUNCTIONS Adhemar Bultheel Dept. f Cmputer Scieces, K. U. Leuve, Belgium Erik Hedrikse Dept. f Mathematics, Uiversity f Amsterdam, The Netherlads

More information

HOMEWORK 2 SOLUTIONS

HOMEWORK 2 SOLUTIONS HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k

More information

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

Sequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Internal vs. external validity. External validity. Internal validity

Internal vs. external validity. External validity. Internal validity Secti 7 Mdel Assessmet Iteral vs. exteral validity Iteral validity refers t whether the aalysis is valid fr the pplati ad sample beig stdied. Exteral validity refers t whether these reslts ca be geeralized

More information

An Investigation of Stratified Jackknife Estimators Using Simulated Establishment Data Under an Unequal Probability Sample Design

An Investigation of Stratified Jackknife Estimators Using Simulated Establishment Data Under an Unequal Probability Sample Design Secti Survey Research Methds SM 9 A Ivestigati f Stratified ackkife Estimatrs Usig Simulated Establishmet Data Uder a Uequal Prbability Sample Desig Abstract Plip Steel, Victria McNerey, h Slata Csiderig

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in

Classroom. We investigate and further explore the problem of dividing x = n + m (m, n are coprime) sheep in Classroom I this sectio of Resoace, we ivite readers to pose questios likely to be raised i a classroom situatio. We may suggest strategies for dealig with them, or ivite resposes, or both. Classroom is

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Math 61CM - Solutions to homework 3

Math 61CM - Solutions to homework 3 Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig

More information

MULTIDIMENSIONAL EXTENICS THEORY

MULTIDIMENSIONAL EXTENICS THEORY U.P.B. Sci. Bull., Series A, Vl. 75, Iss. 1, 213 ISSN 1223-727 MULTIDIMENSIONAL EXTENICS THEORY Ovidiu Ilie ŞANDRU 1, Luige VLǍDAREANU 2, Paul ŞCHIOPU 3, Victr VLǍDAREANU 4, Alexadra ŞANDRU 5 Î această

More information