Complexity Results in Epistemic Planning
|
|
- Jodie Blankenship
- 8 years ago
- Views:
Transcription
1 Proceedings of the Twenty-Fourth Interntionl Joint Conference on Artificil Intelligence (IJCAI 2015) Complexity Results in Epistemic Plnning Thoms Bolnder DTU Compute Tech. University of Denmrk Copenhgen, Denmrk Mrtin Holm Jensen DTU Compute Tech. University of Denmrk Copenhgen, Denmrk Frncois Schwrzentruer IRISA ENS Rennes Rennes, Frnce Astrct Epistemic plnning is very expressive frmework tht extends utomted plnning y the incorportion of dynmic epistemic logic (DEL). We provide complexity results on the pln existence prolem for multi-gent plnning tsks, focusing on purely epistemic ctions with propositionl preconditions. We show tht moving from epistemic preconditions to propositionl preconditions mkes it decidle, more precisely in EXPSPACE. The pln existence prolem is PSPACE-complete when the underlying grphs re trees nd NP-complete when they re chins (including singletons). We lso show PSPACE-hrdness of the pln verifiction prolem, which strengthens previous results on the complexity of DEL model checking. 1 Introduction An ll-pervding focus of rtificil intelligence (AI) is the development of rtionl, utonomous gents. An importnt trit of such n gent is tht it is le to exhiit gol-directed ehviour, nd this overrching im is wht is studied within the field of utomted plnning. At the sme time, such gol-directed ehviour will nturlly e confined to whtever model of the underlying domin is used. In utomted plnning the domin models employed re formulted using propositionl logic, ut in more complex settings (e.g. multigent domins) such models come up short due to the limited expressive power of propositionl logic. By extending (or replcing) this foundtionl uilding lock of utomted plnning we otin more expressive formlism for studying nd developing gol-directed gents, enling for instnce n gent to reson out other gents. For the ove resons utomted plnning hs recently seen n influx of formlisms tht re colloquilly referred to s epistemic plnning [Bolnder nd Andersen, 2011; Löwe et l., 2011; Aucher nd Bolnder, 2013; Yu et l., 2013; Andersen et l., 2012]. Common to these pproches is tht they tke dynmic epistemic logic (DEL) [Bltg et l., 1998] s the sic uilding lock of utomted plnning, which gretly surpsses propositionl logic in terms of expressive power. Briefly put, DEL is modl logic with which we cn reson out the dynmics of knowledge. In the singlegent cse, epistemic plnning cn cpture non-deterministic nd prtilly oservle domins [Andersen et l., 2012]. An even more interesting feture of DEL is the inherent ility to reson out multi-gent scenrios, lending itself perfectly to nturl descriptions of multi-gent plnning tsks. In [Bolnder nd Andersen, 2011] it is shown tht the pln existence prolem (i.e. deciding whether pln exists for multi-gent plnning tsk) is undecidle, nd this remins so even when fctul chnge is not llowed, tht is, when we only llow ctions tht chnges eliefs, not ontic fcts [Aucher nd Bolnder, 2013]. Allowing for fctul chnge, decidle frgment is otined y restricting epistemic ctions to only hve propositionl preconditions [Yu et l., 2013] (in the full frmework, preconditions of ctions cn e ritrry epistemic formuls). The computtionl complexity of this frgment elongs to (d + 1)-EXPTIME for gol whose modl depth is d [Muert, 2014]. In this work we consider exclusively the pln existence prolem for clsses of plnning tsks where preconditions re propositionl (s in most utomted plnning formlisms) nd ctions re non-fctul (chnging only eliefs). We show this prolem to e in EXPSPACE in the generl cse, ut lso identify frgments with tight complexity results. We do so y using the notion of epistemic ction stilistion [vn Benthem, 2003; Miller nd Moss, 2005; Sdzik, 2006], which llows us to put n upper ound on the numer of times n ction needs to e executed in pln. This numer depends crucilly on the structurl properties of the grph underlying the epistemic ction. To chieve our upper ound complexity results we generlise result of [Sdzik, 2006] on ction stilistion. We lso tckle lower ounds, therey showing cler computtionl seprtion etween these frgments. Our contriutions to the complexity of the pln existence prolem re summrised in Tle 1 (second column from the left), where we ve lso listed relted contriutions. The frgments we study hve oth conceptul nd technicl motivtion. Singleton epistemic ctions correspond to pulic nnouncements of propositionl fcts, chins nd trees to certin forms of privte nnouncements, nd grphs cpture ny propositionl epistemic ction. Possile pplictions of such plnning frgments could e.g. e plnning in gmes like Clue/Cluedo where ctions cn e seen s purely epistemic; or synthesis of protocols for secure communiction (where 2791
2 Underlying grphs of ctions SINGLETONS CHAINS TREES GRAPHS Non-fctul, propositionl preconditions NP-complete (Theorem 5.1) NP-complete (Theorem 5.2) PSPACE-complete (Theorem 5.3, Theorem 5.4) in EXPSPACE (Theorem 5.8) Types of epistemic ctions Fctul, propositionl preconditions PSPACE-hrd [Jensen, 2014] in NON- ELEMENTARY [Yu et l., 2013] Fctul, epistemic preconditions PSPACE-hrd [Jensen, 2014] Undecidle [Bolnder nd Andersen, 2011] Tle 1: Complexity results for the pln existence prolem. the gol specifies who re llowed to know wht). Techniclly our frgments increse in complexity s we loosen the restrictions put on the underlying grph. Some plnning tsks might therefore e simplified during preprocessing phse so tht etter upper ound cn e gurnteed. As cse in point, we cn preprocess ny plnning tsk nd replce ech grph ction with tree ction tht is equivlent up to predetermined modl depth k (y unrvelling). Letting k e the modl depth of the gol formul we otin n equivlent plnning tsk tht cn e solved using t most spce polynomil in k nd the size of the plnning tsk. In utomted plnning such preprocessing is often used to chieve sclle plnning systems. Our results lso llow us to prove tht the pln verifiction prolem ( suprolem of DEL model checking) is PSPACEhrd, even without non-deterministic union, therey improving the result of [Aucher nd Schwrzentruer, 2013]. Sections 2 nd 3 present the core notions from epistemic plnning. In Section 4 we improve the known upper ounds on the stilistion of epistemic ctions. This is put to use in Section 5 where we show novel results on the complexity of the pln existence prolem. Section 6 presents our improvement to the pln verifiction prolem, efore we conclude nd discuss future work in Section 7. 2 Bckground on Epistemic Plnning For the reminder of the pper we fix oth n infinitely countle set of tomic propositions P nd finite set of gents Ag. 2.1 Dynmic epistemic logic Definition 2.1 (Epistemic models nd sttes). An epistemic model is triple M = (W, R, V ) where the domin W is non-empty set of worlds; R : Ag 2 W W ssigns n epistemic (ccessiility) reltion to ech gent; nd V : P 2 W ssigns vlution to ech tomic proposition. We write R for R() nd wr v for (w, v) R. We often write W M for W, R M for R nd V M for V. For w W, the pir (M, w) is clled n epistemic stte whose ctul world is w. (M, w) is finite when W is finite. Epistemic sttes re typiclly denoted y symols such s s nd s 0. The lnguge of propositionl logic over P is referred to s L Prop, or sometimes simply the propositionl lnguge. Definition 2.2 (Propositionl ction models nd epistemic ctions). A propositionl ction model is triple A = (E, Q, pre) where E is non-empty nd finite set of events clled the domin of A; Q : Ag 2 E E ssigns n epistemic (ccessiility) reltion to ech gent; nd pre : E L Prop ssigns precondition of the propositionl lnguge to ech event. We write Q for Q() nd eq f for (e, f) Q. We often write E A for E, Q A for Q nd pre A for pre. For e E, the pir (A, e) is clled n epistemic ction whose ctul event is e. Epistemic ctions re typiclly denoted α, α, α 1, etc. Propositionl ction models re defined to fit exctly our line of investigtion here, though other presenttions consider preconditions of more complex lnguges nd postconditions tht llow for fctul (ontic) chnge [Bolnder nd Andersen, 2011; Yu et l., 2013]. The dynmic lnguge L D is generted y the BNF: ϕ := p ϕ (ϕ ϕ) ϕ α ϕ where Ag, p P nd α is n epistemic ction. Here denotes the knowledge (or, elief) modlity where ϕ reds s knows (or, elieves) ϕ, nd α is the dynmic modlity where α ϕ reds s α is pplicle nd ϕ holds fter executing α. The epistemic lnguge L E is the sulnguge of L D tht does not contin the dynmic modlity. As usul we use ϕ := ϕ, nd define y revition, nd the oolen connectives,,. Lstly, we define α 0 ϕ := ϕ nd α k ϕ := α ( α k 1 ϕ) for k > 0. Definition 2.3 (Semntics). Let (M, w) e n epistemic stte where M = (W, R, V ). For Ag, p P nd ϕ, ϕ L D we inductively define truth of formuls s follows, omitting the propositionl cses: (M, w) = ϕ (M, w) = α ϕ iff (M, v) = ϕ for ll wr v iff (M, w) = pre(e) nd (M A, (w, e)) = ϕ where α = (A, e) is n epistemic ction s.t. A = (E, Q, pre), nd the epistemic model M A = (W, R, V ) is defined vi the product updte opertor y: W = {(v, f) W E (M, v) = pre(f)}, R = {((v, f), (u, g)) W W vr u, fq g}, V (p) = {(v, f) W v V (p)} for p P. For ny epistemic stte s = (M, w) nd epistemic ction α = (A, e) stisfying (M, w) = pre A (e), we define s α = (M A, (w, e)). The epistemic stte s α represents the result of executing α in s. Note tht we hve s = α ϕ iff (M, w) = pre A (e) nd s α = ϕ. Two formuls ϕ, ϕ of L D re clled equivlent (written s ϕ ϕ ) when s = ϕ iff s = ϕ for every epistemic stte s. Exmple 2.4. Consider the epistemic stte s 1 of Figure 1. It represents sitution where p holds in the ctul world (w), ut where the two gents, nd, don t know this: s 1 = p p p. Consider now the epistemic ction α 1 = (A, e) of the sme figure. It represents privte nnouncement of p to gent, tht is, gent is told tht p holds (the ctul event, e), ut gent thinks tht nothing is 2792
3 s 1,,, w : p v : α 1, e: p f : (w, e): p (w, f): p, (v, f):,, s 1 α 1 Figure 1: (Top left) An epistemic stte s 1. We mrk ech world (circle) with its nme nd the tomic propositions tht re true. The ctul world is coloured lck. Edges show epistemic reltions of the gents. (Bottom left) An epistemic ction α 1. We use the sme conventions s for epistemic sttes, except n event (squre) is mrked y its nme nd its precondition. (Right) The epistemic model to the right is the result of execution of α 1 in s 1, tht is, s 1 α 1. hppening (event f). The dynmic modlity llows us to reson out the result of executing α 1 in s 1, so for instnce we hve s 1 = α 1 ( p p p): After gent hs een privtely informed out p, she will know it, ut will still not know p, nd will elieve tht doesn t either. This fct cn e verified y oserving tht p p p is true in the epistemic stte s 1 α 1 of Figure Pln existence prolem Definition 2.5 (Plnning tsks). An (epistemic) plnning tsk is triple T = (s 0, L, ϕ g ) where s 0 is finite epistemic stte clled the initil stte, L is finite set of epistemic ctions clled the ction lirry nd ϕ g L E is clled the gol. A pln for T is finite sequence α 1,..., α j of epistemic ctions from L s.t. s 0 = α 1 α j ϕ g. The sequence α 1,..., α j cn contin ny numer of repetitions, nd cn lso e empty. We sy tht T is solvle if there exists pln for T. The size of plnning tsk T = (s 0, L, ϕ g ) is given s follows. Following [Aucher nd Schwrzentruer, 2013], for ny α = (A, e) in L we define α = Ag E A 2 + e E pre(e) s the size of α, where pre(e) denotes the length of the (propositionl) formul pre(e). The size of n epistemic ction is lwys finite numer, since the domin of ny propositionl ction model nd Ag re oth finite. Let P P e the finite set of tomic propositions tht occur either in some precondition of n α L or in ϕ g. The size T is then T = P Ag W M 2 + α L α + ϕ g where s 0 = (M, w). Note tht pln is nothing more thn sequence of epistemic ctions leding to gol. It is not hrd to show tht this definition is equivlent to the definition of solution [Aucher nd Bolnder, 2013] nd n explntory dignosis [Yu et l., 2013], which re oth specil cses of solution to clssicl plnning tsk s defined in [Ghll et l., 2004] (for the reltion to clssicl plnning tsks, see [Aucher nd Bolnder, 2013]). Exmple 2.6. Consider gin Figure 1. We ll use α 2 to refer to the privte nnouncement of p to, otined simply y swpping the epistemic reltions of nd in α 1. Consider the plnning tsk T = (s, {α 1, α 2 }, ϕ g ) with ϕ g = p p p p. It is plnning tsk in which the only ville ctions re privte nnouncements of p to either or, nd the gol is for oth nd to know p, ut without knowing tht the other knows. A pln for T is α 1, α 2, since s = α 1 α 2 ϕ g. In other words, first nnouncing p privtely to nd then privtely to will chieve the gol of them oth knowing p without knowing tht ech other knows. Definition 2.7 (Pln existence prolem). Let X denote clss of plnning tsks. The pln existence prolem for X, clled PLANEX(X) is the following decision prolem: Given plnning tsk T X, does there exists pln for T 3 Bckground on Iterting Epistemic Actions To get to grips on the pln existence prolem, we now consider the result of iterting single epistemic ction. We then proceed to derive useful chrcteristion of exctly when plnning tsk is solvle. Definition 3.1 (n-ry product). Let α = (A, e) e n epistemic ction where A = (E, Q, pre). We denote y A n = (E n, Q n, pre n ) the n-ry product of A. We define E 0 = {e}, eq 0 e for ech Ag, nd pre 0 (e) =. For n > 0 we define E n = {(e 1,..., e n ) e i E for ll i = 1,..., n}, Q n = {((e 1,..., e n ), (f 1,..., f n )) e i Q f i for ll i = 1,..., n} for ech Ag, nd pre n ((e 1,..., e n )) = i=1,...,n pre(e i). The n-ry product of α is defined s α n = (A n, e n ), where e n denotes (e, e,..., e). } {{ } n This is not the stndrd definition of the n-ry product of n ction model, which insted goes vi definition of the product updte opertor on ction models. Definition 3.1 is equivlent to the stndrd definition when preconditions re of L Prop. The following lemm is derived from the xiomtiztion of [Bltg et l., 1998] (relying in prticulr on ction composition), nd is here stted for the cse of the n-ry product nd utilising tht preconditions re of L Prop. Lemm 3.2. For ny epistemic ction α nd ny ϕ L E we hve tht α n ϕ α n ϕ. This lemm expresses tht executing n epistemic ction n times is equivlent to executing its n-ry product once. 3.1 Bisimilrity nd Stilistion Concerning n-ry products of epistemic ctions, n interesting cse is when executing the n-ry product is equivlent to executing the (n + 1)-ry product. This puts n upper ound on the numer of times the ction needs to occur in pln since epistemic ctions with propositionl preconditions commute [Löwe et l., 2011]. To nlyse this, we introduce notions of isimultion nd n-isimultion on ction models (slightly reformulted from [Sdzik, 2006]). Definition 3.3 (Bisimilrity). Two epistemic ctions α = (A, e) nd α = (A, e ) re clled isimilr, written α α, if there exists (isimultion) reltion Z E A E A contining (e, e ) nd stisfying for every Ag: 2793
4 [tom] If (f, f ) Z then pre A (f) pre A (f ), [forth] If (f, f ) Z nd fq A g then there is g E A such tht f Q A g nd (g, g ) Z, nd [ck] If (f, f ) Z nd f Q A g then there is g E A such tht fq A g nd (g, g ) Z. Definition 3.4 (n-isimilrity). Let α = (A, e) nd α = (A, e ) e epistemic ctions. They re 0-isimilr, written α 0 α, if pre A (e) pre A (e ). For n > 0, they re n- isimilr, written α n α, if for every Ag: [tom] pre A (e) pre A (e ), [forth] If eq A f then there is n f E A such tht e Q A f nd (A, f) n 1 (A, f ), nd [ck] If e Q A f then there is n f E A such tht eq A f nd (A, f) n 1 (A, f ). The modl depth md(ϕ) of formul ϕ is defined s: md(p) = 0; md( ϕ) = md(ϕ); md(ϕ ψ) = mx{md(ϕ), md(ψ)}; md( ϕ) = 1 + md(ϕ); md( α ϕ) = md(ϕ). As epistemic ctions hve only propositionl preconditions, α -opertors do not count towrds the modl depth. This definition of modl depth, Lemm 3.5 nd Definition 3.6 re ll due to [Sdzik, 2006] (slightly reformulted). Lemm 3.5. Let α, α e two epistemic ctions nd ϕ L D. 1) If α α, then α ϕ α ϕ. 2) If md(ϕ) n nd α n α, then α ϕ α ϕ. Definition 3.6 (Stilistion). Let α e n epistemic ction. 1) α is -stilising t stge i if α i α i+k for ll k 0. 2) α is n -stilising t stge i if α i n α i+k for ll k 0. Exmple 3.7. The 2-ry product α 2 1 of α 1 of Figure 1 is: (e, e): p p (f, f):, (f, e): p (e, f): p It is esy to check tht α 1 α 2 1, using Z = {(e, (e, e)), (f, (f, f))}, This rgument cn e extended to show tht α 1 is indeed -stilising t stge 1. Since ny epistemic ction is finite, we hve: Lemm 3.8. If two epistemic ctions re n-isimilr for ll n, then they re isimilr. 3.2 Bounding the Numer of Itertions We re now redy to present our chrcteristion of when plnning tsk is solvle. We note tht Proposition 3.9 elow echoes the sentiment of [Yu et l., 2013, Theorem 5.15], in tht it sttes the conditions under which we cn restrict the serch spce when looking for pln. Proposition 3.9. Let T = (s 0, {α 1,..., α m }, ϕ g ) e plnning tsk nd B N. Suppose one of the following holds: 1) Every α i is -stilising t stge B, or 2) md(ϕ g ) = n nd every α i is n -stilising t stge B. Then T is solvle iff there exists k 1,..., k m B s.t. s 0 = α k1 1 αkm m ϕ g. Proof. Assume 2) holds (the cse of 1 is similr). Assume T is solvle, nd let α i1,..., ij e pln for T. Due to commuttivity of propositionl ction models so is ny permuttion of α i1,..., α ij [Yu et l., 2013]. We therefore hve s 0 = α 1 k 1 αm k m ϕg for some choice of k i 0. Using Lemm 3.2, it follows tht s 0 = α k 1 1 αk m ϕ g. We now let k i = min(k i, B) for ll i. By ssumption, md(ϕ g) = n nd so y definition md( α ϕ g ) = n for ny epistemic ction α. Comining this with the ssumption tht every α i is n - stilising t stge B k i, we pply 2) of Lemm 3.5 m times to conclude tht s 0 = α k1 1 αkm m ϕ g, s required. The proof of the other direction follows redily from Lemm 3.2 nd the definition of α k. Let T = {s 0, L, ϕ g } e plnning tsk with md(ϕ g ) = n. Given the proposition ove, to show tht T is solvle we only need to find the correct numer of times to iterte ech of the ctions in L, nd these numers never hve to exceed B for ctions tht re n -stilising t stge B. The following result, due to [Sdzik, 2006], shows tht such ound B exists for ny epistemic ction. Lemm Let α = (A, e) e n epistemic ction nd n nturl numer. Then α is n -stilising t stge E A n. 4 Better Bounds for Action Stilistion In this section, we prove n originl contriution, Lemm 4.2, tht generlises Sdzik s Lemm 3.10 y giving etter ound for ction stilistion. The overll point is this: Sdzik gets n unnecessrily high upper ound on when n epistemic ction (A, e) stilises y considering it possile tht ny event cn hve up to E A successors. We get etter ound y counting pths. Definition 4.1 (Underlying grphs). Let (A, e) e n epistemic ction. We define Q A = Ag Q A. The underlying grph of (A, e) is the directed grph (A, Q A ) with root e. Let (A, e) denote n epistemic ction. Note tht (e, f) Q A iff there is n edge from e to f in A lelled y some gent. Stndrd grph-theoreticl notions crry over to epistemic ctions vi their underlying grphs. For instnce, we define pth of length n in (A, e) s pth of length n in the underlying grph, tht is, sequence (e 1, e 2,..., e n+1 ) of events such tht (e i, e i+1 ) Q A for ll i = 1,..., n (we llow n = 0 nd hence pths of length 0). A pth of length n is pth of length t most n. A mximl pth of length n is pth of length n tht is not strict prefix of ny other pth of length n. We use mpths n (e) to denote the numer of distinct mximl pths of length n rooted t e. If ll nodes hve successors, this numer is simply the numer of distinct pths of length n. Note tht mpths n (e) is lwys positive numer, s there is lwys t lest one pth rooted t e (even if e hs no outgoing edges, there is still the pth of length 0). Note lso tht for ny n > 0 nd ny event e hving t lest one successor in the underlying grph: 2794
5 mpths n (e) = eq A f mpths n 1(f). (1) In the epistemic ction α 1 of Figure 1 we hve mpths 2 (e) = 3, since there re three pths of length 2, (e, e, e), (e, e, f) nd (e, f, f), nd no shorter mximl pths. Lemm 4.2. Let α = (A, e 0 ) e n epistemic ction nd n ny nturl numer. Then α is n -stilising t stge mpths n (e 0 ). Proof. When f = (f 1,..., f m ) E Am nd e A, we use occ(e, f) to denote the numer of occurrences of e in f 1,..., f m. For instnce we hve occ(e, (e, e, f, f)) = 2. We now prove the following property P(n) y induction on n. P(n): If e E Ak+1 nd e E Ak only differ y some event e occurring t lest mpths n (e )+1 times in e nd t lest mpths n (e ) times in e, then (A k+1, e) n (A k, e ). Bse cse P(0): Since mpths 0 (e ) = 1, e nd e s descried ove must contin exctly the sme events (ut not necessrily with the sme numer of occurrences). By definition of the n-ry product of n epistemic ction we get pre Ak+1 (e) pre Ak (e ). This shows (A k+1, e) 0 (A k, e ). For the induction step, ssume tht P(n 1) holds. Given e nd e s descried in P(n), we need to show (A k+1, e) n (A k, e ). [tom] is proved s P(0). [forth]: Let nd f e chosen such tht eq Ak+1 f. We need to find f such tht e Q Ak f nd (A k+1, f) n 1 (A k, f ). Clim. There exists n f such tht e Q A f nd occ(f, f) mpths n 1 (f ) + 1. Proof of Clim. By contrdiction: Suppose occ(f, f) mpths n 1 (f) for ll f with e Q A f. Since eq Ak+1 f, the numer of occurrences of e in e is equl or less thn the numer of occurrences of Q -successors of e in f. Hence we get occ(e, e) e Q A f occ(f, f) e Q A f mpths n 1(f) (y ssumption) e Q A f mpths n 1(f) (y Q A = Ag Q A ) = mpths n (e ) (y eqution (1)). However, this directly contrdicts the ssumption tht e occurs t lest mpths n (e ) + 1 times in e, nd hence the proof of the clim is complete. Let f e s gurnteed y the clim. Now we uild f to e exctly like f, except we omit one of the occurrences of f (we do not hve to worry out the order of the elements of the vectors, since ny two vectors only differing in order re isimilr [Sdzik, 2006]). Since f nd f now only differ in f occurring t lest mpths n 1 (f ) + 1 times in f nd t lest mpths n 1 (f ) times in f, we cn use the induction hypothesis P(n 1) to conclude tht (A k+1, f) n 1 (A k, f ), s required. [ck]: This is the esy direction nd is omitted. Now we hve proved P(n) for ll n. Given n, from P(n) it follows tht (A k+1, e k+1 0 ) n (A k, e k 0) for ll k mpths n (e 0 ). And from this it immeditely follows tht (A, e 0 ) is n -stilising t stge mpths n (e 0 ). r : w 1 : p 1 s 0 w 2 : p 2 w 3 : p 3 w m : p n α i e i : p i Figure 2: Initil stte nd ctions used in Theorem 5.1. procedure PlnExists ( (s 0, {α 1,..., α m }, ϕ g ), B ) ) Guess vector (k 1,..., k m ) {0,..., B} m. ) Accept when s 0 = α 1 k1 α m km ϕ g. Figure 3: Non-deterministic lgorithm for the pln existence prolem. 5 Complexity of the Pln Existence Prolem 5.1 Singleton nd Chin Epistemic Actions We define SINGLETONS s the clss of plnning tsks (s 0, L, ϕ g ), where every α = (A, e) in L is singleton; i.e. E A contins single event. Theorem 5.1. PLANEX(SINGLETONS) is NP-complete. Proof. For ny singleton epistemic ction there is t most one mximl pth of length n for ll n. Hence, y Lemm 4.2 nd 3.8, such ctions re -stilising t stge 1. In NP: Follows from Theorem 5.2 elow s SINGLETONS is contined in CHAINS. NP-hrd: We give polynomil-time reduction from SAT. Let ϕ(p 1,..., p m ) e propositionl formul where p 1,..., p m re the tomic propositions in ϕ. We construct T = (s 0, {α 1,..., α m }, ϕ g ) s.t. s 0 nd ech α i re s in Figure 2 nd ϕ g = ϕ( p 1,..., p m ) is the formul ϕ in which ech occurrence of p i is replced y p i. For ny propositionl vlution ν, let s ν e the restriction of s 0 s.t. there is n -edge from r to w i in s ν iff ν = p i. This mens ν = p i iff s ν = p i, nd so from our construction of ϕ g we hve ν = ϕ iff s ν = ϕ g. Oserve now tht s 0 α i is exctly the restriction of s 0 so tht there is no - edge from r to w i, nd tht α i is the only ction ffecting this edge. Let ν(p i ) = 0 if ν = p i nd ν(p i ) = 1 otherwise. We now hve tht ϕ is stisfile iff there is ν s.t. ν = ϕ iff s ν = ϕ g iff s 0 = α 1 ν(p1) α m ν(pm) ϕ g iff T is solvle, where the lst equivlence follows from Proposition 3.9 since ν(p i ) {0, 1} nd ech α i is -stilising t stge 1. This shows tht ϕ is stisfile iff T is solvle. For n epistemic ction α = (A, e) we sy tht α is chin if its underlying grph (A, Q A ) is 1-ry tree whose unique lef my e Q A -reflexive. We define CHAINS s the clss of plnning tsks (s 0, L, ϕ g ) where every epistemic ction in L is chin. Theorem 5.2. PLANEX(CHAINS) is NP-complete. Proof. In NP: For ny chin epistemic ction there is t most one mximl pth of length n for ll n, hence ny such ction is -stilising t stge 1 using Lemms 4.2 nd 3.8. It therefore follows from Proposition 3.9 tht, for ny T CHAINS, PlnExists(T, 1) of Figure 3 is ccepting iff T is solvle. We must show step ) to run in polynomil 2795
6 time. Now if α is chin nd s n epistemic stte, then the numer of worlds rechle from the ctul world in s α is t most the numer of worlds in s. By only keeping the rechle worlds fter ech successive product updte, we get the required, s the gol is in L E. 1 NP-hrd: Follows from Theorem 5.1 s SINGLETONS is contined in CHAINS. 5.2 Tree Epistemic Actions We now turn to epistemic ctions whose underlying grph is ny tree. Formlly, n epistemic ction (A, e) is clled tree when the underlying grph (A, Q A ) is tree whose leves my e Q A -reflexive. We cll TREES the clss of plnning tsks (s 0, L, ϕ g ) where ll epistemic ctions in L re trees. Theorem 5.3. PLANEX(TREES) is in PSPACE. Proof. Consider ny tree ction α = (A, e) nd let l(α) denote its numer of leves. As α is tree, we get mpths n (e) l(α) for ny n. Using Lemm 4.2 nd 3.8, ny tree epistemic ction α is -stilising t stge l(α). From Proposition 3.9 we therefore hve, for ny T TREES, tht PlnExists(T, mx(l(α 1 ),..., l(α m ))) of Figure 3 is ccepting iff T is solvle. Step ) cn e done in spce polynomil in the size of the input [Aucher nd Schwrzentruer, 2013]. Hence, the pln existence prolem for TREES is in NPSPACE nd therefore in PSPACE y Svitch s Thm. We now sketch proof of PSPACE-hrdness of PLANEX(TREES), y giving polynomil-time reduction from the PSPACE-hrd prolem QSAT (stisfiility of quntified oolen formuls) to PLANEX(TREES). For ny quntified oolen formul Φ = Q 1 p 1 Q n p n ϕ [p 1,..., p n ] with Q i {, }, we define the plnning tsk T Φ = (s 0, {α 1,..., α n }, ϕ st ϕ ll ) where s 0 nd ech α i re s in Figure 4 (every edge implicitly lelled y ), ϕ st = O 1 O n ϕ[ 1,..., n ], nd ϕ ll = n+1 2n, where O i = if Q i = nd O i = if Q i =. Then T Φ is polynomil in Φ nd T Φ TREES. By Lemms 5.6 nd 5.7 elow we get T Φ is solvle iff Φ is true. Hence: Theorem 5.4. PLANEX(TREES) is PSPACE-hrd. s 0. w 0 : w 1 : w 2n+1 : α i c i 1 : c i i :. t i i : t i n 1 : t i n : t i n+1 : t i 2n+1 :. i 0 :.... i i 1 : f i i : f i n 1 : f i n : f i n+1 : f i 2n+1 : Figure 4: Initil stte nd ctions used in Theorem Oserve tht even if ech ction in α 1,..., α m is -stilising t stge 1, this is not sufficient condition for memership in NP s we must lso e le to verify the pln in polynomil time. (w 0, 1 0, 2 0 ) (w 1, t 1 1, 2 1 ) (w1, f 1 1, 2 1 ) (w 2, t 1 2, t2 2 ) (w2, t1 2, f 2 2 ) (w2, f 1 2, t2 2 ) (w2, f 1 2, f 2 2 ) Non c i i -chin c 1 1 -chin c 2 1, c2 2 -chin Figure 5: Binry decision tree simulted y s 0 α 1 α 2 (n = 2). The reduction is sed on the ide tht we cn simulte (complete) inry decision tree using s = s 0 α 1 α n. Ech world t depth n of s simultes vlution, using the convention tht p i is true iff there is mximl chin of length i in this world. By nesting elief modlities we cn check if such chin exists. Ech ction α i mkes two copies of every node etween depth i nd n, which is how we cn simulte every vlution. A world w t depth i n of s is clled n i-world. It cn now e verified tht ny i-world is of the form (w i, vi 1,..., vi i, i+1 i,..., n i ) where vj i {tj i, f j i }. See lso Figure 5. For ny i-world w, we define propositionl vlution ν w on {p 1,..., p i } y ν w = p j iff t j i occurs in w. We use w 0 = (w 0, 1 0,..., n 0 ) to denote the single 0-world in s (the ctul world of s ), nd define M so tht s = (M, w 0 ). Lemm 5.5. Let w e ny n-world. Then (M, w) = ϕ[ 1,..., n ] iff ν w = ϕ[p 1,..., p n ] is true. Proof sketch. Due to the c i 1,..., c i i chin in ech α i, we hve for ny n-world w nd i n tht (M, w) = i iff t i n occurs in w, from which the result redily follows. We sy tht n n-world w is ccepting if (M, w) = ϕ[ 1,..., n ], nd for i < n we sy tht the i- world w is ccepting if some (every) child w of w is ccepting nd O i = (O i = ). Lemm 5.6. T Φ is solvle iff w 0 is ccepting. Proof sketch. As cceptnce for i < n exctly corresponds to the O 1 O n prefix, we use Lemm 5.5 to show tht (M, w 0 ) = ϕ st iff w 0 is ccepting. Now we must show: 1) (M, w 0 ) = ϕ ll, nd then 2) T Φ is solvle iff α 1,..., α n is pln for T Φ. We omit proofs of oth 1) nd 2). Lemm 5.7. Φ is true iff w 0 is ccepting. Proof sketch. Let w denote ny i-world. Let ν w (p i ) = if ν w = p i nd ν w (p i ) = otherwise. We define Φ w = Q i+1 p i+1 Q n p n ϕ[ν w (p 1 ),..., ν w (p i ), p i+1,..., p n ]. By induction on k we now show: If k n nd w is n (n k)-world, then Φ w is true iff w is ccepting. For the se cse, k = 0 nd w is n n-world, hence ϕ[ν w (p 1 ),..., ν w (p n )] (= Φ w ) is true iff w is ccepting y Lemm 5.5. For the induction step we ssume tht for ny (n (k 1))-world w, Φ w is true iff w is ccepting. Let w e n (n k)-world. By construction, w hs two children v nd u. We cn then show tht Φ v nd Φ u re s Φ w, except the Q n k+1 p n k+1 prefix nd tht one sets p n k+2 true nd the other sets p n k+2 flse. Thus Φ w is true iff Q n k+1 = (or, Q n k+1 = ) nd Φ w is true for some (every) child w 2796
7 of w. Using the induction hypothesis, we get tht Φ w is true iff w is ccepting for some (every) child w of w. Hence, Φ w is true iff w is ccepting, y definition. This concludes the induction proof. For k = n it follows tht Φ w0 is true iff w 0 is ccepting. Since Φ = Φ w0 we re done. 5.3 Aritrry Epistemic Actions We cll GRAPHS the clss of plnning tsks (s 0, L, ϕ g ) where ll event models in L re ritrry grphs. In this cse, the originl result y Sdzik (Lemm 3.10) is sufficient. Theorem 5.8. PLANEX(GRAPHS) is in EXPSPACE. Proof. We consider (s 0, {α 1,..., α m }, ϕ g ) GRAPHS with α i = (A i, e i ) nd md(ϕ g ) = d. By Lemm 3.10, ech α i is d -stilising t stge E Ai d. It now follows from Proposition 3.9 tht PlnExists(T, mx{ E A1 d,..., E Am d }) of Figure 3 is ccepting iff T is solvle. The lgorithm runs in NEXPSPACE = EXPSPACE. 6 Complexity of the Pln Verifiction Prolem The pln verifiction prolem is defined s the following decision prolem: Given finite epistemic stte s 0 nd formul of the form α 1 α j ϕ g, does s 0 = α 1 α j ϕ g hold The pln verifiction prolem cn e seen s restriction of the model checking prolem in DEL. A similr reduction s for Theorem 5.4 gives tht: Theorem 6.1. The pln verifiction prolem (restricted to propositionl ction models tht re trees) is PSPACE-hrd. Model checking in DEL with the non-determinism opertor included in the lnguge hs lredy een proved PSPACE-hrd [Aucher nd Schwrzentruer, 2013]. Theorem 6.1 implies tht model checking in DEL is PSPACE-hrd even without this opertor. A similr result hs een independently proved in [vn de Pol et l., 2015]. 7 Future Work We remind the reder tht n overview of our contriutions re found in Tle 1 nd proceed to discuss future work. Since propostionl STRIPS plnning is PSPACE-complete [Bylnder, 1994], efficient plnning systems hve used relxed plnning tsks in order to efficiently compute precise heuristics. For instnce, the highly influentil Fst-Forwrd plnning system [Hoffmnn nd Neel, 2001] relxes plnning tsks y ignoring delete lists. Our contriutions here show tht restrictions on the grphs underlying epistemic ctions crucilly ffect computtionl complexity. This, in comintion with restrictions on preconditions nd postconditions (fctul chnge), provides pltform for investigting (trctle) relxtions of epistemic plnning tsks, nd hence for the development of efficient epistemic plnning systems. References [Andersen et l., 2012] Mikkel Birkegrd Andersen, Thoms Bolnder, nd Mrtin Holm Jensen. Conditionl epistemic plnning. In Luis Friñs del Cerro, Andres Herzig, nd Jérôme Mengin, editors, JELIA, volume 7519 of Lecture Notes in Computer Science, pges Springer, [Aucher nd Bolnder, 2013] Guillume Aucher nd Thoms Bolnder. Undecidility in epistemic plnning. In Frncesc Rossi, editor, IJCAI. IJCAI/AAAI, [Aucher nd Schwrzentruer, 2013] Guillume Aucher nd Frnçois Schwrzentruer. On the complexity of dynmic epistemic logic. In TARK, [Bltg et l., 1998] Alexndru Bltg, Lwrence S. Moss, nd Slwomir Solecki. The logic of pulic nnouncements, common knowledge, nd privte suspicions. In TARK, [Bolnder nd Andersen, 2011] Thoms Bolnder nd Mikkel Birkegrd Andersen. Epistemic plnning for single nd multi-gent systems. Journl of Applied Non-Clssicl Logics, 21(1):9 34, [Bylnder, 1994] Tom Bylnder. The computtionl complexity of propositionl strips plnning. Artificil Intelligence, 69(1-2): , [Ghll et l., 2004] Mlik Ghll, Dn S. Nu, nd Polo Trverso. Automted Plnning: Theory nd Prctice. Morgn Kufmnn, [Hoffmnn nd Neel, 2001] Jörg Hoffmnn nd Bernhrd Neel. The ff plnning system: Fst pln genertion through heuristic serch. Journl of Artificil Intelligence Reseserch, 14(1): , My [Jensen, 2014] Mrtin Holm Jensen. Epistemic nd Doxstic Plnning. PhD thesis, Technicl University of Denmrk, DTU Compute PHD [Löwe et l., 2011] Benedikt Löwe, Eric Pcuit, nd Andres Witzel. Del plnning nd some trctle cses. In Hns vn Ditmrsch, Jérôme Lng, nd Shier Ju, editors, Logic, Rtionlity, nd Interction, volume 6953 of Lecture Notes in Computer Science, pges Springer Berlin Heidelerg, [Muert, 2014] Bstien Muert. Logicl foundtions of gmes with imperfect informtion: uniform strtegies. PhD thesis, PhD thesis directed y Pinchint, Sophie nd Aucher, Guillume. Université de Rennes 1. [Miller nd Moss, 2005] Joseph S Miller nd Lwrence S Moss. The undecidility of iterted modl reltiviztion. Studi Logic, 79(3): , [Sdzik, 2006] Tomsz Sdzik. Exploring the Iterted Updte Universe. ILLC Pulictions PP , [vn Benthem, 2003] John vn Benthem. One is lonely numer: On the logic of communiction [vn de Pol et l., 2015] Iris vn de Pol, Iris vn Rooij, nd Jku Szymnik. Prmeterized complexity results for model of theory of mind sed on dynmic epistemic logic. In TARK, [Yu et l., 2013] Qun Yu, Ximing Wen, nd Yongmei Liu. Multi-gent epistemic explntory dignosis vi resoning out ctions. In Frncesc Rossi, editor, IJCAI. IJ- CAI/AAAI,
Reasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationModular Generic Verification of LTL Properties for Aspects
Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte
More informationand thus, they are similar. If k = 3 then the Jordan form of both matrices is
Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If
More informationOne Minute To Learn Programming: Finite Automata
Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More informationRegular Repair of Specifications
Regulr Repir of Specifictions Michel Benedikt Oxford University michel.enedikt@coml.ox.c.uk Griele Puppis Oxford University griele.puppis@coml.ox.c.uk Cristin Riveros Oxford University cristin.riveros@coml.ox.c.uk
More information. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2
7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6
More informationBayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationExample 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.
2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this
More informationOutline of the Lecture. Software Testing. Unit & Integration Testing. Components. Lecture Notes 3 (of 4)
Outline of the Lecture Softwre Testing Lecture Notes 3 (of 4) Integrtion Testing Top-down ottom-up ig-ng Sndwich System Testing cceptnce Testing istriution of ults in lrge Industril Softwre System (ISST
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More informationBasic Research in Computer Science BRICS RS-02-13 Brodal et al.: Solving the String Statistics Problem in Time O(n log n)
BRICS Bsic Reserch in Computer Science BRICS RS-02-13 Brodl et l.: Solving the String Sttistics Prolem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl Rune
More informationGenerating In-Line Monitors For Rabin Automata
Generting In-Line Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon Adrien-Pouliot, 1065, venue de l Medecine Queec
More informationSolving the String Statistics Problem in Time O(n log n)
Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl 1,,, Rune B. Lyngsø 3, Ann Östlin1,, nd Christin N. S. Pedersen 1,2, 1 BRICS, Deprtment of Computer Science, University of Arhus,
More informationOn decidability of LTL model checking for process rewrite systems
Act Informtic (2009) 46:1 28 DOI 10.1007/s00236-008-0082-3 ORIGINAL ARTICLE On decidbility of LTL model checking for process rewrite systems Lur Bozzelli Mojmír Křetínský Vojtěch Řehák Jn Strejček Received:
More informationMath 314, Homework Assignment 1. 1. Prove that two nonvertical lines are perpendicular if and only if the product of their slopes is 1.
Mth 4, Homework Assignment. Prove tht two nonverticl lines re perpendiculr if nd only if the product of their slopes is. Proof. Let l nd l e nonverticl lines in R of slopes m nd m, respectively. Suppose
More informationIntegration by Substitution
Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is
More informationAntiSpyware Enterprise Module 8.5
AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility
More informationProtocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationConcept Formation Using Graph Grammars
Concept Formtion Using Grph Grmmrs Istvn Jonyer, Lwrence B. Holder nd Dine J. Cook Deprtment of Computer Science nd Engineering University of Texs t Arlington Box 19015 (416 Ytes St.), Arlington, TX 76019-0015
More informationSection 5-4 Trigonometric Functions
5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationAutomated Grading of DFA Constructions
Automted Grding of DFA Constructions Rjeev Alur nd Loris D Antoni Sumit Gulwni Dileep Kini nd Mhesh Viswnthn Deprtment of Computer Science Microsoft Reserch Deprtment of Computer Science University of
More informationAll pay auctions with certain and uncertain prizes a comment
CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin
More information5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.
5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued
More informationLearning Workflow Petri Nets
Lerning Workflow Petri Nets Jvier Esprz, Mrtin Leucker, nd Mximilin Schlund Technische Universität München, Boltzmnnstr. 3, 85748 Grching, Germny {esprz,leucker,schlund}@in.tum.de Abstrct. Workflow mining
More informationOn the Robustness of Most Probable Explanations
On the Robustness of Most Probble Explntions Hei Chn School of Electricl Engineering nd Computer Science Oregon Stte University Corvllis, OR 97330 chnhe@eecs.oregonstte.edu Adnn Drwiche Computer Science
More informationFORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES
FORMAL LANGUAGES, AUTOMATA AND THEORY OF COMPUTATION EXERCISES ON REGULAR LANGUAGES Introduction This compendium contins exercises out regulr lnguges for the course Forml Lnguges, Automt nd Theory of Computtion
More informationMODULE 3. 0, y = 0 for all y
Topics: Inner products MOULE 3 The inner product of two vectors: The inner product of two vectors x, y V, denoted by x, y is (in generl) complex vlued function which hs the following four properties: i)
More informationPentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful
Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this
More informationUnambiguous Recognizable Two-dimensional Languages
Unmbiguous Recognizble Two-dimensionl Lnguges Mrcell Anselmo, Dor Gimmrresi, Mri Mdoni, Antonio Restivo (Univ. of Slerno, Univ. Rom Tor Vergt, Univ. of Ctni, Univ. of Plermo) W2DL, My 26 REC fmily I REC
More informationSource Code verification Using Logiscope and CodeReducer. Christophe Peron Principal Consultant Kalimetrix
Source Code verifiction Using Logiscope nd CodeReducer Christophe Peron Principl Consultnt Klimetrix Agend Introducing Logiscope: Improving confidence nd developer s productivity Bsed on stte-of-the-rt
More informationSection 5.2, Commands for Configuring ISDN Protocols. Section 5.3, Configuring ISDN Signaling. Section 5.4, Configuring ISDN LAPD and Call Control
Chpter 5 Configurtion of ISDN Protocols This chpter provides instructions for configuring the ISDN protocols in the SP201 for signling conversion. Use the sections tht reflect the softwre you re configuring.
More informationRTL Power Optimization with Gate-level Accuracy
RTL Power Optimiztion with Gte-level Accurcy Qi Wng Cdence Design Systems, Inc Sumit Roy Clypto Design Systems, Inc 555 River Oks Prkwy, Sn Jose 95125 2903 Bunker Hill Lne, Suite 208, SntClr 95054 qwng@cdence.com
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More informationWarm-up for Differential Calculus
Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:
More informationSPECIAL PRODUCTS AND FACTORIZATION
MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come
More informationAnswer, Key Homework 10 David McIntyre 1
Answer, Key Homework 10 Dvid McIntyre 1 This print-out should hve 22 questions, check tht it is complete. Multiple-choice questions my continue on the next column or pge: find ll choices efore mking your
More information2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration
Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting
More informationYour duty, however, does not require disclosure of matter:
Your Duty of Disclosure Before you enter into contrct of generl insurnce with n insurer, you hve duty, under the Insurnce Contrcts Act 1984 (Cth), to disclose to the insurer every mtter tht you know, or
More informationHow To Make A Network More Efficient
Rethinking Virtul Network Emedding: Sustrte Support for Pth Splitting nd Migrtion Minln Yu, Yung Yi, Jennifer Rexford, Mung Ching Princeton University Princeton, NJ {minlnyu,yyi,jrex,chingm}@princeton.edu
More informationP.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn
33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of
More information4.11 Inner Product Spaces
314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces
More informationSolution to Problem Set 1
CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let
More informationDAGmaps: Space Filling Visualization of Directed Acyclic Graphs
Journl of Grph Algorithms nd Applictions http://jg.info/ vol. 13, no. 3, pp. 319 347 (2009) DAGmps: Spce Filling Visuliztion of Directed Acyclic Grphs Vssilis Tsirs 1,2 Sofi Trintfilou 1,2 Ionnis G. Tollis
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
More informationOr more simply put, when adding or subtracting quantities, their uncertainties add.
Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re
More informationLearning Outcomes. Computer Systems - Architecture Lecture 4 - Boolean Logic. What is Logic? Boolean Logic 10/28/2010
/28/2 Lerning Outcomes At the end of this lecture you should: Computer Systems - Architecture Lecture 4 - Boolen Logic Eddie Edwrds eedwrds@doc.ic.c.uk http://www.doc.ic.c.uk/~eedwrds/compsys (Hevily sed
More informationOn the expressive power of temporal logic
On the expressive power of temporl logic Joëlle Cohen, Dominique Perrin nd Jen-Eric Pin LITP, Pris, FRANCE Astrct We study the expressive power of liner propositionl temporl logic interpreted on finite
More informationIn addition, the following elements form an integral part of the Agency strike prevention plan:
UNITED STTES DEPRTMENT OF GRICULTURE Wshington, DC 20250 Federl Grin Inspection Service FGIS Directive 4711.2 6/16/80 STRIKE PREVENTION ND STRIKE CONTINGENCY PLNS I PURPOSE This Instruction: Estlishes
More informationDATABASDESIGN FÖR INGENJÖRER - 1056F
DATABASDESIGN FÖR INGENJÖRER - 06F Sommr 00 En introuktionskurs i tssystem http://user.it.uu.se/~ul/t-sommr0/ lt. http://www.it.uu.se/eu/course/homepge/esign/st0/ Kjell Orsorn (Rusln Fomkin) Uppsl Dtse
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University
More informationASG Techniques of Adaptivity
ASG Techniques of Adptivity Hrld Meyer nd Dominik Kuropk nd Peter Tröger Hsso-Plttner-Institute for IT-Systems-Engineering t the University of Potsdm Prof.-Dr.-Helmert-Strsse 2-3, 14482 Potsdm, Germny
More informationLower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines
Lower Bound for Envy-Free nd Truthful Mespn Approximtion on Relted Mchines Lis Fleischer Zhenghui Wng July 14, 211 Abstrct We study problems of scheduling jobs on relted mchines so s to minimize the mespn
More information9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes
The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors
More informationSection 7-4 Translation of Axes
62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationNetwork Configuration Independence Mechanism
3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting
More informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy
More informationUnit 6: Exponents and Radicals
Eponents nd Rdicls -: The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N): - counting numers. {,,,,, } Whole Numers (W): - counting numers with 0. {0,,,,,, } Integers (I): -
More informationAdvanced Baseline and Release Management. Ed Taekema
Advnced Bseline nd Relese Mngement Ed Tekem Introduction to Bselines Telelogic Synergy uses bselines to perform number of criticl configurtion mngement tsks. They record the stte of the evolving softwre
More informationExample A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding
1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde
More information2 DIODE CLIPPING and CLAMPING CIRCUITS
2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of
More informationQuick Reference Guide: One-time Account Update
Quick Reference Guide: One-time Account Updte How to complete The Quick Reference Guide shows wht existing SingPss users need to do when logging in to the enhnced SingPss service for the first time. 1)
More informationGene Expression Programming: A New Adaptive Algorithm for Solving Problems
Gene Expression Progrmming: A New Adptive Algorithm for Solving Prolems Cândid Ferreir Deprtmento de Ciêncis Agráris Universidde dos Açores 9701-851 Terr-Chã Angr do Heroísmo, Portugl Complex Systems,
More informationOnline Multicommodity Routing with Time Windows
Konrd-Zuse-Zentrum für Informtionstechnik Berlin Tkustrße 7 D-14195 Berlin-Dhlem Germny TOBIAS HARKS 1 STEFAN HEINZ MARC E. PFETSCH TJARK VREDEVELD 2 Online Multicommodity Routing with Time Windows 1 Institute
More information, and the number of electrons is -19. e e 1.60 10 C. The negatively charged electrons move in the direction opposite to the conventional current flow.
Prolem 1. f current of 80.0 ma exists in metl wire, how mny electrons flow pst given cross section of the wire in 10.0 min? Sketch the directions of the current nd the electrons motion. Solution: The chrge
More informationLec 2: Gates and Logic
Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on we-pge Use it for prtner finding First ssignment is to find prtners Due this
More informationRIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS
RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS Known for over 500 yers is the fct tht the sum of the squres of the legs of right tringle equls the squre of the hypotenuse. Tht is +b c. A simple proof is
More informationSmall Businesses Decisions to Offer Health Insurance to Employees
Smll Businesses Decisions to Offer Helth Insurnce to Employees Ctherine McLughlin nd Adm Swinurn, June 2014 Employer-sponsored helth insurnce (ESI) is the dominnt source of coverge for nonelderly dults
More informationSolving BAMO Problems
Solving BAMO Problems Tom Dvis tomrdvis@erthlink.net http://www.geometer.org/mthcircles Februry 20, 2000 Abstrct Strtegies for solving problems in the BAMO contest (the By Are Mthemticl Olympid). Only
More informationA Conditional Model of Deduplication for Multi-Type Relational Data
A Conditionl Model of Dedupliction for Multi-Type Reltionl Dt Aron Culott, Andrew McCllum Deprtment of Computer Science University of Msschusetts Amherst, MA 01003 {culott, mccllum}@cs.umss.edu Astrct
More informationAssumption Generation for Software Component Verification
Assumption Genertion for Softwre Component Verifiction Dimitr Ginnkopoulou Corin S. Păsărenu RIACS/USRA Kestrel Technologies LLC NASA Ames Reserch Center Moffett Field, CA 94035-1000, USA {dimitr, pcorin}@emil.rc.ns.gov
More informationPointed Regular Expressions
Pointed Regulr Expressions Andre Asperti 1, Cludio Scerdoti Coen 1, nd Enrico Tssi 2 1 Deprtment of Computer Science, University of Bologn sperti@cs.unio.it scerdot@cs.unio.it 2 INRIA-Micorsoft tssi@cs.unio.it
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply
More informationA formal model for databases in DNA
A forml model for dtses in DNA Joris J.M. Gillis nd Jn Vn den Bussche Hsselt University nd trnsntionl University of Limurg Astrct Our gol is to etter understnd, t theoreticl level, the dtse spects of DNA
More informationIaaS Configuration for Virtual Platforms
IS Configurtion for Virtul Pltforms vcloud Automtion Center 6.0 This document supports the version of ech product listed nd supports ll susequent versions until the document is replced y new edition. To
More informationLecture 5. Inner Product
Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right
More informationQoS Framework for SIP Signalling
QoS Frmework for SIP Signlling Alexnder A. Kist nd Richrd J. Hrris RMIT University Melourne BOX 2476V, Victori 3001, Austrli Emil: kist@ieee.org, richrd@ctt.rmit.edu.u ABSTRACT The Session Initition Protocol
More informationMorgan Stanley Ad Hoc Reporting Guide
spphire user guide Ferury 2015 Morgn Stnley Ad Hoc Reporting Guide An Overview For Spphire Users 1 Introduction The Ad Hoc Reporting tool is ville for your reporting needs outside of the Spphire stndrd
More informationHow fast can we sort? Sorting. Decision-tree model. Decision-tree for insertion sort Sort a 1, a 2, a 3. CS 3343 -- Spring 2009
CS 4 -- Spring 2009 Sorting Crol Wenk Slides courtesy of Chrles Leiserson with smll chnges by Crol Wenk CS 4 Anlysis of Algorithms 1 How fst cn we sort? All the sorting lgorithms we hve seen so fr re comprison
More informationBabylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity
Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University
More informationScalable Mining of Large Disk-based Graph Databases
Sclle Mining of Lrge Disk-sed Grph Dtses Chen Wng Wei Wng Jin Pei Yongti Zhu Bile Shi Fudn University, Chin, {chenwng, weiwng1, 2465, shi}@fudn.edu.cn Stte University of New York t Bufflo, USA & Simon
More informationNew Internet Radio Feature
XXXXX XXXXX XXXXX /XW-SMA3/XW-SMA4 New Internet Rdio Feture EN This wireless speker hs een designed to llow you to enjoy Pndor*/Internet Rdio. In order to ply Pndor/Internet Rdio, however, it my e necessry
More informationJaERM Software-as-a-Solution Package
JERM Softwre-s--Solution Pckge Enterprise Risk Mngement ( ERM ) Public listed compnies nd orgnistions providing finncil services re required by Monetry Authority of Singpore ( MAS ) nd/or Singpore Stock
More informationPhysics 43 Homework Set 9 Chapter 40 Key
Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x
More informationVirtual Machine. Part II: Program Control. Building a Modern Computer From First Principles. www.nand2tetris.org
Virtul Mchine Prt II: Progrm Control Building Modern Computer From First Principles www.nnd2tetris.org Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 8: Virtul Mchine,
More informationDecision Rule Extraction from Trained Neural Networks Using Rough Sets
Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT
More informationKinetic Collision Detection Between Two Simple Polygons
Kinetic Collision Detection Between Two Simple Polygons Julien Bsch Jeff Erickson Leonids J. Guis John Hersherger Li Zhng Astrct We design kinetic dt structure for detecting collisions etween two simple
More information