Constraints for the web

Borning, Alan; Lin, Richard Kuang-Hsu; Marriott, Kim

doi:10.1145/266180.266361

Cited by 39 publications

(21 citation statements)

References 19 publications

(8 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similarly the last three components of the strength tuple are encoded as 10 i , 10 c , 10 t . 5 Since the Cassowary toolkit operates on constraints with strengths that are a single n-tuple, we internally use 9-tuples to represent strengths-for example, 1, 0, 0, 0, 0, 0, 10 0 , 10 1 , 10 0 is the strength of a user-specified !important constraint whose selector only contains a single class name.…”

Section: Constraint Solving Algorithmsmentioning

confidence: 99%

Constraint cascading style sheets for the Web

Badros

Borning

Marriott

et al. 1999

Proceedings of the 12th Annual ACM Symposium on User Interface Software and Technology

Self Cite

View full text Add to dashboard Cite

Cascading Style Sheets have been introduced by the W3C as a mechanism for controlling the appearance of HTML documents. In this paper, we demonstrate how constraints provide a powerful unifying formalism for declaratively understanding and specifying style sheets for web documents. With constraints we can naturally and declaratively specify complex behaviour such as inheritance of properties and cascading of conflicting style rules. We give a detailed description of a constraint-based style sheet model, CCSS, which is compatible with virtually all of the CSS 2.0 specification. It allows more flexible specification of layout, and also allows the designer to provide multiple layouts that better meet the desires of the user and environmental restrictions. We also describe a prototype extension of the Amaya browser that demonstrates the feasibility of CCSS.

show abstract

Section: Constraint Solving Algorithmsmentioning

confidence: 99%

Constraint cascading style sheets for the Web

Badros

Borning

Marriott

et al. 1999

Proceedings of the 12th Annual ACM Symposium on User Interface Software and Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…The combined size of the specialized solvers might be large, but for small numbers of plans such an approach can work well. In one demonstration [4], in a user interface for modifying a polygon interactively with a mouse, a general purpose constraint solver was obviated by eight specialized solvers, one for each possible control point of the polygon.…”

Section: Related Workmentioning

confidence: 99%

Specializing planners for hierarchical multi-way dataflow constraint systems

Järvi

Foust

Haveraaen

2014

Proceedings of the 2014 International Conference on Generative Programming: Concepts and Experiences

View full text Add to dashboard Cite

A constraint system consists of variables and a set of constraints on those variables. To solve a constraint system is to find a valuation that satisfies all constraints; or the "best" subset of constraints if not all can simultaneously be satisfied. In a multi-way dataflow constraint system, solving requires selecting a set of user-defined functions which, when executed, will enforce the constraints. The task of selecting these functions is called planning. The planner has two kinds of input: the specification of the constraints and an order of priority for those constraints. The former typically changes seldom, while the latter frequently, making constraint planning a potential application for program specialization. This paper shows how to generate specialized planners for hierarchical multi-way dataflow constraint systems when the constraints are known in advance. The specialized planners are DFAs; they can be an order of magnitude or more faster than a general purpose planner for the same system. Our applications for constraint systems are in user interface programming, where constraint systems determine how a GUI should react to user interaction-specialized planners can help to ensure that GUIs' responses to user interaction are instantaneous.

show abstract

“…In part because of these limitations, hierarchical multiway propagation constraints were used in [78,79,28] and linear arithmetic constraints were used in [12,43,3,4,58].…”

Section: Fine-tuningmentioning

confidence: 99%

Review of automatic document formatting

Hurst

Marriott

2009

Proceedings of the 9th ACM Symposium on Document Engineering

Self Cite

View full text Add to dashboard Cite

We review the literature on automatic document formatting with an emphasis on recent work in the field. One common way to frame document formatting is as a constrained optimization problem where decision variables encode element placement, constraints enforce required geometric relationships, and the objective function measures layout quality. We present existing research using this framework, describing the kind of optimization problem being solved and the basic optimization techniques used to solve it. Our review focuses on the formatting of primarily textual documents, including both micro-and macro-typographic concerns. We also cover techniques for automatic table layout. Related problems such as widget and diagram layout, as well as temporal layout issues that arise in multimedia documents are outside the scope of this review.

show abstract

Constraints for the web

Cited by 39 publications

References 19 publications

Constraint cascading style sheets for the Web

Constraint cascading style sheets for the Web

Specializing planners for hierarchical multi-way dataflow constraint systems

Review of automatic document formatting

Contact Info

Product

Resources

About