Name
Abstract | ||
|---|---|---|
Cascading Style Sheets (CSS) is a popular language for describing the styles of XML documents as well as HTML documents. For a DTD D and a list R of CSS rules, due to specificity R may contain “unsatisfiable” rules under D, e.g., rules that are not applied to any element of any document valid to D. In this paper, we consider the problem of detecting unsatisfiable CSS rules under DTDs. We focus on CSS fragments in which descendant, child, adjacent sibling, and general sibling combinators are allowed. We show that the problem is coNP-hard in most cases, even if only one of the four combinators is allowed. We also show that the problem is in coNP or PSPACE depending on restrictions on DTDs and CSS. Finally, we present two conditions under which the problem can be solved in polynomial time.
|
Year | DOI | Venue |
|---|---|---|
2019 | 10.1145/3315507.3330195 | Proceedings of the 17th ACM SIGPLAN International Symposium on Database Programming Languages |
Keywords | Field | DocType |
CSS, DTD, satisfiability | Programming language,Computer science | Conference |
ISBN | Citations | PageRank |
978-1-4503-6718-9 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| N. Suzuki | 1 | 52 | 17.74 |
| Takuya Okada | 2 | 0 | 0.34 |
| Yeondae Kwon | 3 | 17 | 2.88 |