Domino-tiling games

Chlebus, Bogdan S.

doi:10.1016/0022-0000(86)90036-x

Cited by 73 publications

(58 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Now p ⊆ q if and only if A does not accept any tree. This concludes the proof of (1) The proofs of the lower bound make use of a reduction from two-player corridor tiling [5]. The latter problem is the extension of corridor tiling, used in the proof of Theorem 6 (1), to two players (I and II).…”

Section: Containment Testing For Xp(dtd / // [ ] * ) Is Hard For mentioning

confidence: 99%

“…We make use of a reduction from corridor tiling which is known to be hard for pspace [5]. Let T = (D, H, V,b,t, n) be a tiling system.…”

Section: Definition 4 We Say Thatmentioning

confidence: 99%

“…However, when XML documents are restricted to a finite alphabet the containment problem turns pspace-complete. The reason for this complexity jump is that when the alphabet is finite, disjunction allows to express negation (like is the case with regular expressions), and negation allows for a reduction from corridor tiling [5]. The upper bound is obtained by a reduction to the containment problem of alternating tree automata on bounded trees.…”

mentioning

confidence: 99%

“…The upper bound is obtained by a reduction to containment of unranked tree automata [21]. The presence of the DTD allows for a reduction from two-player corridor tiling [5]. We do not know much about the complexity of more restrictive fragments in the presence of DTDs.…”

mentioning

confidence: 99%

See 3 more Smart Citations

XPath Containment in the Presence of Disjunction, DTDs, and Variables

Neven

Schwentick

2002

Lecture Notes in Computer Science

123

155

View full text Add to dashboard Cite

Abstract. XPath is a simple language for navigating an XML tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various fragments of XPath. In addition to the basic operations (child, descendant, filter, and wildcard), we consider disjunction, DTDs and variables. W.r.t. variables we study two semantics: (1) the value of variables is given by an outer context; (2) the value of variables is defined existentially. We establish an almost complete classification of the complexity of the containment problem w.r.t. these fragments.

show abstract

Section: Containment Testing For Xp(dtd / // [ ] * ) Is Hard For mentioning

confidence: 99%

“…We make use of a reduction from corridor tiling which is known to be hard for pspace [5]. Let T = (D, H, V,b,t, n) be a tiling system.…”

Section: Definition 4 We Say Thatmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

XPath Containment in the Presence of Disjunction, DTDs, and Variables

Neven

Schwentick

2002

Lecture Notes in Computer Science

123

155

View full text Add to dashboard Cite

show abstract

“…exptime exptime exptime exptime nd,c exptime exptime pspace pspace nd,bc exptime exptime pspace ptime lem [7]. Let (D, V, H,t,b) be a tiling system, where D = {t1, .…”

Section: Fixing Schema Languagesmentioning

confidence: 99%

Frontiers of tractability for typechecking simple XML transformations

Martens¹,

Neven²

2004

Proceedings of the Twenty-Third ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems

View full text Add to dashboard Cite

Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus on complete algorithms which always produce the correct answer. We consider top-down XML transformations incorporating XPath expressions and abstract document types by grammars and tree automata. By restricting schema languages and transformations, we identify several practical settings for which typechecking is in polynomial time. Moreover, the resulting framework provides a rather complete picture as we show that most scenarios can not be enlarged without rendering the typechecking problem intractable. So, the present research sheds light on when to use fast complete algorithms and when to reside to sound but incomplete ones.

show abstract

Bibliography

2010

Teamwork in Multi‐Agent Systems

View full text Add to dashboard Cite

Domino-tiling games

Cited by 73 publications

References 12 publications

XPath Containment in the Presence of Disjunction, DTDs, and Variables

XPath Containment in the Presence of Disjunction, DTDs, and Variables

Frontiers of tractability for typechecking simple XML transformations

Bibliography

Contact Info

Product

Resources

About