K. Marriott

Publications
Influence

The Semantics of Constraint Logic Programs

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

The Constraint Logic Programming (CLP) Scheme gave a formal framework, based on constraints, for the basic operational, logical and algebraic semantics of an extended class of logic programs. Expand

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

We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate these classes and their efficient implementation for dependency analyses. Expand

Constraint multiset grammars

K. Marriott
Computer Science
Proceedings of IEEE Symposium on Visual…
4 October 1994

Constraint multiset grammars provide a general, high-level framework for the definition of visual languages. Expand

Boolean Functions for Dependency Analysis: Algebraic Properties and Efficient Representation

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

We identify two classes of Boolean functions that have been used: positive and definite functions, and we systematically investigate their efficient implementation for dependency analyses. Expand

Immersive Analytics

Tom Chandler, Maxime Cordeil, +8 authors E. Wilson
Computer Science
Big Data Visual Analytics (BDVA)
1 September 2015

Immersive Analytics is an emerging research thrust investigating how new interaction and display technologies can be used to support analytical reasoning and decision making. Expand

Fast Node Overlap Removal

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

The problem of node overlap removal is to adjust the layout generated by typical graph drawing methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions. Expand

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 by using Boolean functions as approximations to groundness dependencies between variables. Expand

GraVVITAS: Generic Multi-touch Presentation of Accessible Graphics

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

We present a new multimodal computer tool, GraVVITAS, for presenting accessible graphics to people who are blind. Expand

Unification Revisited

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

In the literature, unification is often treated as a simple and straightforward matter, even though it is recognized as a deep and fundamental concept. Expand

Solving linear arithmetic constraints for user interface applications

A. Borning, K. Marriott, Peter James Stuckey, Yi Xiao
Computer Science, Mathematics
UIST '97
1 October 1997

We describe incremental algorithms based on the dual simplex and active set methods that can solve such systems of constraints efficiently. Expand

Recommended Authors