Share This Author
Programming with Constraints: An Introduction
Part 1 Constraints: constraints simplifications, optimization and implication finite constraint domains, and other constraint programming languages.
The Semantics of Constraint Logic Programs
Two Classes of Boolean Functions for Dependency Analysis
- T. Chandler, Maxime Cordeil, Elliott Wilson
- Computer ScienceBig Data Visual Analytics (BDVA)
- 1 September 2015
The focus in this position paper is on bringing attention to the higher-level usability and design issues in creating effective user interfaces for data analytics in immersive environments.
Constraint multiset grammars
- K. Marriott
- Computer ScienceProceedings of IEEE Symposium on Visual…
- 4 October 1994
A formal semantics for constraint multiset grammars is given, the theoretical complexity of parsing with these grammARS is investigated, and an incremental parsing algorithm is given.
Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation
This work systematically investigates two classes of Boolean functions used for dependency analyses: positive and definite functions, and shows that both classes are closed under existential quantification.
Fast Node Overlap Removal
An O(n log n) algorithm for achieving node overlap removal assuming that the number of nodes overlapping any single node is bounded by some constant is given.
Precise and efficient groundness analysis for logic programs
We show how precise groundness information can be extracted from logic programs. The idea is to use abstract interpretation with Boolean functions as “approximations” to groundness dependencies…
GraVVITAS: Generic Multi-touch Presentation of Accessible Graphics
GraVVITAS is the first practical, generic, low cost approach to providing refreshable accessible graphics, and it is believed that it can be used to understand a variety of graphics - tables, line graphs, and floorplans.