Work

Solving linear arithmetic constraints for user interface applications

Year: 1997

Type: conference-paper

Abstract: Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring that a pane occupy the leftmost l/3 of a window, or preferring that an object be contained within a rectangle if possible.Current constraint solvers designed for UI applications cannot efficiently handle simultaneous linear equations and inequalities.This is a major limitation.We describe incremental algorithms based on the dual simplex and active set methods that can solve such systems of constraints efficiently.

Source: ACM Symposium on User Interface Software and Technology (UIST)

DOI: 10.1145/263407.263518

Authors: Alan Borning, Kim Marriott, Peter Stuckey, Yi Xiao

Institutions: University of Washington, Monash University, The University of Melbourne

Language: English

Topic: Constraint Satisfaction and Optimization

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, US-UK Fulbright Commission, Monash University, University of Melbourne

Awards: Constraint-Based Languages and Environments for Building Interactive Systems, Constraint Imperative Programming