K. Marriott | Semantic Scholar

Programming with Constraints: An Introduction

K. Marriott, Peter James Stuckey
Computer Science, Geology
1998

Part 1 Constraints: constraints simplifications, optimization and implication finite constraint domains, and other constraint programming languages.

View via Publisher

The Semantics of Constraint Logic Programs

J. Jaffar, Michael J. Maher, K. Marriott, Peter James Stuckey
Computer Science
J. Log. Program.
1 October 1998

View via Publisher

Two Classes of Boolean Functions for Dependency Analysis

T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard
Computer Science
Sci. Comput. Program.
1 May 1998

View via Publisher

Immersive Analytics

T. Chandler, Maxime Cordeil, Elliott Wilson
Computer Science
Big 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.

View on ACM

Constraint multiset grammars

K. Marriott
Computer Science
Proceedings 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.

View on IEEE

Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation

T. Armstrong, K. Marriott, P. Schachte, H. Søndergaard
Computer Science
SAS
28 September 1994

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.

View via Publisher

Unification Revisited

J. Lassez, Michael J. Maher, K. Marriott
Education
Foundations of Deductive Databases and Logic…
15 December 1986

View via Publisher

Fast Node Overlap Removal

Tim Dwyer, K. Marriott, Peter James Stuckey
Computer Science
Graph Drawing
12 September 2005

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.

View via Publisher

Precise and efficient groundness analysis for logic programs

K. Marriott, H. Søndergaard
Computer Science
LOPL
1 March 1993

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…

View on ACM

GraVVITAS: Generic Multi-touch Presentation of Accessible Graphics

Cagatay Goncu, K. Marriott
Computer Science
INTERACT
5 September 2011

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.

View via Publisher